Operation of shunting yards: train-to-yard assignment problem
Alena Otto () and
Erwin Pesch
Additional contact information
Alena Otto: University of Siegen
Erwin Pesch: University of Siegen
Journal of Business Economics, 2017, vol. 87, issue 4, No 2, 465-486
Abstract:
Abstract A multiple shunting yard as a major freight rail yard consists of several sub-yards of limited capacities. Our research question is how to assign the railcars of inbound trains among the sub-yards such that the number of re-assignments is minimized. We denote this problem as train-to-yard assignment problem (TYAP) and prove its strong NP-hardness. Moreover, our computational experiments show that the lower bounds of IBM ILOG CPLEX are poor and not competitive to our lower bounds that can be computed in a fraction of a second. Because of their low computational complexity, our lower bounds can be repeatedly calculated in any enumeration algorithm such as branch and bound or bounded dynamic programming without contributing substantially to the overall runtime.
Keywords: Multiple yards; Shunting yard; Freight transportation; Graph partitioning problem (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://link.springer.com/10.1007/s11573-016-0827-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:jbecon:v:87:y:2017:i:4:d:10.1007_s11573-016-0827-3
Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11573
DOI: 10.1007/s11573-016-0827-3
Access Statistics for this article
Journal of Business Economics is currently edited by Günter Fandel
More articles in Journal of Business Economics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().