{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T20:36:44Z","timestamp":1771706204584,"version":"3.50.1"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031777370","type":"print"},{"value":"9783031777387","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,11,14]],"date-time":"2024-11-14T00:00:00Z","timestamp":1731542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,14]],"date-time":"2024-11-14T00:00:00Z","timestamp":1731542400000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-77738-7_11","type":"book-chapter","created":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T16:40:25Z","timestamp":1732034425000},"page":"120-131","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Three-Part Genetic Algorithm to\u00a0Optimize the\u00a0Outbound Train Loading Process Using a\u00a0Multiple Travelling Salesman Problem Approach"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-3915-5357","authenticated-orcid":false,"given":"Gon\u00e7alo","family":"Correia","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8837-4637","authenticated-orcid":false,"given":"Jacinto","family":"Estima","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1824-1075","authenticated-orcid":false,"given":"Alberto","family":"Cardoso","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,11,14]]},"reference":[{"key":"11_CR1","unstructured":"Advantages of reach stackers for container handling. https:\/\/www.boomandbucket.com\/blog\/advantages-of-reach-stackers-for-container-handling. Accessed 9 June 2024"},{"key":"11_CR2","unstructured":"Reach stackers: Your complete guide to container handling equipment (CHE). https:\/\/terminaloperatingsystem.com\/container-handling-equipment-che-everything-you-need-to-know-about-reach-stackers. Accessed 9 June 2024"},{"key":"11_CR3","unstructured":"United nations. https:\/\/www.un.org\/en\/climatechange\/science\/causes-effects-climate-change. Accessed 8 Nov 2023"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.trpro.2021.01.089","volume":"52","author":"D Ambrosino","year":"2021","unstructured":"Ambrosino, D., Asta, V., Crainic, T.G.: Optimization challenges and literature overview in the intermodal rail-sea terminal. Transp. Res. Procedia 52, 163\u2013170 (2021)","journal-title":"Transp. Res. Procedia"},{"key":"11_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43631-8","volume-title":"Natural Computing Algorithms","author":"A Brabazon","year":"2015","unstructured":"Brabazon, A., O\u2019Neill, M., McGarraghy, S.: Natural Computing Algorithms. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-43631-8"},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/s00291-010-0232-1","volume":"34","author":"F Bruns","year":"2012","unstructured":"Bruns, F., Knust, S.: Optimized load planning of trains in intermodal transportation. OR Spect. 34(3), 511\u2013533 (2012)","journal-title":"OR Spect."},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"100369","DOI":"10.1016\/j.cosrev.2021.100369","volume":"40","author":"O Cheikhrouhou","year":"2021","unstructured":"Cheikhrouhou, O., Khoufi, I.: A comprehensive survey on the multiple traveling salesman problem: applications, approaches and taxonomy. Comput. Sci. Rev. 40, 100369 (2021)","journal-title":"Comput. Sci. Rev."},{"key":"11_CR8","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-319-00951-3_11","volume-title":"Advances in Computational Science, Engineering and Information Technology","author":"G Kizilate\u015f","year":"2013","unstructured":"Kizilate\u015f, G., Nuriyeva, F.: On the nearest neighbor algorithms for the traveling salesman problem. In: Nagamalai, D., Kumar, A., Annamalai, A. (eds.) Advances in Computational Science, Engineering and Information Technology. AISC, vol. 225, pp. 111\u2013118. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-319-00951-3_11"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"113381","DOI":"10.1016\/j.eswa.2020.113381","volume":"151","author":"B Koohestani","year":"2020","unstructured":"Koohestani, B.: A crossover operator for improving the efficiency of permutation-based genetic algorithms. Expert Syst. Appl. 151, 113381 (2020)","journal-title":"Expert Syst. Appl."},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Kora, P.: Crossover operators in genetic algorithms: a review. Int. J. Comput. Appl. 10 (2017)","DOI":"10.5120\/ijca2017913370"},{"key":"11_CR11","first-page":"889","volume":"19","author":"WY Lin","year":"2003","unstructured":"Lin, W.Y., Lee, W.Y., Hong, T.P.: Adapting crossover and mutation rates* in genetic algorithms. J. Inf. Sci. Eng. 19, 889\u2013903 (2003)","journal-title":"J. Inf. Sci. Eng."},{"key":"11_CR12","unstructured":"Luke, S.: Essentials of metaheuristics: a set of undergraduate lecture notes. Lulu, S.l. (2013)"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1038\/ncpcardio1399","volume":"6","author":"N Mills","year":"2009","unstructured":"Mills, N., Donaldson, K., Hadoke, P., et al.: Adverse cardiovascular effects of air pollution. Nat. Rev. Cardiol. 6, 36\u201344 (2009)","journal-title":"Nat. Rev. Cardiol."},{"key":"11_CR14","unstructured":"Nations, U.: Review of maritime transport 2023. In: United Nations Conference on Trade and Development, Geneva (2023)"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"108626","DOI":"10.1016\/j.cie.2022.108626","volume":"172","author":"P Rathi","year":"2022","unstructured":"Rathi, P., Upadhyay, A.: Container retrieval and wagon assignment planning at container rail terminals. Comput. Ind. Eng. 172, 108626 (2022)","journal-title":"Comput. Ind. Eng."}],"container-title":["Lecture Notes in Computer Science","Intelligent Data Engineering and Automated Learning \u2013 IDEAL 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-77738-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T16:49:17Z","timestamp":1732034957000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-77738-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,14]]},"ISBN":["9783031777370","9783031777387"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-77738-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,14]]},"assertion":[{"value":"14 November 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IDEAL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Data Engineering and Automated Learning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Valencia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 November 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 November 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ideal2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}