{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T19:15:25Z","timestamp":1761765325478},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540283201"},{"type":"electronic","value":"9783540318637"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11539902_16","type":"book-chapter","created":{"date-parts":[[2010,7,20]],"date-time":"2010-07-20T21:50:31Z","timestamp":1279662631000},"page":"137-140","source":"Crossref","is-referenced-by-count":8,"title":["Hybrid Chromosome Genetic Algorithm for Generalized Traveling Salesman Problems"],"prefix":"10.1007","author":[{"given":"Han","family":"Huang","sequence":"first","affiliation":[]},{"given":"Xiaowei","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Zhifeng","family":"Hao","sequence":"additional","affiliation":[]},{"given":"Chunguo","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Yanchun","family":"Liang","sequence":"additional","affiliation":[]},{"given":"Xi","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","first-page":"43","volume":"2","author":"A.L. Henry-Labordere","year":"1969","unstructured":"Henry-Labordere, A.L.: The record balancing problem: A dynamic programming solution of a generalized traveling salesman problem. RAIRO B\u00a02, 43\u201349 (1969)","journal-title":"RAIRO B"},{"key":"16_CR2","first-page":"185","volume":"8","author":"J.P. Saksena","year":"1970","unstructured":"Saksena, J.P.: Mathematical model of scheduling clients through welfare agencies. CORS Journal\u00a08, 185\u2013200 (1970)","journal-title":"CORS Journal"},{"key":"16_CR3","first-page":"97","volume":"7","author":"S.S.S. Srivastava","year":"1969","unstructured":"Srivastava, S.S.S., Kumar, R.C.G., Sen, P.: Generalized traveling salesman problem through n sets of nodes. CORS Journal\u00a07, 97\u2013101 (1969)","journal-title":"CORS Journal"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Easwaran, M., Pitt, J., Poslad, S.: The agent service brokering problem as a generalized travelling salesman problem. In: Proceedings of the Third Annual Conference on Autononlous Agents, Seattle WA, USA, pp. 414\u2013415 (1999)","DOI":"10.1145\/301136.301279"},{"key":"16_CR5","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 traveling salesman problem. J. Oper. Res. Soc.\u00a047, 1461\u20131467 (1996)","journal-title":"J. Oper. Res. Soc."},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"16701","DOI":"10.1103\/PhysRevE.70.016701","volume":"70","author":"C.G. Wu","year":"2004","unstructured":"Wu, C.G., Liang, Y.C., Lee, H.P., Lu, C.: Generalized chromosome genetic algorithm for generalized traveling salesman problems and its applications for machining. Physical Review E\u00a070, 016701 (2004)","journal-title":"Physical Review E"},{"issue":"3","key":"16_CR7","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.: Branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Operations Research\u00a045(3), 378\u2013394 (1997)","journal-title":"Operations Research"},{"key":"16_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":"16_CR9","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.: Generalized traveling salesman problem through n sets of nodes: the asymmetrical cases. Discrete Appl. Math.\u00a018, 185\u2013197 (1987)","journal-title":"Discrete Appl. Math."},{"key":"16_CR10","unstructured":"Fischetti, M., Salazar, J.J., Toth, P.: A branch-and-cut algorithm for the symmetric generalized traveling salesman problem, Working paper, University of Bologna (1993)"},{"key":"16_CR11","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":"16_CR12","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, 571\u2013584 (1998)","journal-title":"European Journal of Operational Research"},{"key":"16_CR13","first-page":"39","volume":"31","author":"C.E. Noon","year":"1993","unstructured":"Noon, C.E., Bean, J.C.: An efficient transformation of the generalized traveling salesman problem. INFOR\u00a031, 39\u201344 (1993)","journal-title":"INFOR"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0020-0255(93)90133-7","volume":"74","author":"Y. Lien","year":"1993","unstructured":"Lien, Y., Ma, E., Wah, B.W.S.: Transformation of the generalized traveling salesman problem into the standard traveling salesman problem. Information Science\u00a074, 177\u2013189 (1993)","journal-title":"Information Science"},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0020-0255(96)00084-9","volume":"102","author":"V. Dimitrijevic","year":"1997","unstructured":"Dimitrijevic, V., Saric, Z.: An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs. Information Science\u00a0102, 105\u2013110 (1997)","journal-title":"Information Science"},{"issue":"4","key":"16_CR16","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. A traveling salesman problem library. ORSA Journal on Computing\u00a03(4), 376\u2013384 (1991)","journal-title":"ORSA Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Advances in Natural Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11539902_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:55:06Z","timestamp":1619506506000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11539902_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540283201","9783540318637"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11539902_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}