School Bus Routing and Scheduling Problem

  • Michela Spada
  • Michel Bierlaire
  • Thomas M. Liebling
Conference paper
Part of the Operations Research Proceedings 2002 book series (ORP, volume 2002)


We consider th e school bus rout ing and scheduling problem,where transportation demand is known and bus scheduling can be planned in advance.We first propose a modeling framework which aims to optimize a level of service for a given number of buses. Then,we describe a procedure building first a feasible solution, and subsequently improving it,using a heuristic. After the performance analysis of three types of heuristics on real and synthetic data,we recommend the use of simulated annealing exploring infeasible solutions,which performs slightly better than all others. More importantly, we find that the performance of all heuristics is not globally affected by the choice of the parameters.This is important from a practitioner viewpoint,as the fine tuning of algorithm parameters is not critical for its performance.


Schedule Problem Simulated Annealing Tabu Search Infeasible Solution Time Loss 
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.
    Bodin, L., Berman, L. (1979) Routing and Scheduling of School Buses by Computer.Transportation Science 13,113–129.CrossRefGoogle Scholar
  2. 2.
    Angel, R., Caudle, W., Noonan, R.,and Whinston, A.(1972) Computer-assisted School Bus Scheduling.Management Science B 18,279–288.Google Scholar
  3. 3.
    Bennett, B., Gazis, D.(1972) School Bus Routing by Computer. Transportation Research 6,317–326.CrossRefGoogle Scholar
  4. 4.
    Desrosiers, J., Ferland, J., Rousseau, J.M., Lapalme, G., Chapleau, L. (1981) An Overview of a School Busing System.In:N.Jaiswal(Ed.),Scientific Management of Transport Systems,Vol. IX, International Conference on Transportation, New Delhi,November 26–28,1980,26–28.Google Scholar
  5. 5.
    Gavish, B., Shlifer, E.(1979) An Approach for Solving a Class of Transportation Scheduling Problems.EJOR 3(2),122–134.CrossRefGoogle Scholar
  6. 6.
    Braca, J., Bramel, J., Poser, B., Simchi-Levi, D.(1994) A Computerized Approach to th e New York City School Bus Routing Problem.Technical report,Graduate School of Business,Columbia University,NY.Google Scholar
  7. 7.
    Kirkpatrick, S.,Gelatt, C.D.J.,Vecchi,M.P.(1983)Optimization by Simulated Annealing.Science 220,671–680.CrossRefGoogle Scholar
  8. 8.
    Rossier, Y., Troyon, M., Liebling, T.M.(1986) Probabilistic Exchange Algorithms and Euclidean Traveling Salesman Problems. OR Spektrum 8(3),151–164.CrossRefGoogle Scholar
  9. 9.
    Glover, F.(1977) Heuristic for Integer Programming Using Surrogate Constraints.Decision Sciences 8,156–166.CrossRefGoogle Scholar
  10. 10.
    Hansen, P., Jaumard, B.(1987) Algorithms for the Maximum Satisfiability Problem.Technical report, Rutgers University.Google Scholar
  11. 11.
    Spada, M., Bierlaire, M., Liebling, T.M.(2002) Decision-aid Methodology for the School Bus Routing and Scheduling Problem. Report # RO-20020819,Ecole Polytechnique Federale de Lausanne.Google Scholar
  12. 12.
    Dolan, E.D., More, J.J.(2002) Benchmarking Optimization Software with Performance Profiles.Mathematical Programming, Serie A 91,201–213.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Michela Spada
    • 1
  • Michel Bierlaire
    • 1
  • Thomas M. Liebling
    • 1
  1. 1.École Polytéchniqué Federale de LausanneInstitute of MathematicsSwitzerland

Personalised recommendations