Abstract
The traveling salesman problem concerns the best way to visit a set of customers located in some metric space and to minimize the length of the tour over all customer subsets. The problem is a typical NP-hard combinatorial optimization problem, which is of major importance in real world applications. An effective hybrid genetic algorithm-ECOGA is proposed for the problem in this paper, which combines 2-exchange crossover heuristic operator and improved 2OPT of neighbor search algorithm absorbing K-Nearest Neighbor. What’s more, the rule of 5 is applied to the proposed algorithm to guide the search direction. On a set of standard test problems with symmetric distances, the proposed ECOGA found the solutions that were optimal in every case and some of them are superior to the optimality found in TSPLIB. The ECOGA is completive with other genetic algorithm published to date in both solution quality and computation time.
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.
