In this paper, we are addressing the generalized traveling salesman problem, denoted by GTSP, which is a variant of the classical traveling salesman problem (TSP). The GTSP is characterized by the fact that the vertices of the graph are partitioned into a given number of clusters and we are looking for the minimum cost tour that visits exactly one vertex from each cluster. The goal of this paper is to present a novel method for solving the GTSP, namely a hybrid diploid genetic based algorithm. The preliminary computational results on an often set of benchmark instances show that our proposed approach provides competitive solutions compared to the existing state-of-the-arts methods for solving the GTSP.
展开▼
