Solving a real-world train-unit assignment problem

DOI10.1007/S10107-010-0361-YzbMath1198.90049OpenAlexW1974474863MaRDI QIDQ2638371

Alberto Caprara, Valentina Cacchiani, Paolo Toth

Publication date: 16 September 2010

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2007/1172/

zbMATH Keywords

column generationreal-world applicationknapsack polytopetrain unit assignment

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Related Items (9)

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 ⋮ Application of multiple-population genetic algorithm in optimizing the train-set circulation plan problem ⋮ Avoiding unnecessary demerging and remerging of multi‐commodity integer flows ⋮ A tree-based model for setting optimal train fare zones ⋮ A Lagrangian heuristic for a train-unit assignment problem ⋮ 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 ⋮ Integrated optimization of train formation plan and rolling stock scheduling under time-dependent demand

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geometric algorithms and combinatorial optimization
• Discrete optimization in public rail transport
• Routing of railway carriages
• On integer polytopes with few nonzero vertices
• Circulation of railway rolling stock: a branch-and-price approach
• A rolling stock circulation model for combining and splitting of passenger trains
• A Survey of Optimization Models for Train Routing and Scheduling
• A Benders Decomposition Approach for the Locomotive and Car Assignment Problem
• A Branch-First, Cut-Second Approach for Locomotive Assignment
• A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
• Simultaneous Assignment of Locomotives and Cars to Passenger Trains
• A branch and bound algorithm for the multiple depot vehicle scheduling problem
• Operations Research in passenger railway transportation
• Exploring the complexity boundary between coloring and list-coloring

This page was built for publication: Solving a real-world train-unit assignment problem