Abstract
Scheduling of vehicles and crews, traditionally performed sequentially by scheduling vehicles prior to crews, has to be carried out simultaneously in particular settings such as the ex-urban mass transit, where crews are tightly dependent on vehicles’ activity or crews’ dead-headings are highly constrained. In this paper we propose an integrated approach to vehicle and crew scheduling which exploits the network structure of the problem. A heuristic method based on Lagrangean relaxation is presented, which determines a set of pieces of work suitable for both vehicle activities as well as for crew duties. Crew duties are fixed step by step, while vehicles are scheduled once all the trips have been partitioned into pieces. Extended use is made of Bundle methods for polyhedral functions and algorithms for constrained shortest paths and assignment within a dual greedy heuristic procedure for the set partitioning problem. Computational results are provided for Italian public transit operators, which show some improvements over the results of the sequential approach.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Beasley, J.E. (1990): A Lagrangean heuristic for Set Covering problems. in: Naval Research Logistics 37, 151 – 164
Balash, E./Carrera, M.C. (1996): A dynamic subgradient based branch and bound procedure for set covering. in: Operations Research 44 (6), 875 – 890
Balash, E./Ho A. (1980): Set Covering algorithms using cutting planes, heuristics and subgradient optimization: a computational study. In: Mathematical Programming 12, 37 – 60
Ball, M./Bodin, L./Dial, R. (1983): A matching based heuristic for scheduling mass transit crews and vehicles. in: Transportation Science 17, 4 – 13
Bertossi, B./Carraresi, P./Gallo, G. (1987): On some matching problems arising in vehicle scheduling models. in: Networks 17, 271 – 281
Caprara, A./Fischetti, M./Toth, P. (1997): A heuristic procedure for the Set Covering problem. in: Operation Research 45
Carraresi, P./Frangioni A./Nonato, M. (1995): Applying bundle methods to the optimization of polyhedral functions: an application-oriented development. in: Ricerca Operativa 25 (74): 4 – 49
Carraresi, P./Gallo, G. (1984): Network Models for Vehicle and crew Scheduling. in: European Journal of Operational research 38, 121 – 150
Carraresi, P./Girardi, L./Nonato, M. (1995): Network models, Lagrangean relaxation and subgradient bundle approach to crew scheduling problems. in: Daduna, J.R./ Branco, I./Paixão, J.P. (eds.), 188 – 212
Ceria, S./Nobili, P./Sassano, A. (1995): A Lagrangean-based heuristic for large-scale Set Covering problems. Report #406, University of Roma La Sapienza
Clement, R./Wren, A. (1995): Greedy genetic algorithms, optimizing mutations and bus driver scheduling. in: Daduna, J.R./ Branco, I./Paixão, J.P. (eds.), 188–212
Daduna, J.R./Branco, I./Paixão, J.P. (eds.) (1995): Computer aided transit scheduling. (Springer) Berlin, Heidelberg, New York, London, Paris, Tokyo
Daduna, J.R./Paixão, J.P. (1995): Vehicle scheduling for public mass transit: an overview. in: Daduna, J.R./ Branco, I./Paixão, J.P. (eds.), 76 – 90
Daduna, J.R./Wren, A. (eds.) (1988): Computer aided transit scheduling. (Springer) Berlin, Heidelberg, New York, London, Paris, Tokyo
Desaulniers, G./Desrosiers, J./Gamache, M./Soumis, F. (1997): Crew scheduling in air transportation. in: Crainic, T./Laporte, G. (eds.): Fleet management and logistics. Montreal
Desaulniers, G./Desrosiers, J./Ioachim, I./Solomon, M.M./Soumis, F./Villeneuve, D. (1997): A unified framework for deterministic time constrained vehicle routing and crew scheduling problems. in: Crainic, T./Laporte, G. (eds.): Fleet management and logistics. Montreal
Desaulniers, G./Desrosiers, J./Lasry, A./Solomon, M.M. (1997): Crew pairing for a regional carrier. Paper presented at the Seventh International Workshop on Computer-Aided Scheduling, Boston.
Desrochers, M./Rousseau, J.M. (eds.) (1992): Computer aided transit scheduling. (Springer) Berlin, Heidelberg, New York, London, Paris, Tokyo
Desrochers, M./Soumis, F. (1989): A column generation approach to the urban transit crew scheduling problem. in: Transportation Science 23, 1 – 13
Du Merle, O./Villeneuve, D./Desrosiers, J./Hansen, P. (1997): Stabilisation dans le cadre de la generation de colonnes. Les Cahiers du GERAD G-97–08, Montreal
Fisher, M./Kedia, P. (1990): Optimal solution of Set Covering/ Partitioning problems using dual heuristics. in: Management Science 36 (6), 674 – 688
Freling, R. (1997): Models and techniques for integrating vehicle and crew scheduling. Tinbergen Institute Research Series 157, Amsterdam
Friberg, C./Haase, K. (1997): An exact algorithm for the vehicle and crew scheduling problem. Paper presented at the Seventh International Workshop on Computer-Aided Scheduling, Boston.
Hoffman, K.L./Padberg, M. (1993): Solving airline crew scheduling problems by branch-and-cut. in: Management Science 39, 657 – 682
Kwan, A./Kwan, R./Wren, A. (1997): Driver scheduling using genetic algorithms with embedded combinatorial traits. Paper presented at the Seventh International Workshop on Computer-Aided Scheduling. Boston.
Lavoie, S./Minoux, M./Odier, E. (1988): Anew approach for crew pairing problems by column generation with an application to air transportation. in: European Journal of Operational research 35, 45 – 58
Marsten, R.E./Shepardson, F. (1981): Exact solution of crew problems using Set Partitioning model: recent successful applications. in: Networks 11, 165 – 177
Patrikalakis, I./Xerocostas, D. (1992): A new decomposition scheme of the urban public transport scheduling problem. in: Desrochers, M./Rousseau, J.-M. (eds.), 407 – 425
Ribeiro, C./Soumis, F. (1991): A column generation approach to the multiple depot vehicle scheduling problem. in: Operations Research 42 (1), 41 – 52
Rousseau, J.-M. (ed.) (1985): Computer scheduling of public transport 2. North Holland, Amsterdam
Ryan, D.M./Falkner, J.C. (1988): On the integer properties of scheduling Set Partitioning models. in: European Journal of Operational research 35, 442 – 456
Scott, D. (1985): A large scale linear programming approach to the public transport scheduling and costing problem. in: J.-M. Rousseau (ed.), 473 – 491
Tosini, E./Vercellis, C. (1988): An interactive system for the extra-urban vehicle and crew scheduling problems. in: Daduna, J.R./Wren A. (eds.), 41–53
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gaffi, A., Nonato, M. (1999). An Integrated Approach to Ex-Urban Crew and Vehicle Scheduling. In: Wilson, N.H.M. (eds) Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical Systems, vol 471. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85970-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-85970-0_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65775-0
Online ISBN: 978-3-642-85970-0
eBook Packages: Springer Book Archive