电子学报
電子學報
전자학보
ACTA ELECTRONICA SINICA
2014年
5期
933-939
,共7页
进化优化%高维多目标优化%决策者偏好%期望函数%降维
進化優化%高維多目標優化%決策者偏好%期望函數%降維
진화우화%고유다목표우화%결책자편호%기망함수%강유
evolutionary optimization%many-objective optimization%decision-maker′s preferences%desirability function%di-mensionality reduction
高维多目标优化问题普遍存在且非常重要,但是,已有的解决方法却很少。本文提出一种有效解决该问题的融入决策者偏好的集合进化优化方法,该方法首先基于决策者给出的每个目标的偏好区域,将原优化问题的目标函数转化为期望函数;然后,以原优化问题的多个解形成的集合为新的决策变量,以超体积和决策者期望满足度为新的目标函数,将优化问题转化为2目标优化问题;最后,采用多目标集合进化优化方法求解,得到满足决策者偏好且收敛性和分布性均衡的Pareto优化解集。将所提方法应用于4个基准高维多目标优化问题,并与其他2种方法比较,实验结果验证了所提方法的优越性。
高維多目標優化問題普遍存在且非常重要,但是,已有的解決方法卻很少。本文提齣一種有效解決該問題的融入決策者偏好的集閤進化優化方法,該方法首先基于決策者給齣的每箇目標的偏好區域,將原優化問題的目標函數轉化為期望函數;然後,以原優化問題的多箇解形成的集閤為新的決策變量,以超體積和決策者期望滿足度為新的目標函數,將優化問題轉化為2目標優化問題;最後,採用多目標集閤進化優化方法求解,得到滿足決策者偏好且收斂性和分佈性均衡的Pareto優化解集。將所提方法應用于4箇基準高維多目標優化問題,併與其他2種方法比較,實驗結果驗證瞭所提方法的優越性。
고유다목표우화문제보편존재차비상중요,단시,이유적해결방법각흔소。본문제출일충유효해결해문제적융입결책자편호적집합진화우화방법,해방법수선기우결책자급출적매개목표적편호구역,장원우화문제적목표함수전화위기망함수;연후,이원우화문제적다개해형성적집합위신적결책변량,이초체적화결책자기망만족도위신적목표함수,장우화문제전화위2목표우화문제;최후,채용다목표집합진화우화방법구해,득도만족결책자편호차수렴성화분포성균형적Pareto우화해집。장소제방법응용우4개기준고유다목표우화문제,병여기타2충방법비교,실험결과험증료소제방법적우월성。
Many-objective optimization problems are common and important in real-world applications ,previous theories and methods suitable for them ,however ,are few so far .We presented a set-based many-objective evolutionary optimization algorithm with integrating a decision-maker′s preferences to effectively solve the problems above in this study .In the proposed method ,each objective function of the original optimization problem was first transformed into a desirability function based on preference areas given by the decision-maker over it;thereafter ,the optimization problem was further transformed into a bi-objective optimization one by taking such indicators as hyper-volume and the decision-maker′s satisfaction as two new objectives in which a set formed by multiple solutions of the original optimization problem is as the new decision variable ;finally ,the transformed bi-objective optimiza-tion problem was solved by using a set-based evolutionary optimization algorithm to obtain a Pareto optimal set which meets the de-cision-maker′s preferences and balances the convergence and the distribution .The proposed method was applied to four benchmark many-objective optimization problems and compared with the other methods .The experimental results showed its advantages .