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

一种混合自适应多目标Memetic算法
引用本文:郭秀萍, 杨根科, 吴智铭.一种混合自适应多目标Memetic算法[J].控制与决策,2006,21(11):1234-1238.
作者姓名:郭秀萍  杨根科  吴智铭
作者单位:上海交通大学,自动化系,上海,200240
基金项目:国家自然科学基金项目(60174009).
摘    要:Memetic算法是求解多目标优化问题最有效的方法之一,融合了局部搜索和进化计算,具有较高的全局搜索能力.混合自适应多目标Memetic算法(HAMA)用基于模拟退火的加权法进行局部搜索,采用Pareto法实现交叉和变异,通过扰动增强算法的exploration能力,且进化过程可根据改善率自适应调整,以提高搜索效率并改善算法的鲁棒性.算例测试说明HAMA能产生更接近Pareto前沿且多样性更好的近似集.

关 键 词:混合  自适应  多目标优化  Memetic算法  多目标0/1背包问题
文章编号:1001-0920(2006)11-1234-05
收稿时间:2005-09-26
修稿时间:2006-01-25

A Hybrid Adaptive Multi-objective Memetic Algorithm
GUO Xiu-ping,YANG Gen-ke,WU Zhi-ming.A Hybrid Adaptive Multi-objective Memetic Algorithm[J].Control and Decision,2006,21(11):1234-1238.
Authors:GUO Xiu-ping  YANG Gen-ke  WU Zhi-ming
Affiliation:Department of Automation, Shanghai Jiaotong University, Shanghai 200240, China.
Abstract:Memetic algorithm is one of the most efficient methods for multi-objective optimization problems,incorporating local search into evolutionary computation and having high global search ability.Hybrid adaptive memetic algorithm(HAMA) uses a simulated annealing-based weighted-sum method to perform local search,uses Pareto-based approach to implement crossover and mutation,and employs perturbation to enhance the exploration capability of the algorithm.The evolution is made self-adjusted according to optimization ratio for better efficiency and robustness of the algorithm.A testing example shows that HAMA can generate near-Pareto optimal and well-extended approximation set.
Keywords:Hybrid  Adaptive  Multi-objective optimization  Memetic algorithm  Multi-objective 0/1 knapsack problem
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《控制与决策》浏览原始摘要信息
点击此处可从《控制与决策》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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