求旅行商(TSP)问题的几种改进遗传算法的比较分析

Comparative Analysis of Several Improved Genetic Algorithm for Traveling Salesman Problem

随着现代科技的发展,待研究问题的规模与难度越来越大,单一的算法已经不能很好地解决问题。本文在阅读了大量关于混合遗传算法论文的基础上,总结了三种能够比较有效地求解旅行商(TSP)问题的改进型遗传算法,并阐述了它们的基本思想以及操作步骤。最后指出了它们的优缺点和今后的研究方向。

With the development of modern technology, the scale and difficulty of the problems are bigger and bigger, Single algorithm can not solve them well. Based on reading lots of paper of hybrid genetic algorithm, this paper summarizes three improved genetic algorithm for traveling salesman problem （TSP）, expounds their basic thoughts and processes. At last, the advantages and disadvantages of them and the research way for the future are pointed out.