A transformation technique for the clustered generalized traveling salesman problem with applications to logistics
Pouya Baniasadi, Mehdi Foumani, Kate Smith-Miles, Vladimir Ejov
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | ELSEVIER | Published : 2020
The clustered generalized traveling salesman problem (CGTSP) is an extension of the classical traveling salesman problem (TSP), where the set of nodes is divided into clusters of nodes, and the clusters are further divided into subclusters of nodes. The objective is to find the minimal route that visits exactly one node from each subcluster in such a way that all subclusters of each cluster are visited consecutively. Due to the additional flexibility of the CGTSP compared to the classical TSP, CGTSP can incorporate a wider range of complexities arising from some practical applications. However, the absence of a good solution method for CGTSP is currently a major impediment in the use of the ..View full abstract
Related Projects (1)
The authors are grateful to the referees for their assistance in improving the paper. The authors also acknowledge the support from Australian Research Council Center of Excellence for Mathematical and Statistical Frontiers (ACEMS).