Improved Algorithm For Solving The Traveling Salesman Problem
WU Ming-zhu · Microcomputer Information · 2011
TSP is brought forward.Then three common algorithms of TSP is realized.The algorithms include greedy algorithm and backtracking method which are tradition algorithm and genetic algorithm which is modern optimization algorithm.An improved algorithm is proposed for the shortcomings of the three algorithms which is comprehensive use of greedy algorithm and genetic algorithm.The principles of Greedy selection guiding the genetic operation can greatly accelerate the search speed.The artificial experiment shows the algorithm is valid method for solving TSP.