The school bus routing problem: An analysis and algorithm

Lewis, Rhydian ORCID: https://orcid.org/0000-0003-1046-811X, Smith-Miles, Kate and Phillips, Kyle 2018. The school bus routing problem: An analysis and algorithm. Presented at: IWOCA 2017: 28th International Workshop on Combinatorial Algorithms, Newcastle, NSW, Australia, 17-21 July 2017. Published in: Brankovic, Ljiljana, Ryan, Joe and Smyth, William F. eds. Combinatorial Algorithms: 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers. Lecture Notes in Computer Science Springer, pp. 287-298. 10.1007/978-3-319-78825-8_24

Preview

PDF - Accepted Post-Print Version Download (888kB) | Preview

Abstract

In this paper we analyse a flexible real world-based model for designing school bus transit systems and note a number of parallels between this and other well-known combinatorial optimisation problems including the vehicle routing problem, the set covering problem, and one-dimensional bin packing. We then describe an iterated local search algorithm for this problem and demonstrate the sort of solutions that we can expect with different types of problem instance.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Publication
Status:	Published
Schools:	Mathematics
Publisher:	Springer
ISBN:	9783319788241
Date of First Compliant Deposit:	15 May 2018
Date of Acceptance:	1 November 2017
Last Modified:	23 Oct 2022 13:42
URI:	https://orca.cardiff.ac.uk/id/eprint/111481

Citation Data

Cited 4 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item