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

Authors:
Ahmed Hadjar;Odile Marcotte;Franois Soumis
Affiliations:
Dpartement de mathmatiques et gnie industriel, cole Polytechnique de Montral, C.P. 6079, succursale Centre-ville, Montral, Qubec, Canada H3C 3A7;Dpartement dinformatique, Universit du Qubec Montral, C.P. 8888, succursale Centre-ville, Montral, Qubec, Canada H3C 3P8;Dpartement de mathmatiques et gnie industriel, cole Polytechnique de Montral, C.P. 6079, succursale Centre-ville, Montral, Qubec, Canada H3C 3A7
Venue:
Operations Research
Year:
2006

Citing 4
Cited 9

Integer and combinatorial optimization

Integer and combinatorial optimization
Vehicle scheduling in public transit and Lagrangean pricing

Management Science
2-Path Cuts for the Vehicle Routing Problem with Time Windows

Transportation Science
A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems

Management Science

A proximal trust-region algorithm for column generation stabilization

Computers and Operations Research
Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows

Computers and Operations Research
A comparison of five heuristics for the multiple depot vehicle scheduling problem

Journal of Scheduling
On the choice of explicit stabilizing terms in column generation

Discrete Applied Mathematics
A Column Generation Algorithm for a Rich Vehicle-Routing Problem

Transportation Science
Iterated local search for the multiple depot vehicle scheduling problem

Computers and Industrial Engineering
Constrained local search method for bus fleet scheduling problem with multi-depot with line change

Evo'08 Proceedings of the 2008 conference on Applications of evolutionary computing
Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling

INFORMS Journal on Computing
Transit network timetabling and vehicle assignment for regulating authorities

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the multiple depot vehicle scheduling problem (MDVSP) and propose a branch-and-bound algorithm for solving it that combines column generation, variable fixing, and cutting planes. We show that the solutions of the linear relaxation of the MDVSP contain many odd cycles. We derive a class of valid inequalities by extending the notion of odd cycle and describe a lifting procedure for these inequalities. We prove that the lifted inequalities represent, under certain conditions, facets of the underlying polytope. Finally, we present the results of a computational study comparing several strategies (variable fixing, cutting planes, mixed branching, and tree search) for solving the MDVSP.