{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T02:52:01Z","timestamp":1784602321265,"version":"3.55.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T00:00:00Z","timestamp":1719878400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T00:00:00Z","timestamp":1719878400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Henan Province Science and Technology Research Plan Project of China","award":["232102321026"],"award-info":[{"award-number":["232102321026"]}]},{"name":"Henan Province Science and Technology Research Plan Project of China","award":["232102321039"],"award-info":[{"award-number":["232102321039"]}]},{"DOI":"10.13039\/100018979","name":"Henan Province Philosophy and Social Science Planning Project","doi-asserted-by":"crossref","award":["2023BJJ085"],"award-info":[{"award-number":["2023BJJ085"]}],"id":[{"id":"10.13039\/100018979","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1604150"],"award-info":[{"award-number":["U1604150"]}],"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":["U1804151"],"award-info":[{"award-number":["U1804151"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s12351-024-00845-6","type":"journal-article","created":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T11:02:04Z","timestamp":1719918124000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Integrated optimization of wagon flow routing and train formation plan"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8495-8336","authenticated-orcid":false,"given":"Bing","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ce","family":"Yun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hua","family":"Xuan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,7,2]]},"reference":[{"issue":"3","key":"845_CR1","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1080\/23248378.2020.1756475","volume":"9","author":"O Abuobidalla","year":"2020","unstructured":"Abuobidalla O, Chen MY, Chauhan S (2020) Modelling and solving an integrated freight train scheduling and trip planning problem with hazardous materials. Int J Rail Transp 9(3):256\u2013289","journal-title":"Int J Rail Transp"},{"issue":"6","key":"845_CR2","first-page":"3765","volume":"26","author":"R Alikhani-Kooshkak","year":"2019","unstructured":"Alikhani-Kooshkak R, Tavakkoli-Moghaddam R, Jamili A, Ebrahimnejad S (2019) Multi-objective mathematical modeling of an integrated train makeup and routing problem in an Iranian railway company. Sci Iranica 26(6):3765\u20133779","journal-title":"Sci Iranica"},{"issue":"3","key":"845_CR3","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1016\/j.ejor.2011.05.013","volume":"214","author":"D Anghinolfi","year":"2011","unstructured":"Anghinolfi D, Paolucci M, Sacone S, Siri S (2011) Freight transportation in railway networks with automated terminals: a mathematical model and MIP heuristic approaches. Eur J Oper Res 214(3):588\u2013594","journal-title":"Eur J Oper Res"},{"key":"845_CR4","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1002\/net.22133","volume":"81","author":"P Arsalani","year":"2023","unstructured":"Arsalani P, Reisi-Nafchi M, Dardashti V, Moslehi G (2023) Two new mixed-integer programming models for the integrated train formation and shipment path optimization problem. Networks 81:359\u2013377","journal-title":"Networks"},{"issue":"2","key":"845_CR5","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1287\/trsc.2015.0656","volume":"50","author":"R Borndoerfer","year":"2016","unstructured":"Borndoerfer R, Klug T, Schlechte T, Fuegenschuh A, Schang T, Schuelldorf H (2016) The freight train routing problem for congested railway networks with mixed traffic. Transp Sci 50(2):408\u2013423","journal-title":"Transp Sci"},{"issue":"12","key":"845_CR6","first-page":"1","volume":"118","author":"CS Chen","year":"2019","unstructured":"Chen CS, Dollevoet T, Zhao J (2019) One-block train formation in large-scale railway networks: an exact model and a tree-based decomposition algorithm. Transp Res Part B Methodol 118(12):1\u201330","journal-title":"Transp Res Part B Methodol"},{"issue":"2","key":"845_CR7","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 multi-objective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"845_CR8","first-page":"579","volume":"9","author":"CJ Guo","year":"2020","unstructured":"Guo CJ (2020) Optimization model and algorithm for the placing-in and taking-out of wagons in railway stations with branch-shaped goods operating sites. Int J Rail Transp 9(6):579\u2013594","journal-title":"Int J Rail Transp"},{"issue":"3","key":"845_CR9","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1016\/j.ejor.2016.09.001","volume":"258","author":"WH Hu","year":"2017","unstructured":"Hu WH, Mao JF, Wei KJ (2017) Energy-efficient rail guided vehicle routing for two-sided loading\/unloading automated freight handling system. Eur J Oper Res 258(3):943\u2013957","journal-title":"Eur J Oper Res"},{"key":"845_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.119554","volume":"217","author":"WJ Hu","year":"2023","unstructured":"Hu WJ, Dong JJ, Yang K, Ren R, Zl C (2023) Network planning of metro-based underground logistics system against mixed uncertainties: a multi-objective cooperative co-evolutionary optimization approach. Expert Syst Appl 217:119554","journal-title":"Expert Syst Appl"},{"issue":"2","key":"845_CR11","first-page":"367","volume":"40","author":"F Jaehn","year":"2018","unstructured":"Jaehn F, Otto A, Seifried K (2018) Shunting operations at flat yards: retrieving freight railcars from storage tracks. Or Spectrum 40(2):367\u2013393","journal-title":"Or Spectrum"},{"issue":"5","key":"845_CR12","doi-asserted-by":"publisher","first-page":"1455","DOI":"10.1007\/s00521-018-3396-2","volume":"31","author":"Y Jing","year":"2018","unstructured":"Jing Y, Zhang ZH (2018) A study on car flow organization in the loading end of heavy haul railway based on immune clonal selection algorithm. Neural Comput Appl 31(5):1455\u20131465","journal-title":"Neural Comput Appl"},{"issue":"1","key":"845_CR13","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1080\/23248378.2020.1732235","volume":"9","author":"D Kozachenko","year":"2020","unstructured":"Kozachenko D, Bobrovskiy V, Gera B, Skovron I, Gorbova A (2020) An optimization method of the multi-group train formation at flat yards. Int J Rail Transp 9(1):61\u201378","journal-title":"Int J Rail Transp"},{"issue":"12","key":"845_CR14","doi-asserted-by":"publisher","first-page":"178496","DOI":"10.1109\/ACCESS.2019.2958601","volume":"7","author":"ZK Lan","year":"2019","unstructured":"Lan ZK, He SW, Xu Y, Wang YD (2019) Optimizing train formation problem with car flow routing and train routing by benders-and-price approach. IEEE Access 7(12):178496\u2013178510","journal-title":"IEEE Access"},{"issue":"1","key":"845_CR15","first-page":"59","volume":"15","author":"K Leong","year":"2020","unstructured":"Leong K, Wang C, Abdul-Rahman H, Shavarebi K, Boursier P, Loo SC (2020) Application of decision theory and bee-inspired method to railway system route optimization. Int J Manag Sci Eng Manag 15(1):59\u201369","journal-title":"Int J Manag Sci Eng Manag"},{"key":"845_CR16","first-page":"1","volume":"4","author":"B Li","year":"2020","unstructured":"Li B, Qu WY, Xuan H, Xu CQ, Wang X, Geng YF (2020) Shunting strategy for placing-in and taking-out wagons on branch-shaped freight operation network with simulation method. J Adv Transp 4:1\u201325","journal-title":"J Adv Transp"},{"issue":"5","key":"845_CR17","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1016\/j.apm.2020.12.031","volume":"93","author":"BL Lin","year":"2021","unstructured":"Lin BL, Zhao YN, Lin RX, Liu C (2021) Integrating traffic routing optimization and train formation plan using simulated annealing algorithm. Appl Math Model 93(5):811\u2013830","journal-title":"Appl Math Model"},{"issue":"1","key":"845_CR18","doi-asserted-by":"publisher","first-page":"1241","DOI":"10.1016\/j.cie.2018.03.015","volume":"127","author":"GY Lu","year":"2019","unstructured":"Lu GY, Zhou X, Mahmoudi M, Shi T, Peng QY (2019) Optimizing resource recharging location-routing plans: a resource-space-time network modeling framework for railway locomotive refueling applications. Comput Ind Eng 127(1):1241\u20131258","journal-title":"Comput Ind Eng"},{"issue":"2","key":"845_CR19","doi-asserted-by":"publisher","first-page":"27532","DOI":"10.1109\/ACCESS.2020.2971027","volume":"8","author":"Y Lu","year":"2020","unstructured":"Lu Y, Lang MX, Sun Y, Li S (2020) A fuzzy intercontinental road-rail multimodal routing model with time and train capacity uncertainty and fuzzy programming approaches. IEEE Access 8(2):27532\u201327548","journal-title":"IEEE Access"},{"issue":"2","key":"845_CR20","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1007\/s10479-020-03846-8","volume":"315","author":"AJ Maniamkot","year":"2020","unstructured":"Maniamkot AJ, Kumar P, Krishnamoorthy M, Mokhtar H, Rajagopalan S (2020) Hybridised ant colony optimisation for convoy movement problem. Ann Oper Res 315(2):847\u2013866","journal-title":"Ann Oper Res"},{"issue":"6","key":"845_CR21","first-page":"647","volume":"30","author":"X Meng","year":"2018","unstructured":"Meng X, Jia L, Xiang W (2018) A petri net model of train operation simulation for harmonizing train timetables of neighbor dispatching sections. Promet-Traffic-Traffico 30(6):647\u2013660","journal-title":"Promet-Traffic-Traffico"},{"key":"845_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2023.109658","volume":"185","author":"JT Shi","year":"2023","unstructured":"Shi JT, Li HD (2023) Operational planning of international freight trains considering the dynamic demands and capacities of border ports. Comput Ind Eng 185:109658","journal-title":"Comput Ind Eng"},{"key":"845_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2022.103994","volume":"147","author":"ET Wang","year":"2023","unstructured":"Wang ET, Yang LX, Li PH, Zhang CT, Gao ZY (2023) Joint optimization of train scheduling and routing in a coupled multi-resolution space\u2013time railway network. Trans Res Part C Emerg Technol 147:103994","journal-title":"Trans Res Part C Emerg Technol"},{"issue":"1","key":"845_CR24","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.trc.2017.10.006","volume":"86","author":"J Xiao","year":"2018","unstructured":"Xiao J, Lin BL, Wang JX (2018a) Solving the train formation plan network problem of the one-block train and two-block train using a hybrid algorithm of genetic algorithm and tabu search. Trans Res Part C Emerg Technol 86(1):124\u2013146","journal-title":"Trans Res Part C Emerg Technol"},{"key":"845_CR25","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.trb.2017.12.014","volume":"108","author":"J Xiao","year":"2018","unstructured":"Xiao J, Pachl J, Lin BL, Wang JX (2018b) Solving the block-to-train assignment problem using the heuristic approach based on the genetic algorithm and tabu search. Transp Res Part B Methodol 108:148\u2013171","journal-title":"Transp Res Part B Methodol"},{"issue":"1","key":"845_CR26","doi-asserted-by":"publisher","first-page":"28","DOI":"10.3846\/16484142.2014.894938","volume":"29","author":"M Yaghini","year":"2014","unstructured":"Yaghini M, Nikoo N, Ahadi H (2014) An integer programming model for analyzing impacts of different train types on railway line capacity. Transport 29(1):28\u201335","journal-title":"Transport"},{"key":"845_CR27","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.asoc.2015.02.039","volume":"31","author":"M Yaghini","year":"2015","unstructured":"Yaghini M, Momeni M, Sarmadi M (2015) A hybrid solution method for fuzzy train formation planning. Appl Soft Comput 31:257\u2013265","journal-title":"Appl Soft Comput"},{"key":"845_CR28","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1002\/net.22029","volume":"78","author":"M Yaghini","year":"2021","unstructured":"Yaghini M, Mirghavami M, Andaryan Z (2021) A mathematical formulation and an LP-based neighborhood search matheuristic solution method for the integrated train blocking and shipment path problem. Networks 78:523\u2013542","journal-title":"Networks"},{"issue":"1","key":"845_CR29","doi-asserted-by":"publisher","first-page":"117","DOI":"10.7307\/ptt.v33i1.3601","volume":"33","author":"YJ Yang","year":"2021","unstructured":"Yang YJ, Wu X, Li HN (2021) Collaborative optimization of car-flow organization for freight trains based on adjacent technical stations. Promet-Traffic Transp 33(1):117\u2013128","journal-title":"Promet-Traffic Transp"},{"issue":"6","key":"845_CR30","doi-asserted-by":"publisher","first-page":"75935","DOI":"10.1109\/ACCESS.2019.2921619","volume":"7","author":"YN Zhao","year":"2019","unstructured":"Zhao YN, Lin BL (2019) The multi-shipment train formation optimization problem along the ordered rail stations based on collection delay. IEEE Access 7(6):75935\u201375948","journal-title":"IEEE Access"},{"key":"845_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2022.102713","volume":"162","author":"Y Zu","year":"2022","unstructured":"Zu Y, Heydari R, Chahar K, Pranoto Y, Cheng C (2022) A railcar re-blocking strategy via mixed integer quadratic programming. Transp Res Part E Logist Transp Rev 162:102713","journal-title":"Transp Res Part E Logist Transp Rev"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-024-00845-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-024-00845-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-024-00845-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T04:02:15Z","timestamp":1726200135000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-024-00845-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,2]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["845"],"URL":"https:\/\/doi.org\/10.1007\/s12351-024-00845-6","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,2]]},"assertion":[{"value":"17 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 April 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there are no conflicts of interest regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}],"article-number":"40"}}