Abstract
The Generalized Traveling Salesman Problem (GTSP) looks for an optimal cycle in a clustered graph, such that every cluster is visited exactly once. In this paper, we describe a novel Hybrid Genetic Algorithm (HGA) for solving the GTSP. At the core of the proposed HGA, there is a Chromosome Optimization algoRithm (COR) that is based on Dijkstra’s Shortest Path Algorithm (DSPA) and a Traveling Salesman Problem Solver (TSPS). We tested our algorithm on a set of well known instances from the literature and the preliminary computational experiments show promising results. We believe that our HGA can be used as a basis for future developments.
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.
