期刊文献+

基于动态ε支配的多目标遗传算法

Multiobjective Genetic Algorithm based on dynamic ε dominance
下载PDF
导出
摘要 基于Pareto支配的MOEA存在着一些缺陷,如容易出现退化现象等。而基于ε支配的MOEA可以比较好地解决这些问题,并具有比较理想的收敛性和分布性。但是采用传统的ε-MOEA时,最大的困难就是ε的值的设定,并且传统的MOEA得出的解在边界部分个体的丢失现象也比较严重。针对这种情况提出了一种新的基于动态ε支配的多目标遗传算法(DEMOEA),它不需要手动设定ε的值,并且引入了动态网格概念来改善边界解丢失的现象。通过与其他两个经典的多目标进化算法的NSAGA-Ⅱ和SPEA-2的对比实验,表明提出的DEMOEA能在收敛性、分布性有较好的改进。 There are some limitations in MOEA based on Pareto dominance,such as it is easy to degraded and so on.Then the MOEA based on ε-dominance can solve these problems and it can make a preferable convergence and spread.But in the conventional ε-MOEA,the most difficult problem is the setting of ε and the loss of part of the extreme individuals is serious.In order to solve these problems,this paper proposes a new ε-MOEA based on dynamic ε (DEMOEA),it doesn't need to set the ε by yourself and this paper imports a concept of dynamic grid to solve the loss of extreme individuals.Comparing with two other classical algorithms NSGA-Ⅱ and SPEA2 in experiment,the result shows that the algorithm suggested in the paper(DEMOEA) gets improved convergence and diversity.,
出处 《计算机工程与应用》 CSCD 北大核心 2009年第1期69-72,共4页 Computer Engineering and Applications
基金 国家自然科学基金 国家高技术研究发展计划(863) 教育部留学回国人员科研启动基金 湖南省自然科学基金 湖南省教育厅重点科研项目(No.06A074)~~
关键词 多目标优化 动态ε支配 基于动态ε支配的多目标遗传算法(DEMOEA) multiobjective optimization dynamic ε-dominance Multi Objective Evolutionary Algorithm Based on Dynamic(DEMOEA)
  • 相关文献

参考文献14

  • 1Deb K,Pratap A,Agarwal S,et al.A fast and elitist muhiobjective Genetic Algorithm:NSGA Ⅱ[J].IEEE Transactions on Evolutionary Computation,2002,6(2):182-197.
  • 2Zitzler E,Laumanns M,Thiele L.SPEA2:improving the strength Pareto evolutionary algorithm.Technical Report 103[R].Computer Engineering and Networks Laboratory (TIK),ETH Zurich,Zurich,Switzerland,2001.
  • 3Knowles J D,Come D W.The Pareto archived evolution strategy:A new baseline algorithm for Pareto multiobjective optimization[C]// CEC'99:Proceedings of the 1999 Congress on Evolutionary Computation,IEEE Service Center,Piscataway,New Jersey,1999:98-105.
  • 4Come D W.The pareto envelope based selection algorithm for muhiobjective optimizatian[C]//Schoenauer M.LNCS:Proc Parallel Problem Solving from Nature,PPSN Ⅵ,2000,1917:839-848.
  • 5崔逊学.多目标进化算法及其应用[M].北京:国防工业出版社,2005.
  • 6Edgeworth F Y.Mathematical psychics[Z].P Keagan,london,England,1881.
  • 7Pareto V.Cours D'economie politique,volume Ⅰ and Ⅱ[Z].F Rouge,Lausanne,1896.
  • 8Knowles J,Come D.Properties of an adaptive archiving algorithm for storing nondominated vectors[J].IEEE Transactions on Evolutionary Computation,2003,7(2):100-116.
  • 9Srinivas N,Deb K.Multiobjective optimization using nondominated sorting in genetic algorithms[J].Evolutianary Computation,1994,2(3):221-248.
  • 10Zitzler E,Thiele L.Muhiobjective optimization using evolutionary algorithms:A comparative study[C]//Eiben A E.Parallel Problem Solving from Nature V,Amsterdam:Springer-Vedag,1998:292-301.

共引文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部