An Integrated Approach to Extra-Urban Crew and Vehicle Scheduling
The 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 extra-urban mass transit, where crews are tightly dependent on vehicle activity or crew deadheadings 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 duties and crew duties. Crew duties are fixed step by step, while vehicles are scheduled once all the trips have been partitioned into pieces.
Extended use of Bundle methods for polyhedral functions and algorithms for constrained shortest path and assignment is made within a dual greedy heuristic procedure for the Set Partitioning problem.
Computational results are provided for Italian mass transit public companies, showing some improvements with respect to the results of the sequential approach.
KeywordsSchedule Problem Column Generation Lagrangean Relaxation Crew Schedule Mass Transit
Unable to display preview. Download preview PDF.
- 3.M. Ball, H. Benoit-Thompson. A lagrangean relaxation based heuristic for the urban transit crew scheduling problem. J. R. Daduna, A. Wren Eds, Springer Verlag, Berlin Heidelberg, 54–67, 1988.Google Scholar
- 6.A. Caprara, M. Fischetti, P. Toth. A heuristic procedure for the set covering problem. Operations Research, (to appear), 1997.Google Scholar
- 8.P. Carraresi, G. Gallo. Network models for vehicle and crew scheduling. European Journal of Operational Research, 38: 121–150, 1991.Google Scholar
- 9.P. Carraresi, A. Frangioni, M. Nonato. Applying bundle methods to the optimization of polyhedral functions. An application-oriented development. Ricerca Operativa, 25: 4–49, 1995.Google Scholar
- 10.P. Carraresi, L. Girardi, L. Nonato. Network models, lagrangean relaxation and subgradient bundle approach to crew scheduling problems. J. R. Daduna, I. Branco, J. P. Paixão Eds, Springer Verlag, Berlin, Heidelberg, 188–212, 1995.Google Scholar
- 11.S. Ceria, P. Nobili, A. Sassano. A lagrangean-based heuristic for large scale set covering problems. Report # 406, University of Roma, La Sapienza, Roma, Italy, 1995.Google Scholar
- 14.J. R. Daduna, J. P. Paixão. Vehicle scheduling for public mass transit: an overview. J. R. Daduna, I. Branco, J. P. Paixão Eds. Springer Verlag, Berlin, Heidelberg, 76–90, 1995.Google Scholar
- 17.J. Desrosiers, Y. Dumas, M. M. Solomon, E. Soumis. Time constrained routing and scheduling Les Cahiers du GERAD G-92–42, Ecole des Hautes Etudes Commerciales, Montreal, Canada, 1993.Google Scholar
- 18.J. C. Faulkner, D. M. Ryan. Express: set partitioning for bus crew scheduling in Christchurch. M. Desrochers, J.-M. Rousseau Eds, Springer Verlag, Berlin, Heidelberg, 358–378, 1992.Google Scholar
- 21.R. Freling, J. P. Paixâo. An integrated approach to vehicle and crew scheduling. Proceedings of TRISTAN II, Capri, 319–333, 1994.Google Scholar
- 22.I. Patrikalakis, D. Xerocostas. A new decomposition scheme for the urban public transport scheduling problem. M. Desrochers J.-M. Rousseau Eds, Springer Verlag, Berlin, Heidelberg, 407–425, 1992.Google Scholar
- 24.J.-M. Rousseau. Computer scheduling of public transport 2. North-Holland, Amsterdam, 1985.Google Scholar
- 26.D. Scott. A large scale linear programming approach for the public transport scheduling and costing problem. J.-M. Rousseau Ed., North-Holland, Amsterdam, 473–491, 1985.Google Scholar
- 27.E. Tosini, C. Vercellis. An interactive system for the extra urban vehicle and crew scheduling problems. J. R. Daduna, A. Wren Eds, Springer Verlag, Berlin, Heidelberg, 41–53, 1988.Google Scholar