Abstract
Based on GaoTao Algorithm (GT), Which is a typical Evolutionary Algorithm for traveling salesman problem (TSP). We first designed mapping and optimal operators, and proposed some control strategies. Then an improved GuoTao algorithm (IGT) for TSP was proposed. This algorithm was tested on some standard test instances, The results show that the algorithm presented in this paper is more efficient and more effective than existing algorithms for TSP, and it can be easily and directly generalized to solve other NP-hard combinatorial optimization problems.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
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
