Resumen de An Effective Hybrid Genetic Algorithm for Solving the Generalized Traveling Salesman Problem

Ovidiu Cosma, Petrică Pop, Laura Cosma

• 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.