Method for preprocessing a set of feasible transfers for computing itineraries in a multimodal transportation network

Abstract

A method for preprocessing a set of feasible transfers within a multimodal transportation network of predetermined stations, comprising, for each trip in the multimodal transportation network hereafter called origin trip: (a) for each station (p) of the origin trip (t), computing at this station (p) an earliest arrival/change time associated with all transportation modes (m) of the multimodal transportation network; (b) for at least one transfer of the set of feasible transfers from a station (p) on the origin trip (t) to a reachable station (p) on a target trip (u), computing, at each station (p) of the target trip (u) after the reachable station (p), a value of the earliest arrival/change time specifically associated with the transportation mode (m) of the multimodal transportation network used by the target trip (u); (c) removing the transfer only if determining that each computed value of the earliest arrival/change time is not improved by the transfer; (d) outputting the set of feasible transfers for computing at least one itinerary in the multimodal transportation network; and (e) performing a routing optimization algorithm so as to build, among the itineraries having a main part from an initial trip belonging to the set of possible initial trips to a final trip belonging to the set of possible final trips, at least one optimal itinerary according to the earliest arrival time and the number of transfers or the latest departure time and the number of transfers, when considering only trips from the set of possible trips using the selected transportation modes, and only transfers from the subset of feasible transfers between considered trips.