Decision-Aiding Methodology for the School Bus Routing and Scheduling Problem

References

• Angel R., Caudle W., Noonan R., Whinston A. Computer-assisted school bus scheduling. Management Sci. B (1972) 18:279–288Link, Google Scholar
• Bennett B., Gazis D. School bus routing by computer. Transportation Res. (1972) 6:317–326Crossref, Google Scholar
• Berger R. Planification de tournées de véhicules scolaires. Travail pratique de diplôme (2001) (EPFL, Lausanne, Switzerland) Google Scholar
• Bodin L., Berman L. Routing and scheduling of school buses by computer. Transportation Sci. (1979) 13:113–129Link, Google Scholar
• Bodin L., Golden B., Assad A., Ball M. Routing and scheduling of vehicles and crews: The state of the art. Comput. Oper. Res. (1983) 10:63–211Crossref, Google Scholar
• Braca J., Bramel J., Poser B., Simchi-Levi D. A computerized approach to the New York City school bus routing problem. (1994) . Technical report, Graduate School of Business, Columbia University, New YorkGoogle Scholar
• Clarke G., Wright J. W. Scheduling of vehicle from a central depot to a number of delivery points. Oper. Res. (1964) 12:568–581Link, Google Scholar
• Desrosiers J., Ferland J., Rousseau J.-M., Lapalme G., Chapleau L., Jaiswal N. An overview of a school busing system. Sci. Management Transport Systems (1981) IXNew Delhi, India:235–243Internat. Conf. TransportationGoogle Scholar
• Dolan E., More J. Benchmarking optimization software with performance profiles. Math. Programming, Series A (2002) 91:2Crossref, Google Scholar
• Emonet B. Interface graphique pour la confection d’horaires et de tournées de véhicules scolaires. Projet de semestre (2000) (EPFL, Lausanne, Switzerland) Google Scholar
• Gavish B., Shlifer E. An approach for solving a class of transportation scheduling problems. Eur. J. Oper. Res. (1979) 3(2):122–134Crossref, Google Scholar
• Glardon C., Delaloye V., Liebling T. M. Referee assignment for volleyball championships: A competition between three local search heuristics. Investigación Operativa (1992) 2(3):199–219Google Scholar
• Glover F. Heuristic for integer programming using surrogate constraints. Decision Sci. (1977) 8:156–166Crossref, Google Scholar
• Hansen P. The steepest ascent mildest descent heuristic for combinatorial programming. (1986) . Technical report, Congress Numerical Methods Combin. Optim., Capri, ItalyGoogle Scholar
• Hansen P., Jaumard B. Algorithms for the maximum satisfiability problem. (1987) . Technical report, Rutgers University, NJGoogle Scholar
• Hao J.-K., Pannier J. Simulated annealing and tabu search for constraint solving. Proc. 5th Internat. Sympos. Artificial Intelligence Math. (1998) Google Scholar
• Kirkpatrick S., Gelatt C. D. J., Vecchi M. P. Optimization by simulated annealing. Science (1983) 220:671–680Crossref, Google Scholar
• Kurbel K., Kasabov N., et al. The trade-off between solution quality and computing times of intelligent algorithms—A computational study on the role of parameters and time budgets. Progress in Connectionist-Based Information Systems (1998) 1:604–607Proc. 1997 Internat. Conf. Neural Inform. Processing Intelligent SystemsGoogle Scholar
• Lin S. Computer Solutions of the traveling salesman problem. Bell System Tech. J. (1965) 44:2245–2269Crossref, Google Scholar
• Newton R. M., Thomas W. H. Design of school bus routes by computer. Socio-Econom. Planning Sci. (1969) 3:75–85Crossref, Google Scholar
• Preparata F., Shamos M.Computational Geometry: An Introduction (1985) (Springer, New York) Crossref, Google Scholar
• Rosenkrantz D., Stearns R., Lewis P. Approximate algorithms for the traveling-salesperson problem. Proc. 15th Ann. IEEE Sympos. Switching Automata Theory (1974) (IEEE, Long Beach, CA) 33–42Crossref, Google Scholar
• Rossier Y., Troyon M., Liebling T. M. Probabilistic exchange algorithms and Euclidean traveling salesman problems. OR Spektrum (1986) 8(3):151–164Crossref, Google Scholar
• Spada M., Bierlaire M., Liebling T. M. Decision-aid methodology for the school bus routing and scheduling problem. (2002) . Technical Report RO-20020819. EPFL, Lausanne, SwitzerlandGoogle Scholar
• Swersey A. J., Ballard W. Scheduling school buses. Management Sci. (1984) 30(7):844–853Link, Google Scholar
• Watters L. J. Reduction of integer polynomial programming problems to zero-one linear programming problems. Oper. Res. (1967) 15:1171–1174Link, Google Scholar