School Bus Routing and Scheduling Problem
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.
KeywordsSchedule Problem Simulated Annealing Tabu Search Infeasible Solution Time Loss
Unable to display preview. Download preview PDF.
- 2.Angel, R., Caudle, W., Noonan, R.,and Whinston, A.(1972) Computer-assisted School Bus Scheduling.Management Science B 18,279–288.Google Scholar
- 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
- 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
- 10.Hansen, P., Jaumard, B.(1987) Algorithms for the Maximum Satisfiability Problem.Technical report, Rutgers University.Google Scholar
- 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