Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows

Authors:
Ahmed Hadjar;François Soumis
Affiliations:
Kronos Canadian Systems Inc., 3535 Queen Mary Road, Suite 650, Montréal, Canada H3V 1H8;ícole Polytechnique de Montréal and GERAD, C.P. 6079, succ. Centre-ville, Montréal, Canada H3C 3A7
Venue:
Computers and Operations Research
Year:
2009

Citing 4
Cited 2

Vehicle scheduling in public transit and Lagrangean pricing

Management Science
A Set Partitioning Approach to the Crew Scheduling Problem

Operations Research
A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems

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

Operations Research

A distribution network optimization problem for third party logistics service providers

Expert Systems with Applications: An International Journal
Integrated planning of loaded and empty container movements

OR Spectrum

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider a widespread branch-and-price approach to solve the multiple depot vehicle scheduling problem with time windows. We describe a dynamic time window reduction technique to speed up this approach. The time windows are transferred from nodes to arcs in order to take advantage of dual information and to tighten as much as possible the time variable domains. The performance of the proposed technique is evaluated through computational experiments on randomly generated instances involving several depots and up to 900 tasks.