A Genetic Algorithm for Solving Travelling Salesman Problem
A Genetic Algorithm for Solving Travelling Salesman Problem
复制标题
DOI：
10.14569/ijacsa.2011.020104
复制
发表时间：
2011
影响因子：
0.9
通讯作者：
A. Philip;Akinwale Adio Taofiki;O. Kehinde
中科院分区：
文献类型：
--
作者：
A. Philip;Akinwale Adio Taofiki;O. Kehinde
本文提出了一种求解旅行商问题的遗传算法。遗传算法是一种很好的局部搜索算法，通过产生一个预定数量的随机图尔斯，然后改善人口，直到满足停止条件，最好的染色体，这是一个旅游作为解决方案返回。对算法参数（群体、突变率和切割长度）进行了分析，以了解如何针对各种问题实例调整算法。
In this paper we present a Genetic Algorithm for solving the Travelling Salesman problem (TSP). Genetic Algorithm which is a very good local search algorithm is employed to solve the TSP by generating a preset number of random tours and then improving the population until a stop condition is satisfied and the best chromosome which is a tour is returned as the solution. Analysis of the algorithmic parameters (Population, Mutation Rate and Cut Length) was done so as to know how to tune the algorithm for various problem instances.