Mixed Trips in the School Bus Routing Problem with Public Subsidy
In some regions, school buses have a subsidy associated with the number of school buses needed in a day, in relation to the number of schools or students. This paper presents the application of a Tabu Search (TS) metaheuristic to generate an information system that will allow searching for the best selection of routes and schedules with the minimum number of buses. The complexity and magnitude of the problem is important, especially at economic level for Andalusia government, because there are many buses and roads to go to school. The approach is more relevant for the necessary austerity in public services, considering that the quality is guaranteed by a set of restrictions. In the mixed trip problem, students of different schools can share the same bus at the same time. We use a mixed load algorithm for the school bus routing problem (SBRP) and measure its effects on the number of required vehicles. The solution could reduce the required number of vehicles compared with the current practice.
KeywordsVehicle routing problem School bus routing Meta-heuristics Optimization Tabu search
- Braca J, Bramel J, Posner B, Simchi-Levi D (1997) A computerized approach to the New York City school bus routing problem. IIE Trans 29:693–702Google Scholar
- Desrosiers J, Ferland JA, Rousseau JM, Lapalme G, Chapleau L (1981) An overview of a school busing system. Scientific Management of Transport Systems. pp 235–243Google Scholar
- Simchi-Levi D, Chen X, Bramel J (2014) The logic of logistics: theory, algorithms, and applications for logistics management. Springer, BerlinGoogle Scholar