论文信息 - Vehicle Scheduling with Time Constraint

Vehicle Scheduling with Time Constraint

We present methods for solving the vehicle scheduling problem with time constraint. Such problem consists of minimizing the costs related to the assignment of vehicles for performing a set of short trips. The vehicles are located at a single depot and one must consider the additional constraint that no vehicle can be away from the depot longer than a maximum time period. For two integer programming models we consider the corresponding Linear Programming and Lagrangean relaxations. The mathematical programming approach as well as a heuristic approach are tested on real-life problems.

Richard Freling | José M. P. Paixão | J. Paixão | R. Freling

[1] Celso C. Ribeiro,et al. A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem , 1991, Oper. Res..

[2] Martin Desrochers,et al. Computer-Aided Transit Scheduling , 1992 .

[3] L. Bodin. ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .

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

[5] José Pinto Paixão,et al. A quasi-assignment algorithm for bus scheduling , 1987, Networks.

[6] J. Paixão,et al. BUS SCHEDULING WITH A FIXED NUMBER OF VEHICLES. FROM THE BOOK COMPUTER-AIDED TRANSIT SCHEDULING , 1988 .

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

[8] José M. P. Paixão,et al. Multiple Depot Vehicle Scheduling Problem: A New Heuristic Based on Quasi-Assignment Algorithms , 1992 .