{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:13:35Z","timestamp":1726409615440},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319596495"},{"type":"electronic","value":"9783319596501"}],"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"},{"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-59650-1_13","type":"book-chapter","created":{"date-parts":[[2017,5,31]],"date-time":"2017-05-31T22:00:01Z","timestamp":1496268001000},"page":"149-160","source":"Crossref","is-referenced-by-count":11,"title":["A Hybrid Diploid Genetic Based Algorithm for Solving the Generalized Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Petrica","family":"Pop","sequence":"first","affiliation":[]},{"given":"Matei","family":"Oliviu","sequence":"additional","affiliation":[]},{"given":"Cosmin","family":"Sabo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,2]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-319-26626-8_9","volume-title":"Combinatorial Optimization and Applications","author":"B Bhattacharya","year":"2015","unstructured":"Bhattacharya, B., \u0106usti\u0107, A., Rafiey, A., Rafiey, A., Sokol, V.: Approximation algorithms for generalized MST and TSP in grid clusters. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, D.-Z. (eds.) COCOA 2015. LNCS, vol. 9486, pp. 110\u2013125. Springer, Cham (2015). doi: 10.1007\/978-3-319-26626-8_9"},{"issue":"2","key":"13_CR2","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0305-0548(75)90015-5","volume":"2","author":"JA Chisman","year":"1975","unstructured":"Chisman, J.A.: The clustered traveling salesman problem. Comput. Oper. Res. 2(2), 115\u2013119 (1975)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"13_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(02)00404-6","volume":"148","author":"C Feremans","year":"2003","unstructured":"Feremans, C., Labbe, M., Laporte, G.: Generalized network design problems. Eur. J. Oper. Res. 148(1), 1\u201313 (2003)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"13_CR4","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/net.3230260206","volume":"26","author":"M Fischetti","year":"1995","unstructured":"Fischetti, M., Salazar-Gonzales, J.J., Toth, P.: The symmetric generalized traveling salesman polytope. Networks 26(2), 113\u2013123 (1995)","journal-title":"Networks"},{"issue":"3","key":"13_CR5","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-Gonzales, 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."},{"key":"13_CR6","unstructured":"Goldberg, D.E., Smith, R.E.: Nonstationary function optimization using genetic algorithms with dominance and diploidy. In: Proceedings of the Second International Conference on Genetic Algorithms and their application, pp. 59\u201368 (1987)"},{"issue":"1","key":"13_CR7","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. Natural Comput. 9(1), 47\u201360 (2010)","journal-title":"Natural Comput."},{"issue":"3","key":"13_CR8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s12532-015-0080-8","volume":"7","author":"K Helsgaun","year":"2015","unstructured":"Helsgaun, K.: Solving the equality generalized traveling salesman problem using the LinKernighanHelsgaun Algorithm. Math. Prog. Comp. 7(3), 269\u2013287 (2015)","journal-title":"Math. Prog. Comp."},{"key":"13_CR9","unstructured":"Henry-Labordere, A.L.: The record balancing problem: a dynamic programming solution of a generalized travelling salesman problem. RIRO B-2, 43\u201349 (1969)"},{"issue":"2","key":"13_CR10","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."},{"key":"13_CR11","first-page":"61","volume":"21","author":"G Laporte","year":"1983","unstructured":"Laporte, G., Nobert, Y.: Generalized travelling salesman problem through n sets of nodes: an integer programming approach. Infor. 21, 61\u201375 (1983)","journal-title":"Infor."},{"issue":"12","key":"13_CR12","doi-asserted-by":"crossref","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 travelling salesman problem. J. Oper. Res. Soc. 47(12), 1461\u20131467 (1996)","journal-title":"J. Oper. Res. Soc."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Matei, O., Pop, P.C.: An efficient genetic algorithm for solving the generalized traveling salesman problem. In: Proceedings of 6th IEEE International Conference on Intelligent Computer Communication and Processing, pp. 87\u201392 (2010)","DOI":"10.1109\/ICCP.2010.5606458"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Mitchell, M.: An Introduction to Genetic Algorithms. MIT Press (1998)","DOI":"10.7551\/mitpress\/3927.001.0001"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/978-3-540-77566-9_48","volume-title":"SOFSEM 2008: Theory and Practice of Computer Science","author":"C-M Pintea","year":"2008","unstructured":"Pintea, C.-M., Chira, C., Dumitrescu, D., Pop, P.C.: A sensitive metaheuristic for solving a large optimization problem. In: Geffert, V., Karhum\u00e4ki, J., Bertoni, A., Preneel, B., N\u00e1vrat, P., Bielikov\u00e1, M. (eds.) SOFSEM 2008. LNCS, vol. 4910, pp. 551\u2013559. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-77566-9_48"},{"key":"13_CR16","unstructured":"Pintea, C.-M., Pop, P.C., Chira, C.: Reinforcing ant colony system for the generalized traveling salesman problem. In: Proceedings of BIC-TA 2006, pp. 245\u2013252 (2006)"},{"issue":"4","key":"13_CR17","first-page":"734","volume":"6","author":"C-M Pintea","year":"2011","unstructured":"Pintea, C.-M., Chira, C., Dumitrescu, D., Pop, P.C.: Sensitive ants in solving the generalized vehicle routing problem. Int. J. Comput. Commun. Control 6(4), 734\u2013741 (2011)","journal-title":"Int. J. Comput. Commun. Control"},{"key":"13_CR18","unstructured":"Pintea, C.-M., Pop, P.C., Chira, C.: The Generalized Traveling Salesman Problem solved with Ant Algorithms (2013). arXiv:1310.2350"},{"issue":"11","key":"13_CR19","doi-asserted-by":"crossref","first-page":"932","DOI":"10.3844\/ajassp.2007.932.937","volume":"4","author":"PC Pop","year":"2007","unstructured":"Pop, P.C.: New integer programming formulations of the generalized traveling salesman problem. Am. J. Appl. Sci. 4(11), 932\u2013937 (2007)","journal-title":"Am. J. Appl. Sci."},{"key":"13_CR20","doi-asserted-by":"crossref","DOI":"10.1515\/9783110267686","volume-title":"Generalized Network Design Problems, Modelling and Optimization","author":"PC Pop","year":"2012","unstructured":"Pop, P.C.: Generalized Network Design Problems, Modelling and Optimization. De Gruyter, Germany (2012)"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Pop, P.C., Iordache, S.: A hybrid heuristic approach for solving the generalized traveling saleasman problem. In: Proceedings of GECCO 2011, pp. 481\u2013488 (2011)","DOI":"10.1145\/2001576.2001643"},{"key":"13_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-642-16054-7_5","volume-title":"Hybrid Metaheuristics","author":"PC Pop","year":"2010","unstructured":"Pop, P.C., Matei, O., Sabo, C.: A new approach for solving the generalized traveling salesman problem. In: Blesa, M.J., Blum, C., Raidl, G., Roli, A., Sampels, M. (eds.) HM 2010. LNCS, vol. 6373, pp. 62\u201372. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-16054-7_5"},{"key":"13_CR23","first-page":"21","volume":"7","author":"M Reihaneh","year":"2012","unstructured":"Reihaneh, M., Karapetyan, D.: An efficient hybrid ant colony system for the generalized traveling salesman problem. Algorithmic Oper. Res. 7, 21\u201328 (2012)","journal-title":"Algorithmic Oper. Res."},{"issue":"3","key":"13_CR24","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."},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Reinelt, G.: TSPLIB - A traveling salesman problem library. ORSA J. Comput. 3, 376\u2013384 (1991). http:\/\/www.crpc.rice.edu\/softlib\/tsplib\/","DOI":"10.1287\/ijoc.3.4.376"},{"key":"13_CR26","doi-asserted-by":"crossref","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. Operations Research\/Computer Science Interfaces Series, vol. 37, pp. 165\u2013181. Springer, New York (2007)","DOI":"10.1007\/978-0-387-48793-9_11"},{"key":"13_CR27","unstructured":"Slavik, P.: On the approximation of the generalized traveling salesman problem. Working paper, University of Buffalo (1997)"},{"key":"13_CR28","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, 38\u201353 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"13_CR29","first-page":"97","volume":"7","author":"SS Srivastava","year":"1969","unstructured":"Srivastava, S.S., Kumar, S., Garg, R.C., Sen, P.: Generalized travelling salesman problem through n sets of nodes. CORS J. 7, 97\u2013101 (1969)","journal-title":"CORS J."},{"key":"13_CR30","doi-asserted-by":"crossref","unstructured":"Tasgetiren, M.F., Suganthan, P.N., Pan, Q.-K.: A discrete particle swarm optimization algorithm for the generalized traveling salesman problem. In Proceedings of GECCO, pp. 158\u2013167 (2007)","DOI":"10.1145\/1276958.1276980"}],"container-title":["Lecture Notes in Computer Science","Hybrid Artificial Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59650-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,9]],"date-time":"2020-10-09T00:24:18Z","timestamp":1602203058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59650-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319596495","9783319596501"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59650-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}