A mathematical formulation for a school bus routing problem
- 1 October 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 1552-1557
Abstract
The school bus routing problem discussed in this paper, is similar to the standard vehicle routing problem, but has several interesting additional features. In the standard VRP all stops to visit are given. In our school bus routing problem, we assume that a set of potential stops is given, as well as a set of students that can walk to one or more of these potential stops. The school buses used to pick up the students and transport them to their schools have a finite capacity. The goal of this routing problem is to select a subset of stops that would actually be visited by the buses, determine which stop each student should walk to and develop a set of tours that minimize the total distance travelled by all buses. We develop an integer programming formulation for this problem, as well as a problem instance generator. We then show how the problem can be solved using a commercial integer programming solver and discuss some of our results on small instancesKeywords
This publication has 6 references indexed in Scilit:
- A computerized approach to the New York City school bus routing problemIIE Transactions, 1997
- A multi-objective optimization approach to urban school bus routing: Formulation and solution methodTransportation Research Part A: Policy and Practice, 1995
- Clustering for routing in densely populated areasEuropean Journal of Operational Research, 1985
- School bus routes generator in urban surroundingsComputers & Operations Research, 1980
- Routing and Scheduling of School Buses by ComputerTransportation Science, 1979
- School bus routing by computerTransportation Research, 1972