A Lagrangian heuristic for a train-unit assignment problem

DOI10.1016/j.dam.2011.10.035zbMath1293.90035OpenAlexW2080834699MaRDI QIDQ2446297

Valentina Cacchiani, Alberto Caprara, Paolo Toth

Publication date: 16 April 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.10.035

zbMATH Keywords

Lagrangian relaxationlocal searchheuristicassignment problemtrain-unit assignment

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items

Local convex hulls for a special class of integer multicommodity flow problems ⋮ An algorithm for self-organization of driverless vehicles of a car-rental service ⋮ A combined column generation and heuristics for railway short-term rolling stock planning with regular inspection constraints ⋮ A tree-based model for setting optimal train fare zones ⋮ Redundant coupling/decoupling in train unit scheduling optimization ⋮ A branch and bound algorithm for the exact solution of the problem of EMU circulation scheduling in railway network

Cites Work

• Unnamed Item
• Routing of railway carriages
• Circulation of railway rolling stock: a branch-and-price approach
• A rolling stock circulation model for combining and splitting of passenger trains
• Solving a real-world train-unit assignment problem
• A Benders Decomposition Approach for the Locomotive and Car Assignment Problem
• Integrating Robust Railway Network Design and Line Planning under Failures
• The traveling-salesman problem and minimum spanning trees: Part II