{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T16:18:04Z","timestamp":1775578684566,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540459019","type":"print"},{"value":"9783540459026","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11881070_104","type":"book-chapter","created":{"date-parts":[[2006,9,22]],"date-time":"2006-09-22T09:35:07Z","timestamp":1158917707000},"page":"783-791","source":"Crossref","is-referenced-by-count":2,"title":["On Directed Edge Recombination Crossover for ATSP"],"prefix":"10.1007","author":[{"given":"Zeng","family":"Hongxin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhang","family":"guohui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cao","family":"shili","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"104_CR1","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)"},{"key":"104_CR2","doi-asserted-by":"publisher","first-page":"1275","DOI":"10.1016\/S0895-7177(03)90129-4","volume":"38","author":"K. Katayama","year":"2003","unstructured":"Katayama, K.: Analysis of Crossovers and Selections in a Coarse-Grained Parallel Genetic. Algorithm Mathematical and Computer Modelling\u00a038, 1275\u20131282 (2003)","journal-title":"Algorithm Mathematical and Computer Modelling"},{"key":"104_CR3","unstructured":"Seppala, Alan, D.: Genetic algorithms for the traveling salesman problem using edge assembly crossovers. Master degree dissertation, University of Nevada, Las Vegas (2003)"},{"key":"104_CR4","first-page":"738","volume":"E81-A","author":"K. Katayama","year":"1998","unstructured":"Katayama, K., Hirabayashi, H., Narihisa, H.: Performance analysis of a new genetic crossover for the traveling salesman problem. IEICE tins. Fundamentals\u00a0E81-A, 738\u2013750 (1998)","journal-title":"IEICE tins. Fundamentals"},{"key":"104_CR5","unstructured":"Whitley, D., Starkweather, T., Shaner, D.: Traveling Salesman and Sequence Scheduling: Quality Solutions Using Genetic Edge Recombination. In: Handbook of Genetic Algorithms, Van Nostrand (1990)"},{"key":"104_CR6","doi-asserted-by":"crossref","unstructured":"Nguyen, H.D., Yoshihara, I., Yasunaga, M.: Modified edge recombination operators of genetic algorithms for the traveling salesman problem Industrial Electronics Society. In: IECON 2000. 26th Annual Conference of the IEEE, October 22-28, vol.\u00a04, pp. 2815\u20132820 (2000)","DOI":"10.1109\/IECON.2000.972444"},{"key":"104_CR7","doi-asserted-by":"crossref","unstructured":"Nagata, Y.: Criteria for designing crossovers for TSP Evolutionary Computation. In: Congress on CEC 2004, June 19-23, vol.\u00a02, pp. 1465\u20131472 (2004)","DOI":"10.1109\/CEC.2004.1331069"},{"issue":"4","key":"104_CR8","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1109\/21.286385","volume":"24","author":"M. Srinivas","year":"1994","unstructured":"Srinivas, M., Patnaik, L.M.: Adaptive probabilities of crossover and mutation in genetic algorithms Systems. IEEE Transactions on Man and Cybernetics\u00a024(4), 656\u2013667 (1994)","journal-title":"IEEE Transactions on Man and Cybernetics"},{"key":"104_CR9","unstructured":"Zhang, J., Chung, H.S.H., Hu, B.J.: Adaptive probabilities of crossover and mutation in genetic algorithms based on clustering technique Evolutionary Computation. In: Congress on CEC 2004, June 19-23, vol.\u00a02, pp. 2280\u20132287 (2004)"},{"key":"104_CR10","unstructured":"Gerhard Reinelt\u2019s homepage, http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95\/"},{"key":"104_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-24652-7_21","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"C.-K. Ting","year":"2004","unstructured":"Ting, C.-K.: Improving Edge Recombination through Alternate Inheritance and Greedy Manner. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2004. LNCS, vol.\u00a03004, pp. 210\u2013219. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Advances in Natural Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11881070_104.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T23:26:57Z","timestamp":1736551617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11881070_104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540459019","9783540459026"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11881070_104","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}