首页 | 官方网站   微博 | 高级检索  
     

基于自适应ε支配的快速多目标遗传算法
引用本文:陈良军,郑金华.基于自适应ε支配的快速多目标遗传算法[J].计算机工程与应用,2006,42(15):42-44.
作者姓名:陈良军  郑金华
作者单位:湘潭大学信息工程学院,湖南,湘潭,411105
基金项目:中国科学院资助项目;浙江省湖州市自然科学基金
摘    要:多目标遗传算法(MOGA)大体上可以分为两个步骤:构造非支配集和保持解分布度。而ε支配能将两者有机地结合起来,具有良好的时间效率及分布度。但是采用ε支配时,其ε参数难以设定,为此文章提出了一种基于自适应ε支配的快速多目标遗传算法(AEMOGA)。通过与其它的2个多目标遗传算法NSGA2和SPEA2比较,实验结果表明该文提出的算法具有良好的时间效率分布性、收敛性及时间效率。

关 键 词:自适应  ε支配  多目标遗传算法
文章编号:1002-8331-(2006)15-0042-03
收稿时间:2005-12
修稿时间:2005-12

A Fast Multi-objective Genetic Algorithm Based on Self-adaptation ε-domination
Chen Liangjun,Zheng Jinhua.A Fast Multi-objective Genetic Algorithm Based on Self-adaptation ε-domination[J].Computer Engineering and Applications,2006,42(15):42-44.
Authors:Chen Liangjun  Zheng Jinhua
Affiliation:Institute of Information Engineering, Xiangtan University, Xiangtan, Hunan 411105
Abstract: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.
Keywords:self-adaptation  ε-domination  Multi-objective Genetic Algorithm(MOGA)
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号