Research Reports from the Department of Operations
Document Type
Report
Publication Date
8-1-1972
Abstract
This paper proposes several models, and outlines seemingly efficient techniques for the school bus routing problem. Given the number of schools, buses and their capacities, the number of children, their location and destination, and distances or times between stops, the problem is to design a "best" (several criteria are given) series of bus routes. An integer programming, a dynamic programming, and several composite models and algorithms are proposed. By making reasonable assumptions computer storage problems may be substantially alleviated and implementation is possible in each case. As the problem is usually enormous, emphasis is placed on producing "good" solutions to larger problems rather than on finding best solutions to smaller ones. The models and algorithms, containing few restrictions, may be readily implemented at the district, county, or regional level.
Keywords
Operations research, School buses, Integer programming, Dynamic programming, Algorithms, Transportation--Mathematical models, Mathematical optimization, Vehicle routing problem
Publication Title
Technical Memorandums from the Department of Operations, School of Management, Case Western Reserve University
Issue
Technical memorandum no. 271
Rights
This work is in the public domain and may be freely downloaded for personal or academic use
Recommended Citation
Salkin, Harvey M. and Breining, Patrice, "School Bus Routing by Integer Programming, Dynamic Programming, and Composite Algorithms" (1972). Research Reports from the Department of Operations. 503.
https://commons.case.edu/wsom-ops-reports/503