{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T17:31:33Z","timestamp":1770139893316,"version":"3.49.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T00:00:00Z","timestamp":1748304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T00:00:00Z","timestamp":1748304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 71971220"],"award-info":[{"award-number":["No. 71971220"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 71971220"],"award-info":[{"award-number":["No. 71971220"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 71971220"],"award-info":[{"award-number":["No. 71971220"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004761","name":"Natural Science Foundation of Hunan Province, China","doi-asserted-by":"crossref","award":["2023JJ30710- 2022JJ31020"],"award-info":[{"award-number":["2023JJ30710- 2022JJ31020"]}],"id":[{"id":"10.13039\/501100004761","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004761","name":"Natural Science Foundation of Hunan Province, China","doi-asserted-by":"crossref","award":["2023JJ30710- 2022JJ31020"],"award-info":[{"award-number":["2023JJ30710- 2022JJ31020"]}],"id":[{"id":"10.13039\/501100004761","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004761","name":"Natural Science Foundation of Hunan Province, China","doi-asserted-by":"crossref","award":["2023JJ30710- 2022JJ31020"],"award-info":[{"award-number":["2023JJ30710- 2022JJ31020"]}],"id":[{"id":"10.13039\/501100004761","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"DOI":"10.1007\/s43069-025-00456-7","type":"journal-article","created":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T06:55:41Z","timestamp":1748328941000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An Improved Self-Organizing Genetic Algorithm for Optimizing Container Transportation Routing Problems Under Times Windows"],"prefix":"10.1007","volume":"6","author":[{"given":"Yves","family":"Ndikuriyo","sequence":"first","affiliation":[]},{"given":"Yinggui","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Dung Davou","family":"Fom","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,27]]},"reference":[{"issue":"3","key":"456_CR1","doi-asserted-by":"publisher","first-page":"529","DOI":"10.12716\/1001.13.03.06","volume":"13","author":"AS Grzelakowski","year":"2019","unstructured":"Grzelakowski AS (2019) Global container shipping market development and its impact on mega logistics system. TransNav 13(3):529\u2013535. https:\/\/doi.org\/10.12716\/1001.13.03.06","journal-title":"TransNav"},{"key":"456_CR2","doi-asserted-by":"publisher","unstructured":"Petrenko O, Hryniv N  (2022) Research of world trends in the development of sea container transportation. Market Infrastructure no. 67.  https:\/\/doi.org\/10.32843\/Infrastruct67-7","DOI":"10.32843\/Infrastruct67-7"},{"key":"456_CR3","doi-asserted-by":"publisher","unstructured":"E\u043b\u043d\u0438\u043a O (2023) Strategies for the development of maritime transportation and efficient operation. Nauka \u00ec tehn\u00ecka s\u02b9ogodn\u00ec, no. 8(22). https:\/\/doi.org\/10.52058\/2786-6025-2023-8(22)-324-335","DOI":"10.52058\/2786-6025-2023-8(22)-324-335"},{"key":"456_CR4","doi-asserted-by":"publisher","unstructured":"Zhao Y, Liu R, Zhang X, Whiteing A (2018) A chance-constrained stochastic approach to intermodal container routing problems. PLoS One 13:null.  https:\/\/doi.org\/10.1371\/journal.pone.0192275","DOI":"10.1371\/journal.pone.0192275"},{"key":"456_CR5","doi-asserted-by":"publisher","unstructured":"Gunawan A, Utomo A, Pambudi G, Hamada K, Yanuar (2023) Optimization of shipping routes for container ships from Indonesia to the Asia-Pacific using heuristic algorithms. J Mar Sci Eng 11(7).  https:\/\/doi.org\/10.3390\/JMSE11071360","DOI":"10.3390\/JMSE11071360"},{"key":"456_CR6","doi-asserted-by":"crossref","unstructured":"JunXiao L (2020) Study on routing optimization model of container sea-rail intermodal transport based on transit period. Lect Notes Electr Eng 617:849\u2013857.  https:\/\/jglobal.jst.go.jp\/en\/detail?JGLOBAL_ID=202002216048145151. Accessed: 28 May 2024. [Online].","DOI":"10.1007\/978-981-15-0644-4_66"},{"issue":"3","key":"456_CR7","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1504\/IJSOM.2012.047625","volume":"12","author":"S Santhanakrishnan","year":"2012","unstructured":"Santhanakrishnan S, Narendran TT, Ganesh K, Anbuudayasankar SP (2012) Comparison of meta-heuristics for container ship routing problem. International Journal of Services and Operations Management 12(3):348\u2013367. https:\/\/doi.org\/10.1504\/IJSOM.2012.047625","journal-title":"International Journal of Services and Operations Management"},{"issue":"3","key":"456_CR8","doi-asserted-by":"publisher","first-page":"460","DOI":"10.7232\/IEMS.2022.21.3.460","volume":"21","author":"A Ridwan","year":"2022","unstructured":"Ridwan A (2022) Container ship planning optimization using intelligent metaheuristic algorithms. Industrial Engineering & Management Systems 21(3):460\u2013468. https:\/\/doi.org\/10.7232\/IEMS.2022.21.3.460","journal-title":"Industrial Engineering & Management Systems"},{"key":"456_CR9","doi-asserted-by":"publisher","unstructured":"Sharypova K (2014) Optimization of intermodal container transportation.  https:\/\/doi.org\/10.6100\/IR766077","DOI":"10.6100\/IR766077"},{"key":"456_CR10","doi-asserted-by":"publisher","first-page":"113289","DOI":"10.1016\/J.DSS.2020.113289","volume":"134","author":"W Guo","year":"2020","unstructured":"Guo W, Atasoy B, van Blokland WB, Negenborn RR (2020) A dynamic shipment matching problem in hinterland synchromodal transportation. Decis Support Syst 134:113289. https:\/\/doi.org\/10.1016\/J.DSS.2020.113289","journal-title":"Decis Support Syst"},{"issue":"1","key":"456_CR11","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0377-2217(89)90057-X","volume":"42","author":"M Goetschalckx","year":"1989","unstructured":"Goetschalckx M, Jacobs-Blecha C (1989) The vehicle routing problem with backhauls. Eur J Oper Res 42(1):39\u201351. https:\/\/doi.org\/10.1016\/0377-2217(89)90057-X","journal-title":"Eur J Oper Res"},{"key":"456_CR12","doi-asserted-by":"publisher","unstructured":"Gocmen E, Erol R (2019) Hinterland container transportation using mathematical programming approach, pp 43\u201351.  https:\/\/doi.org\/10.1007\/978-3-030-03317-0_4","DOI":"10.1007\/978-3-030-03317-0_4"},{"key":"456_CR13","doi-asserted-by":"publisher","unstructured":"Jost N et al. (2023) Partitioned vs. integrated planning of hinterland networks for LCL Transportation. Lect Notes Logistics 257\u2013273. https:\/\/doi.org\/10.1007\/978-3-031-28236-2_16","DOI":"10.1007\/978-3-031-28236-2_16"},{"issue":"3","key":"456_CR14","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1287\/INTE.2021.1102","volume":"52","author":"L Zhen","year":"2022","unstructured":"Zhen L, Lv W, Tan Z, Dong B (2022) Container transportation scheduling between port yards and the hinterland in Yunfeng. Interfaces (Providence) 52(3):250\u2013266. https:\/\/doi.org\/10.1287\/INTE.2021.1102","journal-title":"Interfaces (Providence)"},{"key":"456_CR15","doi-asserted-by":"publisher","DOI":"10.1051\/matecconf\/202031202005","volume":"312","author":"M Amine Masmoudi","year":"2020","unstructured":"Amine Masmoudi M, Kuzmicz KA, Pesch E, Demir E, Hosny M (2020) Container truck transportation routing as a mixed fleet heterogeneous dial-a-ride problem. MATEC Web of Conferences 312:02005. https:\/\/doi.org\/10.1051\/matecconf\/202031202005","journal-title":"MATEC Web of Conferences"},{"key":"456_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2018\/6523764","volume":"2018","author":"H Ma","year":"2018","unstructured":"Ma H, Lei T, Hu X (2018) Container swap trailer transportation routing problem based on genetic algorithm. Math Probl Eng 2018:1\u201315. https:\/\/doi.org\/10.1155\/2018\/6523764","journal-title":"Math Probl Eng"},{"issue":"3","key":"456_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/S43069-021-00093-W\/METRICS","volume":"2","author":"N Charalambopoulos","year":"2021","unstructured":"Charalambopoulos N, Nearchou AC (2021) Ship routing using genetic algorithms. Operations Research Forum 2(3):1\u201326. https:\/\/doi.org\/10.1007\/S43069-021-00093-W\/METRICS","journal-title":"Operations Research Forum"},{"key":"456_CR18","doi-asserted-by":"publisher","unstructured":"Zhen L, Lv W, Tan Z, Dong B (2022) Container transportation scheduling between port yards and the hinterland in Yunfeng. Interfaces (Providence) 52(3). https:\/\/doi.org\/10.1287\/inte.2021.1102","DOI":"10.1287\/inte.2021.1102"},{"key":"456_CR19","doi-asserted-by":"publisher","unstructured":"Chen D, Zhang Y, Gao L, Thompson R (2019) Optimizing multimodal transportation routes considering container use. Sustainability null: null. https:\/\/doi.org\/10.3390\/su11195320","DOI":"10.3390\/su11195320"},{"issue":"2","key":"456_CR20","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1287\/TRSC.2013.0461","volume":"48","author":"Q Meng","year":"2014","unstructured":"Meng Q, Wang S, Andersson H, Thun K (2014) Containership routing and scheduling in liner shipping: Overview and future research directions. Transp Sci 48(2):265\u2013280. https:\/\/doi.org\/10.1287\/TRSC.2013.0461","journal-title":"Transp Sci"},{"key":"456_CR21","unstructured":"Zhao S, Louidor E, Gupta M (2022) Global Optimization Networks. Proc Mach Learn Res 162: 26927\u201326957. Available: https:\/\/arxiv.org\/abs\/2202.01277v1. Accessed: 30 May 2024. [Online]"},{"key":"456_CR22","doi-asserted-by":"publisher","DOI":"10.1155\/2022\/3442921","volume":"2022","author":"Y Cai","year":"2022","unstructured":"Cai Y, Chen J, Lei D, Yu J (2022) The integration of multimodal networks: the generalized modal split and collaborative optimization of transportation hubs. J Adv Transp 2022:1. https:\/\/doi.org\/10.1155\/2022\/3442921","journal-title":"J Adv Transp"},{"issue":"3(123)","key":"456_CR23","doi-asserted-by":"publisher","first-page":"68","DOI":"10.15587\/1729-4061.2023.283172","volume":"3","author":"S Razghonov","year":"2023","unstructured":"Razghonov S et al (2023) Building models to optimize vehicle downtime in multimodal transportation. Eastern-European Journal of Enterprise Technologies 3(3(123)):68\u201376. https:\/\/doi.org\/10.15587\/1729-4061.2023.283172","journal-title":"Eastern-European Journal of Enterprise Technologies"},{"issue":"12","key":"456_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/MATH8122109","volume":"8","author":"CN Wang","year":"2020","unstructured":"Wang CN, Dang TT, Le TQ, Kewcharoenwong P (2020) Transportation optimization models for intermodal networks with fuzzy node capacity, detour factor, and vehicle utilization constraints. Mathematics 8(12):1\u201327. https:\/\/doi.org\/10.3390\/MATH8122109","journal-title":"Mathematics"},{"key":"456_CR25","doi-asserted-by":"publisher","unstructured":"Cornu\u00e9jols G, Pea J, T\u00fct\u00fcnc\u00fc  R (2018) Mixed integer programming: theory and algorithms. Optimization Methods in Finance, pp 140\u2013160.  https:\/\/doi.org\/10.1017\/9781107297340.009","DOI":"10.1017\/9781107297340.009"},{"key":"456_CR26","doi-asserted-by":"publisher","unstructured":"Ismail FS, Yusof R (2010) A new self-organizing multi-objective optimization method. Conf Proc IEEE Int Conf Syst Man Cybern 1016\u20131021. https:\/\/doi.org\/10.1109\/ICSMC.2010.5641746","DOI":"10.1109\/ICSMC.2010.5641746"},{"key":"456_CR27","doi-asserted-by":"publisher","unstructured":"De Rainville FM, Fortin FA, Gardner MA, Parizeau M, Gagn\u00e9 C (2012) DEAP: a python framework for evolutionary algorithms. GECCO \u201812, Proceedings of the 14th International Conference on Genetic and Evolutionary Computation Companion, pp 85\u201392.  https:\/\/doi.org\/10.1145\/2330784.2330799","DOI":"10.1145\/2330784.2330799"},{"key":"456_CR28","doi-asserted-by":"publisher","unstructured":"Al-Hayali S, Ucan O, Bayat O (2018) Genetic Algorithm for finding shortest paths problem. Proceedings of the Fourth International Conference on Engineering & MIS 2018. https:\/\/doi.org\/10.1145\/3234698.3234725","DOI":"10.1145\/3234698.3234725"},{"issue":"6","key":"456_CR29","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1109\/TEVC.2002.804323","volume":"6","author":"CW Ahn","year":"2002","unstructured":"Ahn CW, Ramakrishna RS (2002) A genetic algorithm for the shortest path routing problem and the sizing of populations. IEEE Trans Evol Comput 6(6):566\u2013579. https:\/\/doi.org\/10.1109\/TEVC.2002.804323","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"456_CR30","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197. https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"456_CR31","doi-asserted-by":"publisher","first-page":"1518","DOI":"10.1016\/j.eswa.2011.08.044","volume":"39","author":"C Chitra","year":"2012","unstructured":"Chitra C, Subbaraj P (2012) A nondominated sorting genetic algorithm solution for shortest path routing problem in computer networks. Expert Syst Appl 39(1):1518\u20131525. https:\/\/doi.org\/10.1016\/j.eswa.2011.08.044","journal-title":"Expert Syst Appl"},{"issue":"1","key":"456_CR32","doi-asserted-by":"publisher","first-page":"17","DOI":"10.3844\/JCSSP.2011.17.26","volume":"7","author":"S Potti","year":"2010","unstructured":"Potti S, Chinnasamy C (2010) Strength pareto evolutionary algorithm based multi-objective optimization for shortest path routing problem in computer networks. J Comput Sci 7(1):17\u201326. https:\/\/doi.org\/10.3844\/JCSSP.2011.17.26","journal-title":"J Comput Sci"},{"issue":"6","key":"456_CR33","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang Q, Li H (2007) \u201cMOEA\/D: A multi-objective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712\u2013731. https:\/\/doi.org\/10.1109\/TEVC.2007.892759","journal-title":"IEEE Trans Evol Comput"},{"key":"456_CR34","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-642-41142-7_14","volume":"412","author":"A Konstantinidis","year":"2013","unstructured":"Konstantinidis A, Pericleous S, Charalambous C (2013) MOEA\/D for a Tri-objective Vehicle Routing Problem. IFIP Adv Inf Commun Technol 412:131\u2013140. https:\/\/doi.org\/10.1007\/978-3-642-41142-7_14","journal-title":"IFIP Adv Inf Commun Technol"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-025-00456-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-025-00456-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-025-00456-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T15:57:33Z","timestamp":1760457453000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-025-00456-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,27]]},"references-count":34,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2025,6]]}},"alternative-id":["456"],"URL":"https:\/\/doi.org\/10.1007\/s43069-025-00456-7","relation":{},"ISSN":["2662-2556"],"issn-type":[{"value":"2662-2556","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,27]]},"assertion":[{"value":"29 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Institutional Review Board Statement"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed Consent"}},{"value":"The authors declare no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"71"}}