{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T06:36:36Z","timestamp":1714199796324},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T00:00:00Z","timestamp":1664323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T00:00:00Z","timestamp":1664323200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100008905","name":"University of Klagenfurt","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100008905","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2023,6]]},"abstract":"Abstract<\/jats:title>Rail freight transportation is involved with highly complex logistical processes and requires a lot of resources such as locomotives or wagons. Thus, cost-efficient strategies for routing freight cars in a cargo network are of great interest for railway companies. When it comes to single wagon load traffic, trains are usually formed by collecting individual freight cars into batches at shunting yards, in order to transport them jointly to their destinations. The problem of finding optimal routes and schedules for single freight cars is typically solved in two steps: (i) determining routes for the freight cars in the railway network by solving the Single-freight car routing problem (), and (ii) deciding on time schedules for trains by solving the freight train scheduling problem (). Since train departure and arrival times, as well as freight car routes are highly interdependent, one aims to solve the and the simultaneously. For smooth and convenient operational processes many railway companies apply the concept of a routing matrix. This matrix defines unique routes between all shunting yards that are used for all shipments. In this work, we present an integrated mathematical model based on time discretization, that jointly solves the and and enforces the routing matrix concept. To the best of our knowledge, this is the first work that combines all three aspects. The approach is tailored for Rail Cargo Austria\u2019s (RCA) needs, incorporating train capacities, yard capacities, and restrictions regarding travel times. We perform an extensive computational study based on real-world data provided by RCA. Besides the performance we analyze the utilization of trains, waiting times of freight cars, and the number of shunting processes.<\/jats:p>","DOI":"10.1007\/s10100-022-00815-3","type":"journal-article","created":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T11:03:52Z","timestamp":1664363032000},"page":"417-443","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Integrated freight car routing and train scheduling"],"prefix":"10.1007","volume":"31","author":[{"given":"Sarah","family":"Frisch","sequence":"first","affiliation":[]},{"given":"Philipp","family":"Hungerl\u00e4nder","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Jellen","sequence":"additional","affiliation":[]},{"given":"Manuel","family":"Lackenbucher","sequence":"additional","affiliation":[]},{"given":"Bernhard","family":"Primas","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-9733-6309","authenticated-orcid":false,"given":"Sebastian","family":"Steininger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,28]]},"reference":[{"issue":"5","key":"815_CR1","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1287\/inte.1070.0295","volume":"37","author":"RK Ahuja","year":"2007","unstructured":"Ahuja RK, Jha KC, Liu J (2007) Solving real-life railroad blocking problems. Interfaces 37(5):404\u2013419","journal-title":"Interfaces"},{"issue":"1\u20132","key":"815_CR2","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0191-2615(80)90036-3","volume":"14","author":"AA Assad","year":"1980","unstructured":"Assad AA (1980) Modelling of rail networks: toward a routing\/makeup model. Transp Res Part B: Methodol 14(1\u20132):101\u2013114","journal-title":"Transp Res Part B: Methodol"},{"issue":"4","key":"815_CR3","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1287\/opre.48.4.603.12416","volume":"48","author":"C Barnhart","year":"2000","unstructured":"Barnhart C, Jin H, Vance PH (2000) Railroad blocking: a network design application. Oper Res 48(4):603\u2013614","journal-title":"Oper Res"},{"issue":"1\u20132","key":"815_CR4","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0191-2615(80)90037-5","volume":"14","author":"LD Bodin","year":"1980","unstructured":"Bodin LD, Golden BL, Schuster AD, Romig W (1980) A model for the blocking of trains. Transp Res Part B: Methodol 14(1\u20132):115\u2013120","journal-title":"Transp Res Part B: Methodol"},{"issue":"4","key":"815_CR5","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1287\/trsc.1080.0246","volume":"42","author":"A Ceselli","year":"2008","unstructured":"Ceselli A, Gatto M, L\u00fcbbecke ME, Nunkesser M, Schilling H (2008) Optimizing the cargo express service of swiss federal railways. Transp Sci 42(4):450\u2013465","journal-title":"Transp Sci"},{"issue":"3","key":"815_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s12544-013-0090-4","volume":"5","author":"U Clausen","year":"2013","unstructured":"Clausen U, Voll R (2013) A comparison of North American and European railway systems. Eur Transp Res Rev 5(3):129\u2013133","journal-title":"Eur Transp Res Rev"},{"issue":"4","key":"815_CR7","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1287\/trsc.32.4.380","volume":"32","author":"JF Cordeau","year":"1998","unstructured":"Cordeau JF, Toth P, Vigo D (1998) A survey of optimization models for train routing and scheduling. Transp Sci 32(4):380\u2013404","journal-title":"Transp Sci"},{"issue":"2","key":"815_CR8","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1287\/trsc.18.2.165","volume":"18","author":"T Crainic","year":"1984","unstructured":"Crainic T, Ferland JA, Rousseau JM (1984) A tactical planning model for rail freight transportation. Transp Sci 18(2):165\u2013184","journal-title":"Transp Sci"},{"issue":"1","key":"815_CR9","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1287\/trsc.2013.0486","volume":"49","author":"A F\u00fcgenschuh","year":"2013","unstructured":"F\u00fcgenschuh A, Homfeld H, Sch\u00fclldorf H (2013) Single-car routing in rail freight transport. Transp Sci 49(1):130\u2013148","journal-title":"Transp Sci"},{"key":"815_CR10","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1023\/A:1018906301828","volume":"78","author":"MF Gorman","year":"1998","unstructured":"Gorman MF (1998) An application of genetic and tabu searches to the freight railroad operating plan problem. Ann Oper Res 78:51\u201369","journal-title":"Ann Oper Res"},{"issue":"3","key":"815_CR11","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/inte.25.3.58","volume":"25","author":"CL Huntley","year":"1995","unstructured":"Huntley CL, Brown DE, Sappington DE, Markowicz BP (1995) Freight routing and scheduling at csx transportation. Interfaces 25(3):58\u201371","journal-title":"Interfaces"},{"issue":"6","key":"815_CR12","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/0191-2615(89)90042-8","volume":"23","author":"MH Keaton","year":"1989","unstructured":"Keaton MH (1989) Designing optimal railroad operating plans: Lagrangian relaxation and heuristic approaches. Transp Res Part B: Methodol 23(6):415\u2013431","journal-title":"Transp Res Part B: Methodol"},{"issue":"4","key":"815_CR13","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1287\/trsc.32.4.330","volume":"32","author":"HN Newton","year":"1998","unstructured":"Newton HN, Barnhart C, Vance PH (1998) Constructing railroad blocking plans to minimize handling costs. Transp Sci 32(4):330\u2013345","journal-title":"Transp Sci"},{"key":"815_CR14","unstructured":"OEBB (2020) Die oebb in zahlen 2020\/2021. https:\/\/konzern.oebb.at\/dam\/jcr:8ec7b268-630d-40f2-bbd0-38b5d7531d84\/OEBB_Zahlen_2021-1_web.pdf. Accessed: 29 June 2021"},{"issue":"1","key":"815_CR15","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1186\/2251-712X-8-8","volume":"8","author":"M Yaghini","year":"2012","unstructured":"Yaghini M, Seyedabadi M, Khoshraftar MM (2012) A population-based algorithm for the railroad blocking problem. J Ind Eng Int 8(1):8","journal-title":"J Ind Eng Int"},{"key":"815_CR16","unstructured":"Zhu E, Crainic TG, Gendreau M (2009) Integrated service network design for rail freight transportation. CIRRELT"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-022-00815-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10100-022-00815-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-022-00815-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,21]],"date-time":"2023-03-21T09:24:49Z","timestamp":1679390689000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10100-022-00815-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,28]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["815"],"URL":"https:\/\/doi.org\/10.1007\/s10100-022-00815-3","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,28]]},"assertion":[{"value":"29 July 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}