(Created page with " == 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 trave...") |
m (Scipediacontent moved page Draft Content 771156070 to Teunter Jonge 2013a) |
(No difference)
|
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.
The different versions of the original document can be found in:
Published on 01/01/2013
Volume 2013, 2013
DOI: 10.1016/j.trb.2013.06.014
Licence: CC BY-NC-SA license
Are you one of the authors of this document?