论文信息 - A branch and bound algorithm for the multiple depot vehicle scheduling problem

A branch and bound algorithm for the multiple depot vehicle scheduling problem

This article describes analyses carried out to solve the scheduling problem for freight vehicles assigned to various different depots. The vehicle scheduling problem concerns the assigning of a set of time-tabled trips to vehicles so as to minimize a given cost function. We 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.

[1] Giorgio Gallo,et al. Network models for vehicle and crew scheduling , 1984 .

[2] Samuel J. Raff,et al. Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..

[3] Giovanni Rinaldi,et al. A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[4] Alan A. Bertossi,et al. On some matching problems arising in vehicle scheduling models , 1987, Networks.

[5] Lawrence Bodin,et al. Classification in vehicle routing and scheduling , 1981, Networks.

[6] P. Toth,et al. Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem , 1980 .

[7] A Wren,et al. A GENERAL REVIEW OF THE USE OF COMPUTERS IN SCHEDULING BUSES AND THEIR CREWS , 1980 .

[8] Matteo Fischetti,et al. A new dominance procedure for combinatorial optimization problems , 1988 .