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

求解多目标组合优化的改进Pareto适应度遗传算法
引用本文:杨开兵,刘晓冰.求解多目标组合优化的改进Pareto适应度遗传算法[J].计算机工程与应用,2009,45(8):44-46.
作者姓名:杨开兵  刘晓冰
作者单位:1. 大连工业大学信息科学与工程学院,辽宁,大连,116034;大连理工大学CIMS中心,辽宁,大连,116024
2. 大连理工大学CIMS中心,辽宁,大连,116024
摘    要:将Pareto适应度遗传算法(PFGA)与局部搜索相结合,提出了一种用于求解多目标组合优化问题的改进算法IPFGA,该算法基于Pareto支配关系对遗传操作产生的每一个个体进行局部搜索,并采取在外部群体中引入拥挤距离的精英选择策略。实验结果表明,与PFGA相比,IPFGA有更快的收敛速度。

关 键 词:多目标组合优化  Pareto适应度遗传算法  局部搜索
收稿时间:2008-1-21
修稿时间:2008-4-16  

Improved Pareto Fitness Genetic Algorithm for multi-objective combinatorial optimiza-tion
YANG Kai-bing,LIU Xiao-bing.Improved Pareto Fitness Genetic Algorithm for multi-objective combinatorial optimiza-tion[J].Computer Engineering and Applications,2009,45(8):44-46.
Authors:YANG Kai-bing  LIU Xiao-bing
Affiliation:YANG Kai-bing,LIU Xiao-bing 1.College of Information Science , Engineering,Dalian Polytechnic University,Dalian,Liaoning 116034,China 2.CIMS Center,Dalian University of Technology,Liaoning 116024,China
Abstract:Combining Pareto Fitness Genetic Algorithm(PFGA) with local search,an Improved Pareto Fitness Genetic Algorithm(IPFGA) for multi-objective combinatorial optimization is proposed.In the proposed algorithm,a local search procedure is applied to each solution generated by genetic operations.The concept of Pareto dominance is used in the local search procedure,and the idea of crowding distance in the external population is used to perform elitism.The experimental results show that the IPFGA,compared with the kn...
Keywords:multi-objective combinatorial optimization  Pareto Fitness Genetic Algorithm(PFGA)  local search
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号