{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T15:22:03Z","timestamp":1726759323778},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642160530"},{"type":"electronic","value":"9783642160547"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16054-7_5","type":"book-chapter","created":{"date-parts":[[2010,9,30]],"date-time":"2010-09-30T22:07:50Z","timestamp":1285884470000},"page":"62-72","source":"Crossref","is-referenced-by-count":13,"title":["A New Approach for Solving the Generalized Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"P. C.","family":"Pop","sequence":"first","affiliation":[]},{"given":"O.","family":"Matei","sequence":"additional","affiliation":[]},{"given":"C.","family":"Sabo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"B\u00e4ck, T., Hoffmeister, F., Schwefel, H.: A survey of evolution strategies. In: Proc. of the 4th International Conference on Genetic Algorithms, San Diego, CA (July 1991)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Bontoux, B., Artigues, C., Feillet, D.: A Memetic Algorithm with a Large Neighborhood Crossover Operator for the Generalized Traveling Salesman Problem. Computers & Operations Research (2009) (in press)","DOI":"10.1016\/j.cor.2009.05.004"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1002\/net.3230260206","volume":"26","author":"M. Fischetti","year":"1995","unstructured":"Fischetti, M., Salazar, J.J., Toth, P.: The symmetric generalized traveling salesman polytope. Networks\u00a026, 113\u2013123 (1995)","journal-title":"Networks"},{"key":"5_CR4","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, J.J., Toth, P.: A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Operations Research\u00a045, 378\u2013394 (1997)","journal-title":"Operations Research"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s11047-009-9111-6","volume":"9","author":"G. Gutin","year":"2009","unstructured":"Gutin, G., Karapetyan, D.: A memetic algorithm for the generalized traveling salesman problem. Natural Computing\u00a09, 47\u201360 (2009)","journal-title":"Natural Computing"},{"key":"5_CR6","unstructured":"Henry-Labordere: The record balancing problem: A dynamic programming solution of a generalized traveling salesman problem. RAIRO Operations Research B2, 43-49 (1969)"},{"key":"5_CR7","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.: Effective neighborhood structures for the generalized traveling salesman problem. In: van Hemert, J., Cotta, C. (eds.) EvoCOP 2008. LNCS, vol.\u00a04972, pp. 36\u201347. Springer, Heidelberg (2008)"},{"key":"5_CR8","first-page":"61","volume":"21","author":"G. Laporte","year":"1983","unstructured":"Laporte, G., Nobert, Y.: Generalized Traveling Salesman through n sets of nodes: an integer programming approach. INFOR\u00a021, 61\u201375 (1983)","journal-title":"INFOR"},{"key":"5_CR9","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.: Some applications of the generalized traveling salesman problem. Journal of Operational Research Society\u00a047, 1461\u20131467 (1996)","journal-title":"Journal of Operational Research Society"},{"key":"5_CR10","unstructured":"Matei, O.: Evolutionary Computation: Principles and Practices, Risoprint (2008)"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1287\/opre.39.4.623","volume":"39","author":"C.E. Noon","year":"1991","unstructured":"Noon, C.E., Bean, J.C.: A Lagrangian based approach for the asymmetric generalized traveling salesman problem. Operations Research\u00a039, 623\u2013632 (1991)","journal-title":"Operations Research"},{"key":"5_CR12","unstructured":"Pintea, C., Pop, P.C., Chira, C.: Reinforcing Ant Colony System for the Generalized Traveling Salesman Problem. In: Proc. of International Conference Bio-Inspired Computing-Theory and Applications (BIC-TA), Wuhan, China. Evolutionary Computing Section, pp. 245\u2013252 (2006)"},{"key":"5_CR13","volume-title":"The generalized minimum spanning tree problem","author":"P.C. Pop","year":"2002","unstructured":"Pop, P.C.: The generalized minimum spanning tree problem. Twente University Press, The Netherlands (2002)"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1016\/j.ejor.2004.07.058","volume":"170","author":"P.C. Pop","year":"2006","unstructured":"Pop, P.C., Kern, W., Still, G.J.: A new relaxation method for the generalized minimum spanning tree problem. European Journal of Operational Research\u00a0170, 900\u2013908 (2006)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"5_CR15","first-page":"104","volume":"25","author":"P.C. Pop","year":"2009","unstructured":"Pop, P.C.: A survey of different integer programming formulations of the generalized minimum spanning tree problem. Carpathian J. of Math.\u00a025(1), 104\u2013118 (2009)","journal-title":"Carpathian J. of Math."},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-642-13803-4_15","volume-title":"Hybrid Artificial Intelligence Systems","author":"P.C. Pop","year":"2010","unstructured":"Pop, P.C., Matei, O., Pop Sitar, C., Chira, C.: A Genetic Algorithm for Solving the Generalized Vehicle Routing Problem. In: Corchado, E., Gra\u00f1a Romay, M., Manhaes Savio, A. (eds.) HAIS 2010, Part II. LNCS, vol.\u00a06077, pp. 119\u2013126. Springer, Heidelberg (2010)"},{"issue":"3","key":"5_CR17","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, F.F.: An efficient composite heuristic for the Symmetric Generalized Traveling Salesman Problem. European Journal of Operational Research\u00a0108(3), 571\u2013584 (1998)","journal-title":"European Journal of Operational Research"},{"key":"5_CR18","first-page":"185","volume":"8","author":"J.P. Saskena","year":"1970","unstructured":"Saskena, J.P.: Mathematical model of scheduling clients through welfare agencies. Journal of the Canadian Operational Research Society\u00a08, 185\u2013200 (1970)","journal-title":"Journal of the Canadian Operational Research Society"},{"key":"5_CR19","unstructured":"Schwefel, H.P.: Collective phenomena in evolutionary systems. In: Proc. of 31st Annual Meetting of the International Society for General System Research, pp. 1025\u20131033 (1987)"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.ejor.2004.09.057","volume":"174","author":"L.V. Snyder","year":"2006","unstructured":"Snyder, L.V., Daskin, M.S.: A random-key genetic algorithm for the generalized traveling salesman problem. European Journal of Operations Research\u00a0174, 38\u201353 (2006)","journal-title":"European Journal of Operations Research"},{"key":"5_CR21","first-page":"97","volume":"7","author":"S.S. Srivastava","year":"1969","unstructured":"Srivastava, S.S., Kumar, S., Garg, R.C., Sen, P.: Generalized traveling salesman problem through n sets of nodes. CORS Journal\u00a07, 97\u2013101 (1969)","journal-title":"CORS Journal"},{"issue":"11","key":"5_CR22","doi-asserted-by":"publisher","first-page":"1417","DOI":"10.1016\/j.pnsc.2008.03.028","volume":"18","author":"J. Yanga","year":"2008","unstructured":"Yanga, J., Shi, X., Marchese, M., Liang, Y.: An ant colony optimization method for generalized TSP problem. Progress in Natural Science\u00a018(11), 1417\u20131422 (2008)","journal-title":"Progress in Natural Science"},{"key":"5_CR23","unstructured":"http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/ TSPLIB95\/vrp\/"},{"key":"5_CR24","unstructured":"http:\/\/verify.stanford.edu\/uli\/java_cpp.html"}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16054-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T01:00:43Z","timestamp":1559696443000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16054-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642160530","9783642160547"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16054-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}