Abstract

We study the problem of finding an optimal itinerary to travel from a starting location to a destination location using public transport, where we allow travelers to alternate rides with (short) walks. The main difference with previous research is that we take all possible walks that a traveler can make into consideration. This large number of possible walks poses a potential computational difficulty. However, in this paper we derive theorems for identifying a small subset of walks that only need to be considered. These results are embedded in a solution algorithm, which is tested in a real-life setting for bus transportation in a medium sized city. An extensive numerical study leads to encouraging results. First, only 1% of all possible walks needs to be considered, so that the optimal itinerary can be determined very efficiently. Second, allowing walks has considerable benefits; reducing the travel time in about 6% of all randomly generated examples by more than 10% on average. (C) 2013 Elsevier Ltd. All rights reserved.


Original document

The different versions of the original document can be found in:

https://api.elsevier.com/content/article/PII:S0191261513001136?httpAccept=text/plain,
http://dx.doi.org/10.1016/j.trb.2013.06.014
https://trid.trb.org/view/1262429,
https://core.ac.uk/display/92422629,
https://www.rug.nl/research/portal/en/publications/optimizing-itineraries-in-public-transportation-with-walks-between-rides(388bcdc1-f3be-4f80-a325-549a3fe15df7).html,
https://www.worldtransitresearch.info/research/4913,
[=citjournalarticle_443306_38 http://www.safetylit.org/citations/index.php?fuseaction=citations.viewdetails&citationIds[]=citjournalarticle_443306_38],
https://www.narcis.nl/publication/RecordID/oai%3Apure.rug.nl%3Apublications%2F388bcdc1-f3be-4f80-a325-549a3fe15df7,
https://academic.microsoft.com/#/detail/2159868497
Back to Top

Document information

Published on 01/01/2013

Volume 2013, 2013
DOI: 10.1016/j.trb.2013.06.014
Licence: CC BY-NC-SA license

Document Score

0

Views 0
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?