首页 | 本学科首页   官方微博 | 高级检索  
     

多目标混沌进化算法
引用本文:雷德明,严新平,吴智铭.多目标混沌进化算法[J].电子学报,2006,34(6):1142-1145.
作者姓名:雷德明  严新平  吴智铭
作者单位:1. 武汉理工大学智能运输系统研究中心,湖北武汉 430063;2. 武汉理工大学自动化学院,湖北武汉 430070;3. 上海交通大学自动化研究所,上海200030
基金项目:国家研究发展基金,国家高技术研究发展计划(863计划)
摘    要:设计了多目标混沌进化算法(MCEA),在每一代遗传操作和外部档案调整完成之后,该算法从外部档案中随机选择部分个体,对这些个体的拷贝进行混沌搜索,以产生更多非劣解.将强度Pareto进化算法(SPEA)和SPEA2分别与基于Logistic映射的混沌搜索结合而产生的MCEAs应用于一些复杂多目标优化问题,计算结果表明,混沌的加入,明显改善了多目标进化算法(MOEA)各方面的性能.

关 键 词:混沌  Pareto最优  多目标进化算法  
文章编号:0372-2112(2006)06-1142-04
收稿时间:2005-04-18
修稿时间:2005-04-182005-12-12

Multi-Objective Chaotic Evolutionary Algorithm
LEI De-ming,YAN Xin-ping,WU Zhi-ming.Multi-Objective Chaotic Evolutionary Algorithm[J].Acta Electronica Sinica,2006,34(6):1142-1145.
Authors:LEI De-ming  YAN Xin-ping  WU Zhi-ming
Affiliation:1. Intelligent Transportation Systems Center,Wuhan University of Technology,Wuhan,Hubei 430063,China;2. School of Automation,Wuhan University of Technology,Wuhan,Hubei 430063,China;3. Institution of Automation,Shanghai Jiaotong University,Shanghai 200030,China
Abstract:Multi-objective chaotic evolutionary algorithm(MCEA) is designed.In each generation of MCEA,after the population finishes all genetic operations and external archive maintenance is done,chaotic search is performed on the copy of several individuals randomly chosen from the external archive to obtain new non-dominated solutions.MCEAs respectively merging strength Pareto evolutionary algorithm(SPEA),SPEA2 with chaotic search based on Logistic map are applied to some complex multi-objective optimization problems.The computational results demonstrate that the comprehensive performance of multi-objective evolutionary algorithm(MOEA) is improved as a consequence of the inclusion of chaos.
Keywords:chaos  pareto optimal  multi-objective evolutionary algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《电子学报》浏览原始摘要信息
点击此处可从《电子学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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