Abstract
The traveling salesman problem (TSP) has been an important problem in the field of distribution and logistics and it is clearlyNP-hard combinatorial optimization problem and difficult to solve. This paper gives a review of achievements of different types of Algorithms for the traveling sales man problem and outlines these advantages and limitation for these algorithms, including dynamic program, brand and bound, genetic algorithm and estimation of distribution algorithms. In addition, some of the most powerful efficiency enhancement techniques applied to TSP is discussed and quite a few common conditions of different methods for TSP are summarized. Finally, some future research direction and content are proposed.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
