基于Pareto最优概念的多目标进化算法研究  

Research on Pareto optimal-based multiobjective evolutionary algorithms

作　　者：王向慧[1] 连志春 徐志英 唐云岚[3] 

机构地区：[1]大连交通大学,辽宁大连116028 [2]朝阳师专数学计算机系,辽宁朝阳122000 [3]武警工程学院通信工程系,西安710086

出　　处：《计算机工程与应用》2008年第27期58-61,共4页Computer Engineering and Applications

摘　　要：基于Pareto最优概念的多目标进化算法已成为多目标优化问题研究的主流方向。详细介绍了该领域的经典算法,重点阐述了各种算法在种群快速收敛并均匀分布于问题的非劣最优域上所采取的策略,并归纳了算法性能评估中需要进一步研究的几个问题。The Pareto optimal-based multi-objective evolutionary algorithm which is used to deal with multi-objective optimization problems has become a hot research topic.In this paper,some state-of-the-art algorithms in this research field are described firstly.Then,strategies adopted by various kinds of algorithms about finding the non-dominated set of solutions and distribute them uniformly in the Pareto front are elaborated.Lastly,several research points of performance evaluation which need to be further study are summarized.

关 键 词：多目标进化算法 PARETO最优 非劣解排序 适应度共享 精英策略 性能评估 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]