Journal of the Operational Research Society

, Volume 58, Issue 12, pp 1599–1604

Solving school bus routing problems through integer programming

Case-Oriented Paper

DOI: 10.1057/palgrave.jors.2602305

Cite this article as:
Bektaş, T. & Elmastaş, S. J Oper Res Soc (2007) 58: 1599. doi:10.1057/palgrave.jors.2602305


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.


school bus routinginteger programmingexact solutionopen vehicle routing problemcapacity constraintsdistance constraints

Copyright information

© Palgrave Macmillan Ltd 2006

Authors and Affiliations

  1. 1.Université de Montréal, HEC MontréalCanada
  2. 2.Başkent UniversityTurkey
  3. 3.Bilkent UniversityTurkey