Shunting minimal rail car allocation

DOI10.1007/S10589-005-3229-YzbMATH Open1081.90043OpenAlexW2017127471MaRDI QIDQ812422FDOQ812422

Authors: Marco E. Lübbecke, Uwe T. Zimmermann 

Publication date: 23 January 2006

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://depositonce.tu-berlin.de/handle/11303/15543

Recommendations

• Shunting operations at flat yards: retrieving freight railcars from storage tracks
• The basic train makeup problem in shunting yards
• An integrated dispatching model for rail yards operations.
• scientific article; zbMATH DE number 3847190
• Solving railway track allocation problems

zbMATH Keywords

decompositionMixed integer programmingrail transportshunting minimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Real-time dispatch of trams in storage yards
• Combinatorial optimization. Networks and matroids
• The train marshalling problem
• Improved empty freight car distribution
• Constructing railroad blocking plans to minimize handling costs
• Application of optimization techniques to the railroad empty car distribution process: A survey
• A model for the optimal programming of railway freight train movements
• A tactical decision support system for empty railcar management
• An Optimization Approach to Freight Car Allocation Under Time-Mileage Per Diem Rental Rates

Cited In (2)

• Shunting operations at flat yards: retrieving freight railcars from storage tracks
• The basic train makeup problem in shunting yards

This page was built for publication: Shunting minimal rail car allocation

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