The University of Southampton
University of Southampton Institutional Repository

Solving school bus routing problems through integer programming

Solving school bus routing problems through integer programming
Solving school bus routing problems through integer programming
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 routing, integer programming, exact solution, open vehicle routing problem, capacity constraints, distance constraints
0160-5682
1599-1604
Bektas, T.
0db10084-e51c-41e5-a3c6-417e0d08dac9
Elmastas, S.
3da078ac-5bab-4266-a901-a36acf713bd0
Bektas, T.
0db10084-e51c-41e5-a3c6-417e0d08dac9
Elmastas, S.
3da078ac-5bab-4266-a901-a36acf713bd0

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

Record type: Article

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.

Text
2602305a.pdf - Version of Record
Restricted to Repository staff only
Request a copy

More information

Published date: 6 December 2007
Keywords: school bus routing, integer programming, exact solution, open vehicle routing problem, capacity constraints, distance constraints

Identifiers

Local EPrints ID: 47178
URI: https://eprints.soton.ac.uk/id/eprint/47178
ISSN: 0160-5682
PURE UUID: 54397d79-ec25-483e-b73b-d30e62d98e20
ORCID for T. Bektas: ORCID iD orcid.org/0000-0003-0634-144X

Catalogue record

Date deposited: 03 Aug 2007
Last modified: 18 Jul 2019 12:19

Export record

Altmetrics

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×