Solving school bus routing problems through integer programming
Date
2007Source Title
Journal of the Operational Research Society
Print ISSN
0160-5682
Publisher
Palgrave Macmillan Ltd.
Volume
58
Issue
12
Pages
1599 - 1604
Language
English
Type
ArticleItem Usage Stats
172
views
views
560
downloads
downloads
Abstract
In this paper, an exact solution approach is described for solving a real-life school bus routing problem (SBRP) for transporting the students of an elementary school throughout central Ankara, Turkey. The problem is modelled as a capacitated and distance constrained open vehicle routing problem and an associated integer linear program is presented. The integer program borrows some well-known inequalities from the vehicle routing problem, which are also shown to be valid for the SBRP under consideration. The optimal solution of the problem is computed using the proposed formulation, resulting in a saving of up to 28.6 in total travelling cost as compared to the current implementation. © 2007 Operational Research Society Ltd. All rights reserved.
Keywords
Constraint theoryInteger programming
Linear programming
Mathematical models
Students
Vehicle routing
Capacity constraints
Distance constraints
Exact solution
Open vehicle routing problem
School bus routing
Problem solving