Abstract:

Aiming at the solving of the multiple objective programming model, a new algorithm based on grey relational degree is put forward. Firstly, the ideal target value vector is constructed by all the ideal target values of the multiple objective programming model, and under the same constraint conditions, a grey relational function is formed based on grey relationol degree between the actual target value vector and the ideal target value vector. Then, the multiple objective programming model is changed into a single objective programming model through maximizing the grey relational function. Its solution steps based on genetic algorithm are introduced. The example shows that the proposed algorithm is correct and effective, and has the better synthetical performance of distance equilibrium compared with the linear weighted summation, square weighted summation and ideal point method.