Models and Algorithms for Single-Depot Vehicle Scheduling
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 area 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.
|Keywords||algorithms, mathematical models, operating costs, operations research, production scheduling, terminals (transportation), transportation, vehicles|
Freling, R., Pinto Paixão, J.M., & Wagelmans, A.P.M.. (2001). Models and Algorithms for Single-Depot Vehicle Scheduling. Transportation Science, 165–180. Retrieved from http://hdl.handle.net/1765/2318