	US 12,264,921 B2
	Method for preprocessing a set of feasible transfers for computing itineraries in a multimodal transportation network
Vassilissa Lehoux-Lebacque, Corenc (FR); and Darko Drakulic, Grenoble (FR)
Assigned to Naver Corporation, (KR)
Filed by Naver Corporation, Seongnam-si (KR)
Filed on Mar. 26, 2020, as Appl. No. 16/830,609.
Claims priority of application No. 19305687 (EP), filed on May 29, 2019.
Prior Publication US 2020/0378772 A1, Dec. 3, 2020
Int. Cl. G01C 21/34 (2006.01); G06Q 10/047 (2023.01); G06Q 50/14 (2012.01)

CPC G01C 21/3423 (2013.01) [G01C 21/343 (2013.01); G01C 21/3446 (2013.01); G01C 21/3453 (2013.01); G06Q 10/047 (2013.01); G06Q 50/14 (2013.01)]

42 Claims

1. A method for electronically computing an itinerary from a departure location to an arrival location for use by a user to plan a trip travelling in a multimodal transportation network, the itinerary being defined as the departure location to an initial station of a multimodal transportation network of predetermined stations, a main part in the multimodal transportation network, a sequence of trips from a set of possible trips within the multimodal transportation network and transfers from a set of feasible transfers within the multimodal transportation network, and a final station of the multimodal transportation network to the arrival location, the method comprising:

(a) electronically preprocessing the set of feasible transfers to obtain a subset of feasible transfers;

said (a) electronically preprocessing the set of feasible transfers by

(a1) for each station (p_tⁱ) of the origin trip (t), electronically computing, using an electronic processor and electronic memory, at this station (p_tⁱ) a value of an earliest arrival time (τ_A(p_tⁱ, m)) or an earliest change time (τ_C(p_tⁱ, m)) associated with all transportation modes (m) of the multimodal transportation network,

(a2) for at least one transfer (p_tⁱ→p_u^j) of the set of feasible transfers from a station (p_tⁱ) on an origin trip (t) to a reachable station (p_u^j) on a target trip (u), electronically computing, using an electronic processor and electronic memory, at each station (p_u^k>j) of the target trip (u) after the reachable station (p_u^j), a value of the earliest arrival time (τ_A(p_u^k>j, m_u) or the earliest change time (τ_C(p_u^k>j, m)) specifically associated with the transportation mode (m_u) of the multimodal transportation network used by the target trip (u), or if the transportation mode (m_u) of the multimodal transportation network used by the target trip (u) is the same as the transportation mode (m_t) of the multimodal transportation network used by the origin trip (t), a value of the earliest arrival time (τ_A(p_u^k>j, m)) or the earliest change time (τ_C(p_u^k>j, m)) associated with all transportation modes (m) of the multimodal transportation network,

(a3) electronically removing, using an electronic processor and electronic memory, before receiving information corresponding to a user's desired mode of transportation, the transfer (p_tⁱ→p_u^j) from the set of feasible transfers only if determining that each computed value of the earliest arrival time (τ_A(p_u^k>j, m)) or the earliest change time (τ_C(p_u^k>j, m)) is not improved by the transfer (p_tⁱ→p_u^j) and the transfer (p_tⁱ→p_u^j) is not of a different mode of transportation, thereby preventing a transfer corresponding to a different mode of transportation from being removed from the set of feasible transfers and increasing effectiveness of computing an optimal itinerary consistent with the user's desired mode of transportation, and

(a4) electronically outputting, using an electronic processor and electronic memory, the set of feasible transfers for computing at least one itinerary in the multimodal transportation network, the set of feasible transfers including transfers of all possible modes of transportation;

(b) receiving, after electronically preprocessing the set of feasible transfers, from a user, via a user interface, information corresponding to the user's desired mode of transportation;

(c) electronically determining, using an electronic processor and electronic memory, based upon the set of feasible transfers and the user's desired mode of transportation, a set of possible trips in a multimodal transportation network;

(d) electronically performing, using an electronic processor and electronic memory, a routing optimization algorithm so as to build at least one optimal itinerary, without losing an optimal itinerary corresponding to the user's desired mode of transportation, according to at least one criterion including an earliest arrival time, based upon the set of possible trips in the multimodal transportation network, the routing optimization algorithm electronically computing, using an electronic processor and electronic memory, a Pareto front; and

(e) outputting to the user, via the user interface, the at least one optimal itinerary for use by the user to plan a trip travelling in the multimodal transportation network.