Realization of MATLAB on resolving the traveling salesman problem by virtue of genetic algorithms
Wen Qing-fang · Journal of Shaoguan University · 2007
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.