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.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
