Abstract
This work is concerned with the vehicle scheduling problem with multiple type of vehicles, which consists on the scheduling of a set of trips so as to establish the individual services of vehicles that operate in a certain area. One e it is known both the set of trips to be undertaken and the types of vehicles adequated to each trip, we wish to determine the chains (a sequence of trips) for the vehicles, while minimizing all the operational costs involved. Every vehicle leaving the considered depot must return back to that depot, and there exists a limited number of vehicles of each type. The path assigned to each vehicle can only include trips which can be carried out by that type of vehicle. We present three different folmulations for this problem. For the purpose of obtaining lower bounds on the optimal value of the problem we studied the linear relaxation for two of the formulations and the lagrangean relaxation for the remaining one. We also considered a heuristic technique in order to produce a upper bound on the optimal value of the problem. In the end we present the accomplished computational experience.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bárcia, P. (1985): Métodos de Reforço do Dual em Programaçao Inteira. Tese de Doutoramento, Institute Superior Técnico
Bodin, L. / Golden, B. / Assad, A. /Ball, M. (1981): The state of the art in the routing and scheduling of vehicles and crews. Working paper MS/S 81-035
Bertossi, A. / Carraresi, P. / Gallo, G. (1987): On some matching problems arising in vehicle sheduling. in: Networks 17, 271–281
Branco, I. (1989): Algoritmos para Modelos Matemáticos de Quasi-Afectação e Extensões. Tese de Doutoramento, Faculdade de Ciências — Universidade de Lisboa
Ceder, A. (1993): Minimum cost vehicle scheduling with different types of transit vehicles. Paper presented at the Sixth International Workshop on Computer-Aided Scheduling of Public Transport
Costa, A. (1993): O Problema de Escalonamento de Viaturas com Diferentes Tipos de Vefculos. Tese de Mestrado, Faculdade de Ciências — Universidade de Lisboa
Gavish, B. / Schweitzer, P. / Shlifer, E. (1978): Assigning buses to schedules in a metropolitan area. in: Computers &Operations Research 5, 129–138
Geofrion, A. (1974): Lagrangean relaxation for integer programming. in: Mathematical Programming Study 2, 82–114
Held, M. / Wolf, P. / Crowder, H.(1974): Validation of sugradinet optimizatioa in: Mathematical Programming 6, 62–68
Mesquita, M. (1989): Escalonamento de Viaturas com Multi — depósitos. Tese de Mestrado, Faculdade de Ciências — Universidade de Lisboa
Minoux, M. (1986): Mathematical programming theory and algorithms. (John Wiley) New York
Paixão J. / Branco, I. (1988): Bus scheduling with a fixed number of vehicles. in: Daduna J.R. / Wren, A., (eds.): Computer-Aided Transit Scheduling. (Springer) Berlin, Heidelberg, New York, London, Tokyo, Paris, 28–40
Paixao J. / Branco, I. (1987): A quasi-assignment algorithm for bus scheduling. in: Networks 17, 249–269
Ribeiro, C. C. / Soumis F. (1991): A column generation aproach to the multiple-depot vehicle scheduling problem. Les Cahiers du GERAD, G-91-32
Syslo, M. M. / Deo, N. / Kowalik, S. J. (1983): Discrete optimization algoritms with Pascal programs. (Prentice-Hall) Englewood Cliffs
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Costa, A., Branco, I., Pinto Paixão, J.M. (1995). Vehicle Scheduling Problem with Multiple Type of Vehicles and a Single Depot. In: Daduna, J.R., Branco, I., Paixão, J.M.P. (eds) Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical Systems, vol 430. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-57762-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-57762-8_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60193-7
Online ISBN: 978-3-642-57762-8
eBook Packages: Springer Book Archive