A set partitioning approach to shunting

DOI10.1016/J.ENDM.2009.11.059MaRDI QIDQ2840563zbMATH OpenOpenAlexFDO

Authors Carlos Cardonha, Ralf Borndörfer

Publication date 19 July 2013

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2009.11.059

zbMATH Keywords

combinatorial optimizationcolumn generationpublic transportvehicle shunting

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Partitions of sets (05A18) Transportation, logistics and supply chain management (90B06)

Recommendations

• A set partitioning approach to shunting
• An extension of set partitioning with application to scheduling problems
• A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem
• scientific article; zbMATH DE number 1361557
• An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment

Cites work

• scientific article; zbMATH DE number 2196275 (Why is no real title available?)
• An algorithm for the quadratic assignment problem using Benders' decomposition
• Dispatching Buses in Parking Depots
• Real-time dispatch of trams in storage yards

Cited in

(2)

• A set partitioning approach to shunting
• An integrated heuristic and mathematical modelling method to optimize vehicle maintenance schedule under single dead-end track parking and service level agreement

This page was built for publication: A set partitioning approach to shunting

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