Ahmed, Leena, Heyken-Soares, Philipp, Mumford, Christine ![]() |
Preview |
PDF
- Accepted Post-Print Version
Download (2MB) | Preview |
Abstract
The urban transit routing problem (UTRP) is concerned with finding efficient travelling routes for public transportation systems. This problem is highly complex, and the development of effective algorithms to solve it is very challenging. Furthermore, realistic benchmark data sets are lacking, making it difficult for researchers to compare their problem-solving techniques with those of other researchers. In this paper we contribute a new set of benchmark instances that have been generated by a procedure that scales down a real world transportation network, yet preserves the vital characteristics of the network layout including "terminal nodes" from which buses are restricted to start and end their journeys. In addition, we present a hyper-heuristic solution approach, specially tailored to solving instances with defined terminal nodes. We use our hyper-heuristic technique to optimise the generalised costs for passengers and operators, and compare the results with those produced by an NSGAII implementation on the same data set. We provide a set of competitive results that improve on the current bus routes used by bus operators in Nottingham.
Item Type: | Conference or Workshop Item (Paper) |
---|---|
Date Type: | Published Online |
Status: | Published |
Schools: | Computer Science & Informatics |
Publisher: | ACM |
ISBN: | 9781450361118 |
Date of First Compliant Deposit: | 30 July 2019 |
Date of Acceptance: | 21 March 2019 |
Last Modified: | 19 May 2023 01:10 |
URI: | https://orca.cardiff.ac.uk/id/eprint/124589 |
Citation Data
Cited 6 times in Scopus. View in Scopus. Powered By Scopus® Data
Actions (repository staff only)
![]() |
Edit Item |