遗传算法求解TSP问题的MATLAB实现

Realization of MATLAB on resolving the traveling salesman problem by virtue of genetic algorithms

以遗传算法求解旅行商问题(TSP)为例,提出一种改进的交叉和变异算子,深入讨论了各个遗传算子的程序实现,并给出其算子的MATLAB程序编码,最后用5个城市的非对称TSP进行仿真分析.结果表明,改进的算法比传统算法收敛速度更快,适应值更优,说明改进算法是有效的,证实TSP问题是遗传算法得以成功应用的典型例子.

This paper has resolved the traveling salesman problem（TSP） by virtue of genetic algorithms（GA）,all improved GA is suggested which gives the MATLAB program its crossover operator and mutation operator.It also solved the question of many GAs on searching TSP problem and gives the relative codes in MATLAB 6.5.Finally,numerical simulations of non-symmetric five-city TSP establish the efficiency of the procedure in this paper.Test shows that the improved GA has better performance than the traditional GA on the convergence speed and the fitness value.The improved GA obtains a better result.TSP problem is a typical problem to which Genetic Algorithm can be successfully used.