计算机与现代化 ›› 2009, Vol. 1 ›› Issue (7): 12-16,2.doi: 10.3969/j.issn.1006-2475.2009.07.004

• 人工智能 • 上一篇    下一篇

用遗传算法求解TSP问题

王 辉   

  1. 荆州职业技术学院信息技术系, 湖北 荆州 434100
  • 收稿日期:2008-07-24 修回日期:1900-01-01 出版日期:2009-07-10 发布日期:2009-07-10

Solving Traveling Salesman Problem by Genetic Algorithm

WANG Hui   

  1. Department of Information Technology, Jingzhou Institute of Technology Jingzhou, 434100, China
  • Received:2008-07-24 Revised:1900-01-01 Online:2009-07-10 Published:2009-07-10

摘要: 介绍TSP 问题和遗传算法的基本原理。针对解决TSP 问题,阐述遗传算法在编码表示和遗传操作算子等方面的应用情况,以及该算法在实现过程中的一些处理方法,最后给出该算法的运行结果和总结。

关键词: TSP, 遗传算法, 编码, 遗传操作, 组合优化

Abstract: This paper introduces TSP problem and fundamental principle for genetic algorithm. Aiming at solving TSP problem,the paper expounds the utilization of genetic algorithm in code element and genetic arithmetic operators, and some processing method in the producing of the arithmetic. Finally, the paper provides experimental results and summary.

Key words: TSP, genetic algorithm, coding, genetic operation, assemble optimization

中图分类号: