@article{ref1,
title="Optimizing itineraries in public transportation with walks between rides",
journal="Transportation research part B: methodological",
year="2013",
author="de Jonge, Bram and Teunter, Ruud H.",
volume="55",
number="",
pages="212-226",
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.<p />",
language="en",
issn="0191-2615",
doi="10.1016/j.trb.2013.06.014",
url="http://dx.doi.org/10.1016/j.trb.2013.06.014"
}