论文部分内容阅读
旅行商问题作为一种最基本的路线问题,对其解决的计算方法研究一直是人们喜闻乐道的内容,也是解决最佳推销路线选择的主要方法。传统的遗传算法中利用自然编码遗产算法对全体旅行商问题进行计算和处理,具有过于复杂和局部高效化的问题。因此,在解决旅行商务问题的算法研究中仍然需要进一步对遗传算法进行完善。本文中从改良遗传算法入手,深入的分析解决旅行商问题的合理性和高效性。
As one of the most basic route problems, the traveling salesman problem has always been a favorite of people and the solution to the best marketing choice. The traditional genetic algorithm using natural coding heritage algorithm to calculate and deal with all the traveling salesman problems, with the problem of too complicated and locally efficient. Therefore, it is still necessary to further improve the genetic algorithm in the study of algorithms for solving travel business problems. In this paper, starting from the improved genetic algorithm, in-depth analysis and solve the problem of traveling salesman rationality and high efficiency.