Integrated freight car routing and train scheduling

Sarah Frisch (), Philipp Hungerländer (), Anna Jellen (), Manuel Lackenbucher (), Bernhard Primas () and Sebastian Steininger ()
Additional contact information
Sarah Frisch: Universität Klagenfurt
Philipp Hungerländer: Universität Klagenfurt
Anna Jellen: Universität Klagenfurt
Manuel Lackenbucher: Universität Klagenfurt
Bernhard Primas: Universität Klagenfurt
Sebastian Steininger: Universität Klagenfurt

Central European Journal of Operations Research, 2023, vol. 31, issue 2, No 3, 417-443

Abstract: Abstract 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 (SCRP), and (ii) deciding on time schedules for trains by solving the freight train scheduling problem (FTSP). Since train departure and arrival times, as well as freight car routes are highly interdependent, one aims to solve the SCRP and the FTSP 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 SCRP and FTSP 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’s (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.

Keywords: Freight car routing; Train scheduling; Routing matrix; Integer linear programming (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10100-022-00815-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:cejnor:v:31:y:2023:i:2:d:10.1007_s10100-022-00815-3

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10100

DOI: 10.1007/s10100-022-00815-3

Access Statistics for this article

Central European Journal of Operations Research is currently edited by Ulrike Leopold-Wildburger

More articles in Central European Journal of Operations Research from Springer, Slovak Society for Operations Research, Hungarian Operational Research Society, Czech Society for Operations Research, Österr. Gesellschaft für Operations Research (ÖGOR), Slovenian Society Informatika - Section for Operational Research, Croatian Operational Research Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().