The generalized travelling salesman problem (GTSP) is a variant of the well-known travelling salesman problem. The cities are in this case spread into clusters and only one city from each one must be visited to make a cyclic tour with a minimal cost. Following this assumption, an instance can be subject to dimensionality reduction since removing some cities from each cluster will keep feasible solutions and then will preserve feasibility of the instance. Therefore, we propose a new preprocessing technique which consists of selecting from each cluster the nearest nodes to other clusters and removing the nodes that had never been selected in order to reduce the search space size. The suggested approach is tested on a large set of symmetric instances of different sizes picked from the different benchmarks. The reduction is performed in a negligible runtime, while the reduction rate is up to 98%, which is very competitive compared to the only reduction method for the GTSP we are aware of. State-of-the-art solvers for the GTSP were applied to the reduced instances to evaluate their performances. We show that the reduced instances help these solvers to obtain good solutions in a shorter time but do not guarantee to get the optimal ones, while they provide better solutions in a fixed time budget environment.
This is a preview of subscription content, access via your institution.
Buy single article
Instant access to the full article PDF.
Tax calculation will be finalised during checkout.
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
Tax calculation will be finalised during checkout.
Bontoux B (2008) Techniques hybrides de recherche exacte et approche: application des problèmes de transport. Ph.D. thesis, University of Avignon and the Vaucluse
Bontoux B, Artigues C, Feillet D (2010) A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem. Comput Oper Res 37(11):1844–1852
Dimitrijević V, Šarić Z (1997) An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs. Inf Sci 102(1–4):105–110
Dror Moshe, Haouari Mohamed (2000) Generalized steiner problems and other variants. J Comb Optim 4(4):415–436
El Krari M, Ahiod B, El Benani B (2017) Using cluster barycenters for the generalized traveling salesman problem. Springer, Cham, pp 135–143, ISBN 978-3-319-53480-0. https://doi.org/10.1007/978-3-319-53480-0_14
Fischetti M, Salazar Gonzalez JJ, Toth P (1997) A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Oper Res 45(3):378–394
Fodor IK (2002) A survey of dimension reduction techniques. Cent Appl Sci Comput Lawrence Livermore Natl Lab 9:1–18
Gutin G, Karapetyan D (2008) Generalized traveling salesman problem reduction algorithms. arXiv preprint arXiv:0804.0735
Gutin G, Karapetyan D (2010) A memetic algorithm for the generalized traveling salesman problem. Nat Comput 9(1):47–60
Gutin G, Karapetyan D, Krasnogor N (2008) Memetic algorithm for the generalized asymmetric traveling salesman problem. In: Krasnogor N, Nicosia G, Pavone M, Pelta D (eds) Nature inspired cooperative strategies for optimization (NICSO 2007), Studies in Computational Intelligence, vol 129. Springer, Berlin, Heidelberg, pp 199–210
Helsgaun K (2015) Solving the equality generalized traveling salesman problem using the Lin–Kernighan–Helsgaun Algorithm. Math Program Comput 7(3):269–287
Henry-Labordere AL (1969) The record balancing problem: a dynamic programming solution of a generalized travelling salesman problem. RIRO B–2:43–49
Hu B, Raidl GR (2008) Effective neighborhood structures for the generalized traveling salesman problem. In: van Hemert J, Cotta C (eds) Evolutionary computation in combinatorial optimization. EvoCOP 2008. Lecture Notes in Computer Science, vol 4972. Springer, Berlin, Heidelberg, pp 36–47
Karapetyan D, Gutin G (2012) Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem. Eur J Oper Res 219(2):234–251
Laporte G, Nobert Y (1983) Generalized travelling salesman problem through n sets of nodes: an integer programming approach. INFOR Inf Syst Oper Res 21(1):61–75
Laporte G, Semet F (1999) Computational evaluation of a transformation procedure for the symmetric generalized traveling salesman problem. INFOR Inf Syst Oper Res 37(2):114–120
Laporte G, Mercure H, Nobert Y (1987) Generalized travelling salesman problem through n sets of nodes: the asymmetrical case. Discrete Appl Math 18(2):185–197
Laporte G, Asef-Vaziri A, Sriskandarajah C (1996) Some applications of the generalized travelling salesman problem. J Oper Res Soc 47(12):1461–1467
Lien Y-N, Ma E, Wah BW-S (1993) Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem. Inf Sci 74(1–2):177–189
Mestria M, Ochi LS, de Lima Martins S (2013) Grasp with path relinking for the symmetric euclidean clustered traveling salesman problem. Comput Oper Res 40(12):3218–3229
Noon CE, Bean JC (1993) An efficient transformation of the generalized traveling salesman problem. INFOR Inf Syst Oper Res 31(1):39–44
Noon CE (1988) The generalized traveling salesman problem. PhD thesis, University of Michigan
Reinelt G (1991) TSPLIB—A traveling salesman problem library. INFORMS J Comput 3(4):376–384. https://doi.org/10.1287/ijoc.3.4.376
Renaud J, Boctor FF (1998) An efficient composite heuristic for the symmetric generalized traveling salesman problem. Eur J Oper Res 108(3):571–584
Saksena JP (1967) Mathematical model of scheduling clients through welfare angencies: II. Department of Electrical Engineering and Medicine, University of Southern California, Los Angeles
Shi XH, Liang YC, Lee HP, Lu C, Wang QX (2007) Particle swarm optimization-based algorithms for TSP and generalized TSP. Inf Process Lett 103(5):169–176
Silberholz J, Golden B (2007) The generalized traveling salesman problem: a new genetic algorithm approach. In: Baker EK, Joseph A, Mehrotra A, Trick MA (eds) Extending the horizons: advances in computing, optimization, and decision technologies, Operations research/computer science interfaces series, vol 37. Springer. Boston, MA, pp 165–181
Smith SL, Imeson F (2017) GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem. Comput Oper Res 87:1–19
Snyder LV, Daskin MS (2006) A random-key genetic algorithm for the generalized traveling salesman problem. Eur J Oper Res 174(1):38–53
Srivastava SS, Kumar S, Garg RC, Sen P (1969) Generalized travelling salesman problem through n sets of nodes. CORS J 7:97–101
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
About this article
Cite this article
El Krari, M., Ahiod, B. & El Benani, Y.B. A pre-processing reduction method for the generalized travelling salesman problem. Oper Res Int J (2019). https://doi.org/10.1007/s12351-019-00533-w
- Generalized travelling salesman problem
- Dimensionality reduction
- Combinatorial optimization
- Nearest nodes