Solving school bus routing problems through integer programming

Bektas, T. and Elmastas, S. (2007) Solving school bus routing problems through integer programming Journal of the Operational Research Society, 58, (12), pp. 1599-1604. (doi:10.1057/palgrave.jors.2602305).


[img] PDF 2602305a.pdf - Version of Record
Restricted to Repository staff only

Download (142kB)


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.

Item Type: Article
Digital Object Identifier (DOI): doi:10.1057/palgrave.jors.2602305
ISSNs: 0160-5682 (print)
Keywords: school bus routing, integer programming, exact solution, open vehicle routing problem, capacity constraints, distance constraints

ePrint ID: 47178
Date :
Date Event
6 December 2007Published
Date Deposited: 03 Aug 2007
Last Modified: 16 Apr 2017 18:30
Further Information:Google Scholar

Actions (login required)

View Item View Item