{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:04:18Z","timestamp":1773655458368,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319734408","type":"print"},{"value":"9783319734415","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-73441-5_36","type":"book-chapter","created":{"date-parts":[[2018,1,2]],"date-time":"2018-01-02T10:42:23Z","timestamp":1514889743000},"page":"341-349","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman\u00a0Problem"],"prefix":"10.1007","author":[{"given":"Anton V.","family":"Eremeev","sequence":"first","affiliation":[]},{"given":"Yulia V.","family":"Kovalenko","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,3]]},"reference":[{"key":"36_CR1","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316474","volume-title":"Statistics: A Biomedical Introduction","author":"BW Brown","year":"1977","unstructured":"Brown, B.W., Hollander, M.: Statistics: A Biomedical Introduction. Wiley Inc., New York (1977)"},{"key":"36_CR2","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1023\/B:HEUR.0000045321.59202.52","volume":"10","author":"LS Buriol","year":"2004","unstructured":"Buriol, L.S., Franca, P.M., Moscato, P.: A new memetic algorithm for the asymmetric traveling salesman problem. J. Heuristics 10, 483\u2013506 (2004)","journal-title":"J. Heuristics"},{"issue":"2","key":"36_CR3","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/ijoc.15.3.233.16078","volume":"15","author":"W Cook","year":"2003","unstructured":"Cook, W., Seymour, P.: Tour merging via branch-decomposition. INFORMS J. Comput. 15(2), 233\u2013248 (2003)","journal-title":"INFORMS J. Comput."},{"key":"36_CR4","unstructured":"Dongarra, J.J.: Performance of various computers using standard linear equations software. Technical Report CS-89-85, 110 p. University of Manchester (2014)"},{"issue":"1","key":"36_CR5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.7155\/jgaa.00137","volume":"11","author":"D Eppstein","year":"2007","unstructured":"Eppstein, D.: The traveling salesman problem for cubic graphs. J. Graph Algorithms Appl. 11(1), 61\u201381 (2007)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"36_CR6","doi-asserted-by":"crossref","first-page":"165","DOI":"10.2298\/YJOR131030041E","volume":"24","author":"AV Eremeev","year":"2014","unstructured":"Eremeev, A.V., Kovalenko, J.V.: Optimal recombination in genetic algorithms for combinatorial optimization problems: Part II. Yugoslav J. Oper. Res. 24(2), 165\u2013186 (2014)","journal-title":"Yugoslav J. Oper. Res."},{"key":"36_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-319-30698-8_10","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"AV Eremeev","year":"2016","unstructured":"Eremeev, A.V., Kovalenko, J.V.: Experimental evaluation of two approaches to optimal recombination for permutation problems. In: Chicano, F., Hu, B., Garc\u00eda-S\u00e1nchez, P. (eds.) EvoCOP 2016. LNCS, vol. 9595, pp. 138\u2013153. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30698-8_10"},{"key":"36_CR8","volume-title":"Computers and Intractability. A Guide to the Theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-completeness. W. H. Freeman and Company, San Francisco (1979)"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Goldberg, D., Thierens, D.: Elitist recombination: An integrated selection recombination GA. In: First IEEE World Congress on Computational Intelligence, vol. 1, pp. 508\u2013512. IEEE Service Center, Piscataway, New Jersey (1994)","DOI":"10.1109\/ICEC.1994.349898"},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Johnson, D.S., McGeorch, L.A.: The traveling salesman problem: a case study. In: Aarts, E., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization, pp. 215\u2013336. Wiley Ltd. (1997)","DOI":"10.1515\/9780691187563-011"},{"key":"36_CR11","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1287\/opre.28.5.1086","volume":"28","author":"PC Kanellakis","year":"1980","unstructured":"Kanellakis, P.C., Papadimitriou, C.H.: Local search for the asymmetric traveling salesman problem. Oper. Res. 28, 1086\u20131099 (1980)","journal-title":"Oper. Res."},{"key":"36_CR12","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1137\/0208045","volume":"8","author":"RM Karp","year":"1979","unstructured":"Karp, R.M.: A patching algorithm for the nonsymmetric traveling-salesman problem. SIAM J. Comput. 8, 561\u2013573 (1979)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"36_CR13","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF01531276","volume":"10","author":"NJ Radcliffe","year":"1994","unstructured":"Radcliffe, N.J.: The algebra of genetic algorithms. Ann. Math. Artif. Intell. 10(4), 339\u2013384 (1994)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"3","key":"36_CR14","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1287\/ijoc.9.3.231","volume":"9","author":"CR Reeves","year":"1997","unstructured":"Reeves, C.R.: Genetic algorithms for the operations researcher. INFORMS J. Comput. 9(3), 231\u2013250 (1997)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"36_CR15","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 J. Comput. 3(4), 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"key":"36_CR16","doi-asserted-by":"crossref","unstructured":"Tin\u00f3s, R., Whitley, D., Ochoa, G.: Generalized asymmetric partition crossover (GAPX) for the asymmetric TSP. In: The 2014 Annual Conference on Genetic and Evolutionary Computation, pp. 501\u2013508. ACM, New York (2014)","DOI":"10.1145\/2576768.2598245"},{"key":"36_CR17","unstructured":"Whitley, D., Starkweather, T., Shaner, D.: The traveling salesman and sequence scheduling: Quality solutions using genetic edge recombination. In: Davis, L. (ed.) Handbook of Genetic Algorithms, pp. 350\u2013372. Van Nostrand Reinhold (1991)"},{"key":"36_CR18","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0377-2217(94)00301-7","volume":"92","author":"M Yagiura","year":"1996","unstructured":"Yagiura, M., Ibaraki, T.: The use of dynamic programming in genetic algorithms for permutation problems. Eur. J. Oper. Res. 92, 387\u2013401 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"36_CR19","unstructured":"Zhang, W.: Depth-first branch-and-bound versus local search: A case study. In: 17th National Conference on Artificial Intelligence, Austin, pp. 930\u2013935 (2000)"}],"container-title":["Lecture Notes in Computer Science","Large-Scale Scientific Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73441-5_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T09:53:53Z","timestamp":1751190833000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-73441-5_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319734408","9783319734415"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73441-5_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}