{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:40:58Z","timestamp":1743032458475,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031096761"},{"type":"electronic","value":"9783031096778"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-09677-8_23","type":"book-chapter","created":{"date-parts":[[2022,6,25]],"date-time":"2022-06-25T18:33:51Z","timestamp":1656182031000},"page":"272-281","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Copy and\u00a0Paste: A Multi-offspring Genetic Algorithm Crossover Operator for\u00a0the\u00a0Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Chia E.","family":"Tungom","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ben","family":"Niu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tongtong","family":"Xing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,26]]},"reference":[{"unstructured":"Graey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman W.H, San Francisco (1979)","key":"23_CR1"},{"unstructured":"Papadimitriou, C.H., Stegilitz, K.: Combinatorial Optimization: Algorithms and Complexity. Prentice Hall of India Private Limited, India (1997)","key":"23_CR2"},{"unstructured":"NP-hardness. https:\/\/en.wikipedia.org\/wiki\/NP-hardness. Accessed 27 Jan 2022","key":"23_CR3"},{"issue":"1","key":"23_CR4","first-page":"26","volume":"2","author":"A Philip","year":"2011","unstructured":"Philip, A., Taofiki, A.A., Kehinde, O.: A genetic algorithm for solving traveling salesman problem. Int. J. Adv. Comput. Sci. Appl. 2(1), 26\u201329 (2011)","journal-title":"Int. J. Adv. Comput. Sci. Appl."},{"doi-asserted-by":"crossref","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: The Traveling Sales-man Problem: A Guided Tour of Combinatorial Optimization. Wiley, Chichester (1985)","key":"23_CR5","DOI":"10.2307\/2582681"},{"issue":"1","key":"23_CR6","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/j.asoc.2016.02.021","volume":"43","author":"J Wang","year":"2016","unstructured":"Wang, J., Ersoy, O.K., He, M., Wang, F.: Multi-ospring genetic algorithm and its application to the traveling salesman problem. Appl. Soft Comput. 43(1), 415\u2013423 (2016)","journal-title":"Appl. Soft Comput."},{"issue":"11","key":"23_CR7","doi-asserted-by":"publisher","first-page":"2640","DOI":"10.3390\/s19112640","volume":"19","author":"J Xin","year":"2019","unstructured":"Xin, J., Zhong, J., Yang, F., Cui, Y., Sheng, J.: An improved genetic algorithm for path-planning of unmanned surface vehicle. Sensors (Basel) 19(11), 2640 (2019)","journal-title":"Sensors (Basel)"},{"issue":"2","key":"23_CR8","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10732-019-09431-y","volume":"26","author":"QM Ha","year":"2019","unstructured":"Ha, Q.M., Deville, Y., Pham, Q.D., H\u00e0, M.H.: A hybrid genetic algorithm for the traveling salesman problem with drone. J. Heuristics 26(2), 219\u2013247 (2019). https:\/\/doi.org\/10.1007\/s10732-019-09431-y","journal-title":"J. Heuristics"},{"issue":"3","key":"23_CR9","doi-asserted-by":"publisher","first-page":"6995","DOI":"10.1016\/j.eswa.2008.08.026","volume":"36","author":"F Liu","year":"2009","unstructured":"Liu, F., Zeng, G.: Study of genetic algorithm with reinforcement learning to solve the TSP. Expert Syst. Appl. 36(3), 6995\u20137001 (2009)","journal-title":"Expert Syst. Appl."},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10846-012-9805-3","volume":"72","author":"E Kivelevitch","year":"2013","unstructured":"Kivelevitch, E., Cohen, K., Kumar, M.: A market-based solution to the multiple traveling salesmen problem. J. Intell. Robot. Syst. 72, 21\u201340 (2013)","journal-title":"J. Intell. Robot. Syst."},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.trc.2015.03.005","volume":"54","author":"CC Murray","year":"2015","unstructured":"Murray, C.C., Chu, A.G.: The flying sidekick traveling salesman problem: optimization of drone-assisted parcel delivery. Transp. Res. Part C Emerg. Technol. 54, 86\u2013109 (2015)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1287\/trsc.2017.0791","volume":"52","author":"N Agatz","year":"2018","unstructured":"Agatz, N., Bouman, P., Schmidt, M.: Optimization approaches for the traveling salesman problem with drone. Transp. Sci. 52, 965\u2013981 (2018)","journal-title":"Transp. Sci."},{"issue":"4598","key":"23_CR13","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vechi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983). New series","journal-title":"Science"},{"issue":"7","key":"23_CR14","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1093\/bioinformatics\/16.7.619","volume":"16","author":"C Korostensky","year":"2000","unstructured":"Korostensky, C., Gonnet, G.H.: Using traveling salesman problem algorithms for evolutionary tree construction. Bioinformatics 16(7), 619\u2013627 (2000)","journal-title":"Bioinformatics"},{"doi-asserted-by":"crossref","unstructured":"Roberti, R., Wen, M.: The electric traveling salesman problem with time windows. Transp. Res. Part E Logist. Transp. Rev. 89(7), 32\u201352 (2016)","key":"23_CR15","DOI":"10.1016\/j.tre.2016.01.010"},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.cor.2014.11.011","volume":"57","author":"E Ruiz","year":"2015","unstructured":"Ruiz, E., Albareda-Sambola, M., Fern\u2019andez, E., Resende, M.G.C.: A biased random-key genetic algorithm for the capacitated minimum spanning tree problem. Comput. Oper. Res. 57, 95\u2013108 (2015)","journal-title":"Comput. Oper. Res."},{"unstructured":"Winkenbach, M., Parks, S., Noszek, J.: Technical Proceedings of the Amazon Last Mile Routing Research Challenge. https:\/\/dspace.mit.edu\/handle\/1721.1\/131235. Accessed 02 Sep 2021","key":"23_CR17"},{"key":"23_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113959","volume":"165","author":"H Park","year":"2021","unstructured":"Park, H., Son, D., Koo, B., Jeong, B.: Waiting strategy for the vehicle routing problem with simultaneous pickup and delivery using genetic algorithm. Expert Syst. Appl. 165, 113959 (2021)","journal-title":"Expert Syst. Appl."},{"unstructured":"Liu, S.: A powerful genetic algorithm for traveling salesman problem. Preprint arXiv:1402.4699 (2014)","key":"23_CR19"},{"unstructured":"Seniw, D.: A genetic algorithm for the traveling salesman problem. M.Sc. thesis, University of North Carolina, at Charlotte (1996). http:\/\/www.heatonresearch.com\/articales\/65\/page1.html","key":"23_CR20"}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-09677-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T11:12:20Z","timestamp":1718881940000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-09677-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031096761","9783031096778"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-09677-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"26 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Swarm Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"swarm2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iasei.org\/icsi2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"171","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"85","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.6","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2-5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}