Journal Article10.1007/S11573-016-0827-3
Operation of shunting yards: train-to-yard assignment problem
Alena Otto,Erwin Pesch +1 more
5
TL;DR: This work denotes this problem as train-to-yard assignment problem (TYAP) and proves its strong NP-hardness, and shows that the lower bounds of IBM ILOG CPLEX are poor and not competitive to their lower bounds that can be computed in a fraction of a second.
read more
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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Shunting of trains in succeeding yards
Florian Jaehn,Steffen Michaelis +1 more
TL;DR: It is shown that this problem arising in international rail freight transport is NP-hard and various mixed integer programming models are presented and implemented in CPLEX and a heuristic solution algorithm is suggested.
15
Conflict-free railway track assignment at depots
Brady Gilg,Torsten Klug,Rosemarie Martienssen,Joseph Paat,Thomas Schlechte,Christof Schulz,Senan Seymen,Alexander Tesch +7 more
TL;DR: The TAP is NP-hard and two integer programming models for solving it are presented and it is shown that they perform well on real timetables and are extended by stochastic and robust modeling techniques.
10
The train-to-yard assignment problem
Alena Otto,Erwin Pesch +1 more
TL;DR: Effective optimization approaches for the TYAP may reduce the number of avoidable railcar reassignments, which are resource-blocking, traffic-generating, and expensive, by about 20% compared to current practice, as illustrated in the computational experiments.
1
•Journal Article
Approximability of the Minimum Bisection problem: An algorithmic challenge
TL;DR: In this paper, the authors survey some recent results on the complexity of computing approximate solutions for instances of the minimum bisection problem and formulate some very intriguing and still open questions about the approximability status of that problem.
1
A rolling horizon approach for shunting operations - an emission oriented simulation study
Max Zien,Thomas Kirschstein +1 more
TL;DR: In this paper , the effects of practically relevant sorting strategies on green house gas emissions are studied in a rolling horizon model and the results indicate that for different parameter constellations, different emission-optimal sorting strategies exist.
References
Combinatorial Optimization Networks And Matroids
Nicole Fassbinder
- 01 Jan 2016
TL;DR: The combinatorial optimization networks and matroids is universally compatible with any devices to read and is available in the digital library an online access to it is set as public so you can download it instantly.
337
Models for rail transportation
TL;DR: In this paper, the authors report on the existing literature models for rail transportation with two goals in mind: (a) to collect and categorize rail modelling efforts, and (b) to position the rail-related literature in the context of other transportation models and provide an introduction to this field for nonspecialists.
331
Robust and Online Large-Scale Optimization
TL;DR: This work discusses the concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications, as well as meta-heuristic and Constraint-Based Approaches for Single-Line Railway Timetabling and Route Planning.
314
A Polynomial Algorithm for the k-cut Problem for Fixed k
TL;DR: A polynomial algorithm for k fixed, that runs in Onki¾²/2-3k/2+4Tn, m steps, where Tn,m is the running time required to find the minimum s, t-cut on a graph with n vertices and m edges.
288
Multicommodity, multimode freight transportation: A general modeling and algorithmic framework for the service network design problem
TL;DR: A general modeling framework, based on a network optimization model, is presented, which may be used to assist and enhance the tactical and strategic planning process for such a system.
259