The vehicle scheduling problem concerns the assigning of a set of time-tabled trips to vehicles so as to minimize a given cost function. The authors consider the NP-hard multiple depot case in which, in addition, one has to assign vehicles to depots. Different lower bounds based on assignment relaxation and on connectivity constraints are presented and combined in an effective bounding procedure. A strong dominance procedure derived from new dominance criteria is also described. A branch and bound algorithm is finally proposed. Computational results are given.
A branch and bound algorithm for the multiple depot vehicle scheduling problem
Ein Verzweigungsalgorithmus fuer das Zeitplanproblem von Depotfahrzeugen
Networks ; 19 , 5 ; 531-548
1989
18 Seiten, 11 Quellen
Article (Journal)
English
Multiple-Depot Integrated Vehicle and Crew Scheduling
British Library Online Contents | 2005
|Optimizing Single-Depot Vehicle Scheduling Problem: Fixed-Interval Model and Algorithm
Taylor & Francis Verlag | 2015
|Multiple-Depot Integrated Vehicle and Crew Scheduling
Online Contents | 2005
|British Library Online Contents | 1997
|