节点文献

遗传算法与蚂蚁算法融合的马尔可夫收敛性分析

On the Markov Convergence Analysis for the Combination of Genetic Algorithm and Ant Algorithm

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 丁建立陈增强袁著祉

【Author】 DING Jian-Li CHEN Zeng-Qiang YUAN Zhu-Zhi(College of Information Technology and Science , Nankai University , Tianjin 300071)

【机构】 南开大学信息技术科学学院南开大学信息技术科学学院 天津 300071天津 300071天津 300071

【摘要】 遗传算法具有快速随机的全局搜索能力,但不能很好地利用系统的反馈信息.蚂蚁系统是一种并行的分布式正反馈系统,但初始求解速度慢.遗传算法与蚂蚁算法的融合,优势互补.基于上述思想,提出遗传算法与蚂蚁算法融合的模型与方法,对该方法的收敛性进行了马尔可夫理论分析,并证明其优化解满意值序列是单调不增的和收敛的.且对NP-hard问题中的30城市TSP和中国CHN144城市TSP两个实例进行了实验分析,仿真数据表明该方法不仅是一个逐步收敛的过程,而且求解速度和求解效果都非常好.

【Abstract】 Genetic algorithm has the ability of quickly and stochastically global search-ing, however, it can not make good use of enough output information for systems. Ant system is a parallel-process and distributive-forward system with a relatively slow veloc-ity for providing the solution. Combining genetic and ant algorithms can increase the merits each other. Based on the idea above, the model and method from the combination of genetic and ant algorithms are proposed, and the convergence of the method based on the Markov theory is analysed. Moreover, the conclusion can be drawn that the solution sequence is monotonically decreasing and convergent. The experiment and analysis are carried out for the cases of TSP30 and CHN144 on an NP-hard problem. The results of simulation show that not only the mixed algorithm is a step-by-step convergent process, but also its velocity and effect of solving are quite satisfactory.

【基金】 国家自然科学基金(60174021,60374037);河南科技攻关项目(0124140141)资助~~
  • 【文献出处】 自动化学报 ,Acta Automatica Sinica , 编辑部邮箱 ,2004年04期
  • 【分类号】TP18
  • 【被引频次】138
  • 【下载频次】1284
节点文献中: 

本文链接的文献网络图示:

本文的引文网络