摘要
多目标优化演化算法(MOEA)是一种新的解多目标优化问题(MOP)的有效算法。针对大多数MOEA采用的表示解优劣的Ranking技术存在的问题,该文提出了一种新的表示方法———树结构来表示解的关系。实验证明这种方法很好地达到Pareto最优,有效地保持解的多样性,而且收敛速度快。
Multi-objective optimal evolutionary algorithms (MOEAs )are a kind of new effective algorithms to solve Mul-ti-objective optimal problem(MOP).Because of ranking,a method which is used by most MOEAs to solve MOP,has some disadvantages,the paper puts forward a new method using tree structure to express the relation of solutions.Exper-iments prove that the method can reach the pareto front ,retain the diversity of the population,and use less time.
出处
《计算机工程与应用》
CSCD
北大核心
2005年第2期90-93,164,共5页
Computer Engineering and Applications
关键词
多目标优化
多目标优化演化算法
Pareto优
树结构
Multi-objective optimal problem,Multi-objective optimal evolutionary algorithm,Pareto dominance,tree struc-ture
