Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem

DOI10.1007/S13675-013-0012-1MaRDI QIDQ743645zbMATHOpenAlexFDO

Authors Mounira Groiez, Guy Desaulniers, Ahmed Hadjar, Odile Marcotte

Publication date 30 September 2014

Published in EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s13675-013-0012-1

zbMATH Keywords

branch-and-cut algorithmmulticommodity flowtransportation scheduling

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Recommendations

• A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
• scientific article; zbMATH DE number 1361558
• A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem
• A branch and bound algorithm for the multiple depot vehicle scheduling problem
• Simple and efficient heuristic approach for the multiple-depot vehicle scheduling problem

Cites work

• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3496213 (Why is no real title available?)
• scientific article; zbMATH DE number 956787 (Why is no real title available?)
• A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
• A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem
• A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems
• A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
• A branch and bound algorithm for the multiple depot vehicle scheduling problem
• A comparison of five heuristics for the multiple depot vehicle scheduling problem
• A time-space network based exact optimization model for multi-depot bus scheduling
• Benchmarking optimization software with performance profiles.
• Odd Minimum Cut-Sets and b-Matchings
• On some matching problems arising in vehicle scheduling models
• Path-reduced costs for eliminating arcs in routing and scheduling
• Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice
• Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems
• Vehicle scheduling in public transit and Lagrangean pricing

Cited in

(4)

• Valid Inequalities and Separation Algorithms for the Set Partitioning Problem
• A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
• Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models
• Modeling and solving the multimodal car- and ride-sharing problem

Describes a project that uses

Uses Software

• MCF

This page was built for publication: Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem

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