The basic train makeup problem in shunting yards

DOI10.1007/S00291-015-0412-0MaRDI QIDQ5964852zbMATH OpenOpenAlexFDO

Authors Nils Boysen, Simon Emde, Malte Fliedner

Publication date 1 March 2016

Published in OR Spectrum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00291-015-0412-0

zbMATH Keywords

railcar classificationrailway optimizationshunting yardtrain makeup

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An integrated dispatching model for rail yards operations.
• Minimizing delays in a shunting yard
• Shunting minimal rail car allocation
• Online train shunting
• How to park freight trains on rail-rail transshipment yards: the train location problem

Cites work

• A graph theoretical approach to the shunting problem
• A new approach to the maximum-flow problem
• An integrated dispatching model for rail yards operations.
• Approximation and Online Algorithms
• Approximation schemes for packing with item fragmentation
• Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs
• Fuzzy dispatching model and genetic algorithms for railyards operations
• scientific article; zbMATH DE number 1830744 (Why is no real title available?)
• Multistage methods for freight train classification
• Shunting for Dummies: An Introductory Algorithmic Survey
• Shunting minimal rail car allocation
• The multidimensional 0-1 knapsack problem: an overview.
• The multidimensional knapsack problem: structure and algorithms
• The train marshalling problem

Cited in

(10)

• An integrated dispatching model for rail yards operations.
• The train marshalling problem
• Shunting operations at flat yards: retrieving freight railcars from storage tracks
• Minimizing delays in a shunting yard
• The single train shortest route problem in a railyard
• Adapting exact and heuristic procedures in solving an NP-hard sequencing problem
• 04. Solution of the train platforming problem
• Solving sorting of rolling stock problems utilizing pseudochain structures in graphs
• A note on ``Multistage methods for freight train classification
• Shunting minimal rail car allocation

This page was built for publication: The basic train makeup problem in shunting yards

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5964852)