The reasonable route choice set in large and complex metro networks; an implementation of the K-shortest path algorithm for the London Underground

Nadudvari, T, Liu, R orcid.org/0000-0003-0627-3184 and Balijepalli, NC orcid.org/0000-0002-8159-1513 (2018) The reasonable route choice set in large and complex metro networks; an implementation of the K-shortest path algorithm for the London Underground. In: Proceedings of the 21st International Conference of Hong Kong Society for Transportation Studies, 10th-12th December 2016. HKSTS 2016 - Smart Transportation, 10-12 Dec 2016, Hong Kong. , pp. 247-254. ISBN 9789881581457

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © 2018 Hong Kong Society for Transportation Studies Limited. All rights reserved. This is an author produced version of a paper presented at the HKSTS 2016 - Smart Transportation.
Keywords: metro network; route choice set; K shortest path; cut-off criteria
Dates:
  • Published: 1 January 2018
  • Accepted: 23 September 2016
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Environment (Leeds) > Institute for Transport Studies (Leeds) > ITS: Spatial Modelling and Dynamics (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 27 Jun 2019 09:45
Last Modified: 27 Jun 2019 09:55
Status: Published

Share / Export

Statistics