  We propose a novel technique for answering routing queries in public
transportation networks that allows unrestricted walking. We consider several
types of queries: earliest arrival time, Pareto-optimal journeys regarding
arrival time, number of transfers and walking time, and profile, i.e. finding
all Pareto-optimal journeys regarding travel time and arrival time in a given
time interval. Our techniques uses hub labeling to represent unlimited foot
transfers and can be adapted to both classical algorithms RAPTOR and CSA. We
obtain significant speedup compared to the state-of-the-art approach based on
contraction hierarchies.
