摘要
针对多目标规划的求解问题,提出了一种新的基于灰色关联度的求解算法,该算法将多目标规划模型的多个目标函数理想值组成一个理想目标向量。在相同的约束条件下,基于目标函数向量与理想目标向量之间的灰色关联度而构造一个实值偏好函数。通过最大化这个实值偏好函数,可把多目标规划问题转变为单目标规划问题,并给出了基于遗传算法的求解步骤。通过实际算例表明,该算法正确有效,且相对于线性加权和法、平方加权和法和理想点法而言,具有较好的综合距离均衡性能。
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.
出处
《系统工程与电子技术》
EI
CSCD
北大核心
2010年第3期544-547,共4页
Systems Engineering and Electronics
基金
中国博士后科学基金(20090450217)资助课题
关键词
多目标规划
灰色理论
灰关联度
遗传算法
距离均衡
multiple objective programming
grey theory
grey relational degree
genetic algorithm
distance equilibrium
