遗传算法求解TSP的研究

摘要

遗传算法通常被认为是自适应的随机搜索算法，与传统的优化方法（枚举，启发式等）相比较，以生物进化为原型，具有很好的收敛性。文章用遗传算法求解经典的旅行商问题，最后使用实验对算法进行了测试，能够在短时间内找到理想的解。%Genetic algorithm is usually considered a random search algorithm of adaptive. Compared to traditional optimization method (Mei Ju, heuristic), it is the prototype of biological evolution, and has very good convergence. This paper is for solving the classic traveling salesman problem based on genetic algorithm, and ifnally uses experiments carried out to test the algorithm, to ifnd the ideal solution in a short time.