Simultaneous Vehicle and Crew Scheduling for Extra Urban Transports

  • Benoît Laurent
  • Jin-Kao Hao
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5027)


We present a simultaneous approach to solve the integrated vehicle and crew scheduling problem in an extra urban context. We consider the single depot case with a heterogeneous fleet of vehicles. We propose a constraint based model which is subsequently solved by a Greedy Randomized Adaptive Search Procedure. The construction phase of each initial solution relies on constraint programming techniques, while the local search phase exploits a powerful neighborhood exploration mechanism. The computational experiments conducted on real-world instances show the effectiveness and the flexibility of the approach compared with the classical sequential vehicle and crew scheduling.


Schedule Problem Greedy Randomize Adaptive Search Procedure Crew Schedule Local Search Phase Constraint Base Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ball, M., Bodin, L., Dial, R.: A matching based heuristic for scheduling mass transit crews and vehicles. Transportation Science 17, 4–31 (1983)CrossRefGoogle Scholar
  2. 2.
    Borndoerfer, R., Loebel, A., Weider, S.: A bundle method for integrated multi-depot vehicle and duty scheduling in public transit. TR 04-14 (2004)Google Scholar
  3. 3.
    Dallaire, A., Fleurent, C., Rousseau, J.M.: Dynamic Constraint Generation in CrewOpt, a Column Generation Approach for Transit Crew Scheduling. In: Voß, S., Daduna, J.R. (eds.) Computer-Aided Scheduling of Public Transport (CASPT), pp. 73–90. Springer, Berlin (2004)Google Scholar
  4. 4.
    Freling, R.: Models and Techniques for Integrating Vehicle and Crew Scheduling. PhD thesis, Tinbergen Institute, Erasmus University Rotterdam (1997)Google Scholar
  5. 5.
    Freling, R., Boender, G., Paixão, J.M.P.: An integrated approach to vehicle and crew scheduling. Technical Report 9503/A, Economie Institute, Erasmus University Rotterdam, Rotterdam (1995)Google Scholar
  6. 6.
    Gaffi, A., Nonato, M.: An integrated approach to the extra-urban crew and vehicle scheduling problem. In: Wilson, N.H.M. (ed.) Computer-Aided Transit Scheduling, pp. 103–128. Springer, Berlin (1999)Google Scholar
  7. 7.
    Glover, F.: Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Applied Math. 65(1-3), 223–253 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Haase, K., Desaulniers, G., Desrosiers, J.: Simultaneous vehicle and crew scheduling in urban mass transit systems. Transportation Science 35(3), 286–303 (2001)zbMATHCrossRefGoogle Scholar
  9. 9.
    Haase, K., Friberg, C.: An exact branch and cut algorithm for the vehicle and crew scheduling problem. In: Wilson, N.H.M. (ed.) Computer-Aided Transit Scheduling, pp. 63–80. Springer, Berlin (1999)Google Scholar
  10. 10.
    Huisman, D.: Integrated and Dynamic Vehicle and Crew Scheduling. PhD thesis, Tinbergen Institute, Erasmus University Rotterdam (2004)Google Scholar
  11. 11.
    Huisman, D., Freling, R., Wagelmans, A.P.M.: Multiple-depot integrated vehicle and crew scheduling. Trans. Sci. 39, 491–502 (2005)CrossRefGoogle Scholar
  12. 12.
    Laurent, B., Hao, J.K.: Simultaneous vehicle and driver scheduling: a case study in a limousine rental company. Computers & Industrial Engineering 53(3), 542–558 (2007)CrossRefGoogle Scholar
  13. 13.
    Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York (1990)zbMATHGoogle Scholar
  14. 14.
    Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, London (1993)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Benoît Laurent
    • 1
    • 2
  • Jin-Kao Hao
    • 2
  1. 1.Perinfo SAStrasbourgFrance
  2. 2.LERIAUniversité d’AngersAngers Cedex 01France

Personalised recommendations