|
计算机应用研究 2010
Solution of multi-objective programming with interval coefficients based on satisfactory degree and GA
|
Abstract:
In the condition of lack of initial knowledge, this paper gave satisfactory degree of constraint function, according to the step of genetic algorithm to solve multi-objective programming, and got non-poor solution set, then according to fitness va-lue, selected the optimal solution. At last, the examples prove the effectiveness and viability of algorithm using the method to solve multi-objective programming with interval coefficients.