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

一种新的融合分布估计的蚁群优化算法
引用本文:许昌,常会友,徐俊,衣杨. 一种新的融合分布估计的蚁群优化算法[J]. 计算机科学, 2010, 37(2): 186-188
作者姓名:许昌  常会友  徐俊  衣杨
作者单位:中山大学信息科学与技术学院,广州,510275
摘    要:提出了一种新的融合分布估计的蚁群优化算法。该算法突破了传统蚁群过早收敛的局限性,且蚁群中的每个蚂蚁具有更全面的学习能力,从而能够有效地解决组合优化问题。仿真实验结果表明该算法的性能优于现有的其它几种蚁群优化算法。

关 键 词:蚁群优化算法  分布估计  旅行商问题  组合优化问题  
收稿时间:2009-03-25
修稿时间:2009-06-18

Novel Ant Colony Optimization Algorithm with Estimation of Distribution
XU Chang,CHANG Hui-you,XU Jun,YI Yang. Novel Ant Colony Optimization Algorithm with Estimation of Distribution[J]. Computer Science, 2010, 37(2): 186-188
Authors:XU Chang  CHANG Hui-you  XU Jun  YI Yang
Affiliation:School of Information Science and Technology/a>;Sun Yat-sen University/a>;Guangzhou 510275/a>;China
Abstract:In order to improve the performance of the ant colony optimization algorithm,a new ant colony optimization algorithm with estimation of distribution(ACO-ED) was presented.ACO-ED uses probabilistic model based on estimating the distribution of promising solutions in the search space,and adjusts the state transition rule and the global updating rule.Furthermore,ACO-ED is significantly improved by extending with a local search procedure.We applied ACO-ED to TSP problems and compared it with other ant colony op...
Keywords:Ant colony cptimization  Estimation of distribution  TSP problem  Combinatorial optimization problem  
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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