Models and Algorithms for Integration of Vehicle and Crew Scheduling
Journal of Scheduling
A Robust Solution Approach to the Dynamic Vehicle Scheduling Problem
Transportation Science
A comparison of five heuristics for the multiple depot vehicle scheduling problem
Journal of Scheduling
Iterated local search for the multiple depot vehicle scheduling problem
Computers and Industrial Engineering
Transit network timetabling and vehicle assignment for regulating authorities
Computers and Industrial Engineering
Improving timetable quality in scheduled transit networks
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part I
Hi-index | 0.00 |
Vehicle scheduling is the process of assigning vehicles to a set of predetermined trips with fixed starting and ending times, while minimizing capital and operating costs. This paper considers modeling, algorithmic, and computational aspects of the polynomially solvable case in which there is a single depot and vehicles are identical. A quasiassignment formulation is reviewed and an alternative asymmetric assignment formulation is given. The main contributions of the paper are a new two-phase approach which is valid in the case of a special cost structure, an auction algorithm for the quasiassignment problem, a core-oriented approach, and an extensive computational study. New algorithms are compared with the most successful algorithms for the vehicle-scheduling problem, using both randomly generated and real-life data. The new algorithms show a significant performance improvement with respect to computation time. Such improvement can, for example, be very important when this particular vehicle-scheduling problem appears as a subproblem in more complex vehicle- and crew-scheduling problems.