Solving a real-world train-unit assignment problem

DOI10.1007/S10107-010-0361-YMaRDI QIDQ2638371zbMATH OpenOpenAlexFDO

Authors Valentina Cacchiani, Alberto Caprara, 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 generationknapsack polytopereal-world applicationtrain unit assignment

Mathematics Subject Classification ID

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

Recommendations

• Solving a real-world train unit assignment problem
• Models and algorithms for the train unit assignment problem
• A Lagrangian heuristic for a train-unit assignment problem
• scientific article; zbMATH DE number 2081007
• The off-line group seat reservation problem

Cites work

• A Benders decomposition approach for the locomotive and car assignment problem
• A branch and bound algorithm for the multiple depot vehicle scheduling problem
• A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
• A branch-first, cut-second approach for locomotive assignment
• A rolling stock circulation model for combining and splitting of passenger trains
• A survey of optimization models for train routing and scheduling
• Circulation of railway rolling stock: a branch-and-price approach
• Discrete optimization in public rail transport
• Exploring the complexity boundary between coloring and list-coloring
• Geometric algorithms and combinatorial optimization
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 508830 (Why is no real title available?)
• scientific article; zbMATH DE number 956787 (Why is no real title available?)
• On integer polytopes with few nonzero vertices
• Operations Research in passenger railway transportation
• Routing of railway carriages
• Simultaneous Assignment of Locomotives and Cars to Passenger Trains

Cited in

(17)

• Application of multiple-population genetic algorithm in optimizing the train-set circulation plan problem
• Optimization methods for the train unit shunting problem
• 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
• Integrated optimization of train formation plan and rolling stock scheduling under time-dependent demand
• The problem of trains formation and scheduling: integer statements
• A Lagrangian heuristic for a train-unit assignment problem
• The Train Delivery Problem Revisited
• 04. Solution of the train platforming problem
• Solving a real-world train unit assignment problem
• Local convex hulls for a special class of integer multicommodity flow problems
• Models and algorithms for the train unit assignment problem
• An algorithm for self-organization of driverless vehicles of a car-rental service
• Avoiding unnecessary demerging and remerging of multi‐commodity integer flows
• Freight railcar-to-train assignment and departure scheduling in a railyard
• Decision support algorithms for short-term preventive maintenance planning of rolling stock

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

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