Solving school bus routing problems through integer programming
Authors:
- 21 December 2007
- journal article
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 58 (12) , 1599-1604
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 reservedKeywords
This publication has 12 references indexed in Scilit:
- Solving the open vehicle routeing problem via a single parameter metaheuristic algorithmJournal of the Operational Research Society, 2005
- A new tabu search heuristic for the open vehicle routing problemJournal of the Operational Research Society, 2005
- A note on the lifted Miller–Tucker–Zemlin subtour elimination constraints for the capacitated vehicle routing problemEuropean Journal of Operational Research, 2004
- A tabu search algorithm for the open vehicle routing problemEuropean Journal of Operational Research, 2004
- The school bus routing problem: a case studyJournal of the Operational Research Society, 2002
- A heuristic method for the open vehicle routing problemJournal of the Operational Research Society, 2000
- A computerized approach to the New York City school bus routing problemIIE Transactions, 1997
- A remark on “Integer linear programming formulation for a Vehicle Routing Problem” by N.R. Achutan and L. Caccetta, or how to use the Clark & Wright savings to write such integer linear programming formulationsEuropean Journal of Operational Research, 1994
- Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraintsOperations Research Letters, 1991
- Integer Programming Formulation of Traveling Salesman ProblemsJournal of the ACM, 1960