{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T14:02:40Z","timestamp":1777903360422,"version":"3.51.4"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,11,15]],"date-time":"2019-11-15T00:00:00Z","timestamp":1573776000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,15]],"date-time":"2019-11-15T00:00:00Z","timestamp":1573776000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s12351-019-00533-w","type":"journal-article","created":{"date-parts":[[2019,11,15]],"date-time":"2019-11-15T01:02:32Z","timestamp":1573779752000},"page":"2543-2591","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A pre-processing reduction method for the generalized travelling salesman problem"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7936-9430","authenticated-orcid":false,"given":"Mehdi","family":"El Krari","sequence":"first","affiliation":[]},{"given":"Bela\u00efd","family":"Ahiod","sequence":"additional","affiliation":[]},{"given":"Youssef Bouazza","family":"El Benani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,15]]},"reference":[{"key":"533_CR1","unstructured":"Bontoux B (2008) Techniques hybrides de recherche exacte et approche: application des probl\u00e8mes de transport. Ph.D. thesis, University of Avignon and the Vaucluse"},{"issue":"11","key":"533_CR2","doi-asserted-by":"publisher","first-page":"1844","DOI":"10.1016\/j.cor.2009.05.004","volume":"37","author":"B Bontoux","year":"2010","unstructured":"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\u20131852","journal-title":"Comput Oper Res"},{"issue":"1\u20134","key":"533_CR3","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0020-0255(96)00084-9","volume":"102","author":"V Dimitrijevi\u0107","year":"1997","unstructured":"Dimitrijevi\u0107 V, \u0160ari\u0107 Z (1997) An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs. Inf Sci 102(1\u20134):105\u2013110","journal-title":"Inf Sci"},{"issue":"4","key":"533_CR4","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1023\/A:1009881326671","volume":"4","author":"Moshe Dror","year":"2000","unstructured":"Dror Moshe, Haouari Mohamed (2000) Generalized steiner problems and other variants. J Comb Optim 4(4):415\u2013436","journal-title":"J Comb Optim"},{"key":"533_CR5","doi-asserted-by":"publisher","unstructured":"El Krari M, Ahiod B, El Benani B (2017) Using cluster barycenters for the generalized traveling salesman problem. Springer, Cham, pp 135\u2013143, ISBN 978-3-319-53480-0. https:\/\/doi.org\/10.1007\/978-3-319-53480-0_14","DOI":"10.1007\/978-3-319-53480-0_14"},{"issue":"3","key":"533_CR6","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/opre.45.3.378","volume":"45","author":"M Fischetti","year":"1997","unstructured":"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\u2013394","journal-title":"Oper Res"},{"key":"533_CR7","first-page":"1","volume":"9","author":"IK Fodor","year":"2002","unstructured":"Fodor IK (2002) A survey of dimension reduction techniques. Cent Appl Sci Comput Lawrence Livermore Natl Lab 9:1\u201318","journal-title":"Cent Appl Sci Comput Lawrence Livermore Natl Lab"},{"key":"533_CR9","unstructured":"Gutin G, Karapetyan D (2008) Generalized traveling salesman problem reduction algorithms. arXiv preprint arXiv:0804.0735"},{"issue":"1","key":"533_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s11047-009-9111-6","volume":"9","author":"G Gutin","year":"2010","unstructured":"Gutin G, Karapetyan D (2010) A memetic algorithm for the generalized traveling salesman problem. Nat Comput 9(1):47\u201360","journal-title":"Nat Comput"},{"key":"533_CR11","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-78987-1_19","volume-title":"Nature inspired cooperative strategies for optimization (NICSO 2007), Studies in Computational Intelligence","author":"G Gutin","year":"2008","unstructured":"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\u2013210"},{"issue":"3","key":"533_CR12","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s12532-015-0080-8","volume":"7","author":"K Helsgaun","year":"2015","unstructured":"Helsgaun K (2015) Solving the equality generalized traveling salesman problem using the Lin\u2013Kernighan\u2013Helsgaun Algorithm. Math Program Comput 7(3):269\u2013287","journal-title":"Math Program Comput"},{"key":"533_CR13","first-page":"43","volume":"B\u20132","author":"AL Henry-Labordere","year":"1969","unstructured":"Henry-Labordere AL (1969) The record balancing problem: a dynamic programming solution of a generalized travelling salesman problem. RIRO B\u20132:43\u201349","journal-title":"RIRO"},{"key":"533_CR14","doi-asserted-by":"crossref","unstructured":"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\u201347","DOI":"10.1007\/978-3-540-78604-7_4"},{"issue":"2","key":"533_CR15","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.ejor.2012.01.011","volume":"219","author":"D Karapetyan","year":"2012","unstructured":"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\u2013251","journal-title":"Eur J Oper Res"},{"issue":"1","key":"533_CR16","first-page":"61","volume":"21","author":"G Laporte","year":"1983","unstructured":"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\u201375","journal-title":"INFOR Inf Syst Oper Res"},{"issue":"2","key":"533_CR17","first-page":"114","volume":"37","author":"G Laporte","year":"1999","unstructured":"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\u2013120","journal-title":"INFOR Inf Syst Oper Res"},{"issue":"2","key":"533_CR18","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0166-218X(87)90020-5","volume":"18","author":"G Laporte","year":"1987","unstructured":"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\u2013197","journal-title":"Discrete Appl Math"},{"issue":"12","key":"533_CR19","doi-asserted-by":"publisher","first-page":"1461","DOI":"10.1057\/jors.1996.190","volume":"47","author":"G Laporte","year":"1996","unstructured":"Laporte G, Asef-Vaziri A, Sriskandarajah C (1996) Some applications of the generalized travelling salesman problem. J Oper Res Soc 47(12):1461\u20131467","journal-title":"J Oper Res Soc"},{"issue":"1\u20132","key":"533_CR20","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0020-0255(93)90133-7","volume":"74","author":"Y-N Lien","year":"1993","unstructured":"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\u20132):177\u2013189","journal-title":"Inf Sci"},{"issue":"12","key":"533_CR21","doi-asserted-by":"publisher","first-page":"3218","DOI":"10.1016\/j.cor.2012.10.001","volume":"40","author":"M Mestria","year":"2013","unstructured":"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\u20133229","journal-title":"Comput Oper Res"},{"issue":"1","key":"533_CR22","first-page":"39","volume":"31","author":"CE Noon","year":"1993","unstructured":"Noon CE, Bean JC (1993) An efficient transformation of the generalized traveling salesman problem. INFOR Inf Syst Oper Res 31(1):39\u201344","journal-title":"INFOR Inf Syst Oper Res"},{"key":"533_CR23","unstructured":"Noon CE (1988) The generalized traveling salesman problem. PhD thesis, University of Michigan"},{"issue":"4","key":"533_CR8","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt G (1991) TSPLIB\u2014A traveling salesman problem library. INFORMS J Comput 3(4):376\u2013384. https:\/\/doi.org\/10.1287\/ijoc.3.4.376","journal-title":"INFORMS J Comput"},{"issue":"3","key":"533_CR24","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1016\/S0377-2217(97)00142-2","volume":"108","author":"J Renaud","year":"1998","unstructured":"Renaud J, Boctor FF (1998) An efficient composite heuristic for the symmetric generalized traveling salesman problem. Eur J Oper Res 108(3):571\u2013584","journal-title":"Eur J Oper Res"},{"key":"533_CR25","volume-title":"Mathematical model of scheduling clients through welfare angencies: II","author":"JP Saksena","year":"1967","unstructured":"Saksena JP (1967) Mathematical model of scheduling clients through welfare angencies: II. Department of Electrical Engineering and Medicine, University of Southern California, Los Angeles"},{"issue":"5","key":"533_CR26","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.ipl.2007.03.010","volume":"103","author":"XH Shi","year":"2007","unstructured":"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\u2013176","journal-title":"Inf Process Lett"},{"key":"533_CR27","series-title":"Springer","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-0-387-48793-9_11","volume-title":"Extending the horizons: advances in computing, optimization, and decision technologies","author":"J Silberholz","year":"2007","unstructured":"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\u2013181"},{"key":"533_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2017.05.010","volume":"87","author":"SL Smith","year":"2017","unstructured":"Smith SL, Imeson F (2017) GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem. Comput Oper Res 87:1\u201319","journal-title":"Comput Oper Res"},{"issue":"1","key":"533_CR29","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.ejor.2004.09.057","volume":"174","author":"LV Snyder","year":"2006","unstructured":"Snyder LV, Daskin MS (2006) A random-key genetic algorithm for the generalized traveling salesman problem. Eur J Oper Res 174(1):38\u201353","journal-title":"Eur J Oper Res"},{"key":"533_CR30","first-page":"97","volume":"7","author":"SS Srivastava","year":"1969","unstructured":"Srivastava SS, Kumar S, Garg RC, Sen P (1969) Generalized travelling salesman problem through n sets of nodes. CORS J 7:97\u2013101","journal-title":"CORS J"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-019-00533-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-019-00533-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-019-00533-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,22]],"date-time":"2021-10-22T18:26:44Z","timestamp":1634927204000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-019-00533-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,15]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["533"],"URL":"https:\/\/doi.org\/10.1007\/s12351-019-00533-w","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,15]]},"assertion":[{"value":"27 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 September 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}