{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:46:14Z","timestamp":1742921174340,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319534794"},{"type":"electronic","value":"9783319534800"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53480-0_14","type":"book-chapter","created":{"date-parts":[[2017,2,22]],"date-time":"2017-02-22T05:12:19Z","timestamp":1487740339000},"page":"135-143","source":"Crossref","is-referenced-by-count":1,"title":["Using Cluster Barycenters for the Generalized Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Mehdi","family":"El Krari","sequence":"first","affiliation":[]},{"given":"Bela\u00efd","family":"Ahiod","sequence":"additional","affiliation":[]},{"given":"Bouazza","family":"El Benani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,23]]},"reference":[{"issue":"5","key":"14_CR1","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/S0167-6377(03)00031-2","volume":"31","author":"D Ben-Arieh","year":"2003","unstructured":"Ben-Arieh, D., Gutin, G., Penn, M., Yeo, A., Zverovitch, A.: Transformations of generalized ATSP into ATSP. Oper. Res. Lett. 31(5), 357\u2013365 (2003)","journal-title":"Oper. Res. Lett."},{"issue":"11","key":"14_CR2","doi-asserted-by":"crossref","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.: A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem. Comput. Oper. Res. 37(11), 1844\u20131852 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"14_CR3","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.45.3.378","volume":"45","author":"M Fischetti","year":"1997","unstructured":"Fischetti, M., Salazar Gonzalez, J.J., Toth, P.: A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Oper. Res. 45(3), 378\u2013394 (1997)","journal-title":"Oper. Res."},{"issue":"3","key":"14_CR4","doi-asserted-by":"crossref","first-page":"766","DOI":"10.2514\/1.62126","volume":"37","author":"E Garone","year":"2014","unstructured":"Garone, E., Determe, J.F., Naldi, R.: Generalized traveling salesman problem for carrier-vehicle systems. J. Guidance Control Dyn. 37(3), 766\u2013774 (2014)","journal-title":"J. Guidance Control Dyn."},{"issue":"1","key":"14_CR5","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s11047-009-9111-6","volume":"9","author":"G Gutin","year":"2010","unstructured":"Gutin, G., Karapetyan, D.: A memetic algorithm for the generalized traveling salesman problem. Nat. Comput. 9(1), 47\u201360 (2010)","journal-title":"Nat. Comput."},{"key":"14_CR6","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/978-3-540-78987-1_19","volume-title":"Nature Inspired Cooperative Strategies for Optimization (NICSO 2007)","author":"G Gutin","year":"2008","unstructured":"Gutin, G., Karapetyan, D., Krasnogor, N.: 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), pp. 199\u2013210. Springer, Heidelberg (2008)"},{"key":"14_CR7","first-page":"43","volume":"B\u20132","author":"A Henry-Labordere","year":"1969","unstructured":"Henry-Labordere, A.: The record balancing problem: a dynamic programming solution of a generalized travelling salesman problem. RIRO B\u20132, 43\u201349 (1969)","journal-title":"RIRO"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-540-78604-7_4","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"B Hu","year":"2008","unstructured":"Hu, B., Raidl, G.R.: Effective neighborhood structures for the generalized traveling salesman problem. In: Hemert, J., Cotta, C. (eds.) EvoCOP 2008. LNCS, vol. 4972, pp. 36\u201347. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-78604-7_4"},{"issue":"2","key":"14_CR9","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/j.ejor.2012.01.011","volume":"219","author":"D Karapetyan","year":"2012","unstructured":"Karapetyan, D., Gutin, G.: Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem. Eur. J. Oper. Res. 219(2), 234\u2013251 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"14_CR10","first-page":"114","volume":"37","author":"G Laporte","year":"1999","unstructured":"Laporte, G., Semet, F.: Computational evaluation of a transformation procedure for the symmetric generalized traveling salesman problem. INFOR Inf. Syst. Oper. Res. 37(2), 114\u2013120 (1999)","journal-title":"INFOR Inf. Syst. Oper. Res."},{"key":"14_CR11","unstructured":"Noon, C.E.: The generalized traveling salesman problem. Ph.D. thesis, University of Michigan (1988)"},{"issue":"1","key":"14_CR12","first-page":"39","volume":"31","author":"CE Noon","year":"1993","unstructured":"Noon, C.E., Bean, J.C.: An efficient transformation of the generalized traveling salesman problem. INFOR Inf. Syst. Oper. Res. 31(1), 39\u201344 (1993)","journal-title":"INFOR Inf. Syst. Oper. Res."},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Pourhassan, M., Neumann, F.: On the impact of local search operators and variable neighbourhood search for the generalized travelling salesperson problem. In: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, pp. 465\u2013472. ACM (2015)","DOI":"10.1145\/2739480.2754656"},{"issue":"4","key":"14_CR14","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB\u2013a traveling salesman problem library. ORSA J. Comput. 3(4), 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"issue":"3","key":"14_CR15","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/S0377-2217(97)00142-2","volume":"108","author":"J Renaud","year":"1998","unstructured":"Renaud, J., Boctor, F.F.: An efficient composite heuristic for the symmetric generalized traveling salesman problem. Eur. J. Oper. Res. 108(3), 571\u2013584 (1998)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"14_CR16","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1287\/ijoc.8.2.134","volume":"8","author":"J Renaud","year":"1996","unstructured":"Renaud, J., Boctor, F.F., Laporte, G.: A fast composite heuristic for the symmetric traveling salesman problem. INFORMS J. Comput. 8(2), 134\u2013143 (1996)","journal-title":"INFORMS J. Comput."},{"issue":"5","key":"14_CR17","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.ipl.2007.03.010","volume":"103","author":"XH Shi","year":"2007","unstructured":"Shi, X.H., Liang, Y.C., Lee, H.P., Lu, C., Wang, Q.: Particle swarm optimization-based algorithms for tsp and generalized tsp. Inf. Process. Lett. 103(5), 169\u2013176 (2007)","journal-title":"Inf. Process. Lett."},{"key":"14_CR18","doi-asserted-by":"crossref","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.: The generalized traveling salesman problem: A new genetic algorithm approach. In: Baker, E.K., Joseph, A., Mehrotra, A., Trick, M.A. (eds.) Extending the Horizons: Advances In Computing, Optimization, and Decision Technologies, pp. 165\u2013181. Springer, New York (2007)"},{"issue":"1","key":"14_CR19","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.ejor.2004.09.057","volume":"174","author":"LV Snyder","year":"2006","unstructured":"Snyder, L.V., Daskin, M.S.: A random-key genetic algorithm for the generalized traveling salesman problem. Eur. J. Oper. Res. 174(1), 38\u201353 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"14_CR20","first-page":"97","volume":"7","author":"S Srivastava","year":"1969","unstructured":"Srivastava, S., Kumar, S., Garg, R., Sen, P.: Generalized travelling salesman problem through n sets of nodes. CORS J. 7, 97\u2013101 (1969)","journal-title":"CORS J."}],"container-title":["Advances in Intelligent Systems and Computing","Intelligent Systems Design and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53480-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T07:06:51Z","timestamp":1498374411000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53480-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319534794","9783319534800"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53480-0_14","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2017]]}}}