期刊文献+

基于自适应ε支配的快速多目标遗传算法

A Fast Multi-objective Genetic Algorithm Based on Self-adaptation ε-domination
下载PDF
导出
摘要 多目标遗传算法(MOGA)大体上可以分为两个步骤:构造非支配集和保持解分布度。而ε支配能将两者有机地结合起来,具有良好的时间效率及分布度。但是采用ε支配时,其ε参数难以设定,为此文章提出了一种基于自适应ε支配的快速多目标遗传算法(AEMOGA)。通过与其它的2个多目标遗传算法NSGA2和SPEA2比较,实验结果表明该文提出的算法具有良好的时间效率分布性、收敛性及时间效率。 Multi-objective Genetic Algorithm has two main steps:creating non-dominated set and keeping diversity.ε- domination can combine the two steps to one with low time complexity and good diversity.It is difficult to set ε- parameter when ε-domination is used,for this,a fast Multi-objective Genetic Algorithm(AEMOGA) based on self-adaptation ε-domination is suggested in this paper.Comparing AEMOGA with the two other MOGAs,NSGA2 and SPEA2,the result of the experiment shows that the algorithm suggested in the paper gets good diversity,convergence and low time complexity.
出处 《计算机工程与应用》 CSCD 北大核心 2006年第15期42-44,共3页 Computer Engineering and Applications
基金 国家自然科学基金资助项目(编号:90104021) 湖南省自然科学基金资助项目(编号:01JJY2060)
关键词 自适应 ε支配 多目标遗传算法 self-adaptation,ε-domination,Multi-objective Genetic Algorithm(MOGA)
  • 相关文献

参考文献8

  • 1D W Come et al.The pareto envelope-based selection algorithm for multiobjeetive optimization[C].In:M Schoenauer eds.Lecture Notes in Computer Science,Parallel Problem Solving from Nature-PPSN VI,2000; 1917:839-848
  • 2J D Knowles,D W Come.Approximating the nondominated front using the pareto archived evolution strategy[J].Evol Comput,2000;8:149-172
  • 3E Zitzler et al.SPEA2:Improving the strength pareto evolutionary algorithm for multiobjective optimization[C].In:K C Giannakoglou eds.Proc EUROGEN 2001-Evolutionary Methods for Design,Optimization and Control with Applications to Industrial Problems,2001:95-100
  • 4K Deb,S Agrawal,A Pratap et al.A fast and elitist multiobjective genetic algorithm:NSGA-II[J].IEEE Transactions on Evolutionary Computation,2002;6(2): 182-197
  • 5M Laumanns ,L Thiele,K Deb et al.Combining convergence and diversity in evolutionary multi-objective optimization[J].Evolutionary Computation, 2002, 10 (3): 263-282
  • 6邝达,郑金华.一种快速构造非支配集的方法——擂台法则[J].高技术通讯,2005,15(4):11-14. 被引量:5
  • 7Deb K,Thiele L,Laumanns M et al.Sealable Multi-Objective Optimization Test Problems[C].In:Congress on Evolutionary Computation(CEC'2002), 2002; 1:825-830
  • 8D A Van Veldhuizen,G B Lamont.Multiobjective evolutionary algorithm research:A history and analysis[R].Tech Rep TR-98-03,Dept Elec Comput Eng,Graduate School of Eng,Air Force Inst Technol,Wright-Patterson AFB,OH, 1998

二级参考文献7

  • 1Corne D W, et al. The Pareto Envelope-Based Selection Algorithm for Multiobjective Optimization, Lecture Notes in Computer Science, M. Schoenauer et al., Eds., 2000, vol. 1917, Proc. Parallel Problem Solving from Nature - PPSN VI, 839.
  • 2Corne D W, et al. The Pareto Archived Evolution Strategy: A New Baseline Algorithm for Pareto Multiobjective Optimisation. In: Proceedings of the 1999 Congress on Evolutionary Computation (CEC'99), pages 98.
  • 3Zitzler E, et al. SPEA2: Improving the strength pareto evolutionary algorithm for multiobjective optimization, in Proc. EUROGEN 2001-Evolutionary Methods for Design, Optimization and Control with Applications to Industrial Problems, K. C. Giannakoglou et al., Eds, 2001, 95.
  • 4Deb K, Pratap A, Agrawal S, et al. A Fast and Elitist Multi-Objective Genetic Algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2): 182.
  • 5Jensen M T, Reducing the Run-Time Complexity of Multiobjective EAs: The NSGA-II and other algorithms. IEEE Transactions on Evolutionary Computation, 503.
  • 6郑金华.多目标进化算法及其应用:博士后研究报告[R].中科院计算所,2004..
  • 7Deb K, Thiele L, Laumanns M, et al. Scalable multi-objective optimization test problems. In: proceeding of the Congress on Evolutionary Computation (CEC-2002), 2002. 825.

共引文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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