期刊文献+

蚁群和遗传混合算法求解旅行商问题 被引量:1

Hybrid Algorithm of Generation and Ant Colony on Traveling Salesman Problem
下载PDF
导出
摘要 旅行商是应用广泛的优化组合问题,采用蚁群和遗传混合算法解决旅行商问题,利用遗传算法的交叉、变异机制解决蚁群算法易出现局部最优解的问题,将混合算法在VBA环境调试运行。混合算法与蚁群算法、遗传算法仿真数据比较,混合算法具有较好改进效果。 Traveling salesman is a widely used optimized combined question. The ant colony and geneic hybrid algorithm is adopted to solve the traveling salesman problem. The problem that ant colony algorithm is prone to local optima is solved by using crossover and mutation mechanism of genetic algorithm.The hybrid algorithm is debugged in VBA.Finally, the hybrid algorithm is proved to be better than ant colony algorithm and geneic algorithm by comparing running data.
作者 金晓龙
出处 《电脑开发与应用》 2014年第8期44-46,共3页 Computer Development & Applications
关键词 旅行商 蚁群算法 遗传算法 VBA traveling salesman ant colony algorithm geneic algorithm VBA
  • 相关文献

参考文献4

二级参考文献37

  • 1M. Dorigo and T. Stitzle, Ant Colony Optimization[M]. MA: MIT Press, 2004.
  • 2Dorigo, M. , Gambardella, L. M. : Ant Colony System.. A Cooperative Learning Approach to the Traveling Salesman Problem[J]. IEEE Trans on Evolutionary Computation, 1997,1 (1):53-66.
  • 3M. Dorigo and L. M. Gambardella. Ant colonies for the traveling salesman problem[J]. IEEE Trans. Syst. , Man, Cybern. -Part B,2002,26(1) :29-41 .
  • 4Luea M. Gambardella and M. Dorigo. Ant-Q: A Reinforcement Learning approach to the traveling salesman problem [J].Proceedings of ML-95, Twelfth Intern. Conf. on Machine Learning, Morgan Kaufmann, 1995: 252-260.
  • 5T. Stitzle and H. Hoos. MAX-MIN ant system and local search for the traveling salesman problem[M], in IEEE int'l conf. on Evolutionary. Computation. Indianapolis: IEEE Press,1997:309 -314.
  • 6Z. Michalewicz. Genetic algorithms + Data Structure = Evolution Programs[M]. Springer-Verlag, 1996.
  • 7M. Dorigo and C. Blum. Ant colony Optimization theory: A survey [J]. in Theoretical Computer Science. 2005,344: 243 - 278.
  • 8M. Dorigo and G. Di Caro, C. Ant Colony Optimization: A New Meta- Heuristic[M]. IEEE Trans. Evol. Comput, 1999 : 1470- 1477 .
  • 9Jun OuYang,Gui-Rong. A Multi-Group Ant Colony System Algorithm For TSP[M]. Proceedings of the Third International Conference on Maehine Learning and Cyberncdes, Shanghai, 2004:26 -29.
  • 10M. R. Garey, R. L. Graham, and D. S. Johnson. Some NP- complete geometric problems[M]. in Proc. 8th Annu. ACM Symp. Theory of Computing, 1976 : 10- 22.

共引文献37

同被引文献7

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部