A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem

DOI10.1287/OPRE.1050.0240zbMATH Open1167.90509OpenAlexW2098400882MaRDI QIDQ3391966FDOQ3391966

Authors: Ahmed Hadjar, Odile Marcotte, François Soumis

Publication date: 13 August 2009

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.1050.0240

Recommendations

Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem
A branch and bound algorithm for the multiple depot vehicle scheduling problem
A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem
A branch-and-cut algorithm for vehicle routing problems
scientific article; zbMATH DE number 1361557

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Cited In (29)

Title not available (Why is that?)
Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems
An exact approach for the multi-depot electric bus scheduling problem with time windows
A proximal trust-region algorithm for column generation stabilization
Scheduling the vehicles of bus rapid transit systems: a case study
A branch and bound algorithm for the multiple depot vehicle scheduling problem
Solution approaches for integrated vehicle and crew scheduling with electric buses
Avoiding redundant columns by adding classical Benders cuts to column generation subproblems
Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network
A school bus scheduling problem
Electric bus planning \& scheduling: a review of related problems and methodologies
Asymmetric multidepot vehicle routing problems: valid inequalities and a branch-and-cut algorithm
Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem
Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem
New exact techniques applied to a class of network flow formulations
Simple and efficient heuristic approach for the multiple-depot vehicle scheduling problem
A comparison of five heuristics for the multiple depot vehicle scheduling problem
A dual ascent procedure for the set partitioning problem
Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows
On the choice of explicit stabilizing terms in column generation
A branch-price-and-cut algorithm for the min-max \(k\)-vehicle windy rural postman problem
Exact solution of network flow models with strong relaxations
Multiple depot ring star problem: a polyhedral study and an exact algorithm
Stabilized dynamic constraint aggregation for solving set partitioning problems
Branch-and-price based heuristic algorithm for fuzzy multi-depot bus scheduling problem
Modeling and solving the multimodal car- and ride-sharing problem
Solving a real-world train-unit assignment problem
Variable fixing heuristics for solving multiple depot vehicle scheduling problem with heterogeneous fleet and time windows
Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models

Uses Software

This page was built for publication: A Branch-and-Cut Algorithm 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 Q3391966)