An Interactive System for Extra-Urban Vehicle and Crew Scheduling Problems

  • Elisabetta Tosini
  • Carlo Vercellis
Conference paper
Part of the Lecture Note in Economics Mathematical Systems book series (LNE, volume 308)


The problem of determining a feasible schedule of vehicles and crews, to cover the service requirements at minimum cost, lies at the core of operations management in mass transit agencies. Computer-aided systems have been regarded by company managers as potentially helpful tools for schedulers, aimed at achieving a number of profitable effects: to speed-up the time consuming manual planning process; to improve the quality of the schedules obtained; to perform “what-if” cost analyses with respect to changes in the timetable, cost parameters, driver regulations, depots locations and capacities; to increase the level of integration of the Management Information System.


Transportation Dial PERC 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Ball, M.: Polynomial algorithms for matching problems with side constraints. Technical Report. Univ. Maryland, Baltimore, 1987Google Scholar
  2. [2]
    Ball, M.; Bodin, L; Dial, R.: Experimentation with a computerized system for scheduling mass transit vehicles and crews. Computer Scheduling of Public Transport, A. Wren ed., North-Holland, Amsterdam 1981, 313–336Google Scholar
  3. [3]
    Ball, M.; Bodin, L.; Dial, R.: A matching based heuristic for scheduling mass transit crews and vehicles. Transportation Science 17 (1983), 4–13CrossRefGoogle Scholar
  4. [4]
    Bodin, L;. Golden, B.; Assad, A.; Ball, M.: Routing and scheduling of vehicles and crews. Computers and Operations Research 10 (1983), 63–211CrossRefGoogle Scholar
  5. [5]
    Carraresi, P.; Gallo, G.; Rousseau, J.M.: Relaxation approaches to large scale bus driver scheduling problems. Transportation Research 16B (1981), 383–397Google Scholar
  6. [6]
    Carraresi, P.; Gallo, G.: Network models for vehicles and crew scheduling, European Journal of Operations Research 16 (1984), 139–151CrossRefGoogle Scholar
  7. [7]
    Carraresi, P.; Gallo, G.: Optimization models in Mass Transit Resources Management. Rivista A.I.R.O. 38 (1986), 121–150Google Scholar
  8. [8]
    Dantzig, G.; Fulkerson, D.: Minimizing the number of tankers to meet a fixed schedule. Naval Res.Logistic Quart. 1 (1954), 217–222CrossRefGoogle Scholar
  9. [9]
    Hamacher, H.W.; Queyranne, M.: K-best solutions to combinatorial optimization problems. Annals of Discrete Mathematics 29 (1985)Google Scholar
  10. [10]
    Hildyard, P.; Wallis, N.: Advances in computer assisted runcutting in North-America, Computer Scheduling of Public Transport, A. Wren ed., Amsterdam 1981, 183–192Google Scholar
  11. [11]
    Lawler, E.L.: Combinatorial Optimization: Networks and matroids. New York, 1976Google Scholar
  12. [12]
    Papadimitriou, C.; Steiglitz, K.: Combinatorial Optimization. Prentice-Hall, Englewood Cliffs 1982Google Scholar
  13. [13]
    Parker, M.; Smith, B.: Two approaches to computer crew scheduling. Computer Scheduling of Public Transport, A. Wren ed., North-Holland, Amsterdam 1981, 193–221Google Scholar
  14. [14]
    Rousseau, J.M. ed.: Computer Scheduling of Public Transport 2. North-Holland, Amsterdam 1984.Google Scholar
  15. [15]
    Ryan, D.M.; Foster, B.A.: An integer programming approach to scheduling. Computer Scheduling of Public Transport, A. Wren ed., North-Holland, Amsterdam, 1981, 269–280Google Scholar
  16. [16]
    Wren, A. ed.: Computer Scheduling of Public Transport. North-Holland, Amsterdam 1981Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Elisabetta Tosini
    • 1
  • Carlo Vercellis
    • 1
  1. 1.Dipartimento di ElettronicaPolitecnico di MilanoMilanoItaly

Personalised recommendations