Using K-shortest paths algorithms to accommodate user preferences in the optimization of public transport travel

Tools

Wu, Q. and Hartley, J. ORCID: 0000-0003-0727-9588, 2004. Using K-shortest paths algorithms to accommodate user preferences in the optimization of public transport travel. In: Proceedings of UKSIM 2004, Seventh National Conference of the United Kingdom Simulation Society. Nottingham: United Kingdom Simulation Society, pp. 113-117. ISBN 1842330993

Full text not available from this repository.

Abstract

Traffic congestion is becoming a serious problem in more and more modern cities. Encouraging more private-vehicle drivers to use public transportation is one of the most effective and economical ways to reduce the ever increasing congestion problem on the streets (Hartley and Bargiela, 2001). To make public transport services more attractive and competitive, providing travellers with individual travel advice for journeys becomes crucial. However, with the massive and complex network of a modern city, finding one or several suitable route(s) according to user preferences from one place to another is not a simple task. In this paper, the author presents an approach that uses K-shortest paths algorithms to compute a reasonable number of ranked shortest paths, with the ultimate 'most optimal' path being selected by consideration of the preferences. Some experiments have been done based on the public transportation network of Nottingham City

Item Type:	Chapter in book
Creators:	Wu, Q. and Hartley, J.
Publisher:	United Kingdom Simulation Society
Place of Publication:	Nottingham
Date:	2004
ISBN:	1842330993
Divisions:	Schools > School of Science and Technology
Record created by:	EPrints Services
Date Added:	09 Oct 2015 10:19
Last Modified:	09 Jun 2017 13:26
URI:	https://irep.ntu.ac.uk/id/eprint/11269