Abstract

We investigate a mechanism of combining Genetic Algorithms (GA) and the Variable Neighborhood Search (VNS) for solving Traveling Salesman Problem (TSP). This combination aims to take advantage of GA's strength in exploring solution space and VNS's powerful exploitation in that space. In order to improve the solution quality, we propose a VNS with four neighborhood structures. We experimented on TSP instances from TSP-Lib and compared the results of the proposed algorithm with a hybrid Genetic Algorithm and Variable Neighborhood Search. Experimental results show that the proposed algorithm is better than once in terms of both the solution quality and running times in majority of data instances.

Full Text
Paper version not known

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

Disclaimer: 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.