-
公开(公告)号：US20200378773A1
公开(公告)日：2020-12-03
申请号：US16830621
申请日：2020-03-26
申请人： Naver Corporation
摘要： A method preprocesses a set of non-scheduled lines within a multimodal transportation network of predetermined stations, by (a) for each non-scheduled line (l) of the set of non-scheduled lines, associating, to each station (plj) of a sequence of stations ({right arrow over (p)}(l)) defining the non-scheduled line (l), at least one time interval (I(l,j)) during which a trip on the non-scheduled line (l) can depart from the station (plj); (b) for each first station (plj) of a non-scheduled line (l) which is reachable from a second station (pti) of a scheduled line, adding to a set of feasible transfers between a scheduled line and a non-scheduled line, if there exists a trip (t) on the scheduled line such that a departure time at the first station (plj) after transferring is compatible with the at least one time interval (I(l,j)) associated to the first station (plj), the earliest transfer from the second station (pti) on the trip (t) to the first station (plj); and (c) outputting the set of feasible transfers between a scheduled line and a non-scheduled line for computing at least one itinerary in the multimodal transportation network.
-
2.发明授权公开(公告)号：US11803785B2
公开(公告)日：2023-10-31
申请号：US16700096
申请日：2019-12-02
申请人： Naver Corporation
IPC分类号： G06Q10/04 , G06Q50/30 , G06Q10/047 , G01C21/34 , G06Q10/0631 , G06Q10/10 , G06Q30/0283 , G06Q50/26
CPC分类号： G06Q10/047 , G01C21/3423 , G01C21/3453 , G06Q10/06312 , G06Q10/10 , G06Q30/0283 , G06Q50/26 , G06Q50/30
摘要： A method and system generate at least one itinerary from a departure location to an arrival location, each itinerary having a beginning part from the departure location to an initial station of a multimodal transportation network of predetermined stations, a main part in the multimodal transportation network, defined as a sequence of displacements each from a station of the multimodal transportation network to another, and an end part from a final station of the multimodal transportation network to the arrival location.
-
公开(公告)号：US11499836B2
公开(公告)日：2022-11-15
申请号：US16830621
申请日：2020-03-26
申请人： Naver Corporation
摘要： A method preprocesses a set of non-scheduled lines within a multimodal transportation network of predetermined stations, by (a) for each non-scheduled line (l) of the set of non-scheduled lines, associating, to each station (plj) of a sequence of stations ({right arrow over (p)}(l)) defining the non-scheduled line (l), at least one time interval (I(l,j)) during which a trip on the non-scheduled line (l) can depart from the station (plj); (b) for each first station (plj) of a non-scheduled line (l) which is reachable from a second station (pti) of a scheduled line, adding to a set of feasible transfers between a scheduled line and a non-scheduled line, if there exists a trip (t) on the scheduled line such that a departure time at the first station (plj) after transferring is compatible with the at least one time interval (I(l,j)) associated to the first station (plj), the earliest transfer from the second station (pti) on the trip (t) to the first station (plj); and (c) outputting the set of feasible transfers between a scheduled line and a non-scheduled line for computing at least one itinerary in the multimodal transportation network.
-
4.发明授权公开(公告)号：US12123725B2
公开(公告)日：2024-10-22
申请号：US17335402
申请日：2021-06-01
申请人： Naver Corporation
IPC分类号： G01C21/34
CPC分类号： G01C21/343 , G01C21/3423 , G01C21/3446
摘要： A method extends the Trip Based Public Transit Routing algorithm to compute personalized itineraries in a multimodal network based on custom transfer speed and maximum transfer duration. The customization is done at query time. The method modifies the pruning phase and the search phase of the Trip Based Public Transit Routing algorithm to obtain Pareto front for minimizing arrival time and number of transfers, along with one optimal solution per value in the Pareto front.
-
5.发明申请公开(公告)号：US20200234203A1
公开(公告)日：2020-07-23
申请号：US16700096
申请日：2019-12-02
申请人： Naver Corporation
IPC分类号： G06Q10/04 , G06Q50/30 , G06Q10/10 , G06Q50/26 , G06Q30/02 , G06Q10/06 , G06F16/2455 , G06F16/9537 , G01C21/34
摘要： A method and system generate at least one itinerary from a departure location to an arrival location, each itinerary having a beginning part from the departure location to an initial station of a multimodal transportation network of predetermined stations, a main part in the multimodal transportation network, defined as a sequence of displacements each from a station of the multimodal transportation network to another, and an end part from a final station of the multimodal transportation network to the arrival location.
-
公开(公告)号：US11768078B2
公开(公告)日：2023-09-26
申请号：US16853914
申请日：2020-04-21
申请人： Naver Corporation
IPC分类号： G01C21/34 , G06Q10/047
CPC分类号： G01C21/3446 , G01C21/343 , G01C21/3423 , G06Q10/047
摘要： A method creates a reduced set of feasible transfers T(t, L′) for a trip t of line L, for each target line L′ from a set of all transfers from line L to all other lines, by computing, for each origin line L, feasible transfers between stations of the origin line L and a destination line L′; sorting the computed feasible transfers to create a transfer set T(L); determining, for each trip t of origin line L, and for each transfer in the transfer set T(L), an earliest trip t′ of L′ wherein the transfer is feasible; and adding, for each trip t of origin line L, the determined transfer from t to t′ to the reduced set of feasible transfers T(t, L′) when trip t′ is the only destination trip of the transfers in the reduced set of feasible transfers T(t, L′) passing at the destination station and when it is earlier than all the previous destination trips of the transfers in the reduced set of feasible transfers T(t, L′) passing by the destination station.
-
7.发明公开公开(公告)号：US20230196215A1
公开(公告)日：2023-06-22
申请号：US17878336
申请日：2022-08-01
申请人： Naver Corporation
CPC分类号： G06Q10/025 , G06Q50/30
摘要： A method and system for preprocessing and query stages for a trip-based public transit routing algorithm, which is used for multimodal routing computations, clusters the public transit network and computes relevant network parts when transiting between different clusters in order to prune the search at query time. The processing phase is modified to use only a subset of the network, depending on the clusters associated to the origin and destination locations.
-
8.发明申请公开(公告)号：US20220057217A1
公开(公告)日：2022-02-24
申请号：US17335402
申请日：2021-06-01
申请人： Naver Corporation
IPC分类号： G01C21/34
摘要： A method extends the Trip Based Public Transit Routing algorithm to compute personalized itineraries in a multimodal network based on custom transfer speed and maximum transfer duration. The customization is done at query time. The method modifies the pruning phase and the search phase of the Trip Based Public Transit Routing algorithm to obtain Pareto front for minimizing arrival time and number of transfers, along with one optimal solution per value in the Pareto front.
-
公开(公告)号：US20210325194A1
公开(公告)日：2021-10-21
申请号：US16853914
申请日：2020-04-21
申请人： Naver Corporation
摘要： A method creates a reduced set of feasible transfers T(t, L′) for a trip t of line L, for each target line L′ from a set of all transfers from line L to all other lines, by computing, for each origin line L, feasible transfers between stations of the origin line L and a destination line L′; sorting the computed feasible transfers to create a transfer set T(L); determining, for each trip t of origin line L, and for each transfer in the transfer set T(L), an earliest trip t′ of L′ wherein the transfer is feasible; and adding, for each trip t of origin line L, the determined transfer from t to t′ to the reduced set of feasible transfers T(t, L′) when trip t′ is the only destination trip of the transfers in the reduced set of feasible transfers T(t, L′) passing at the destination station and when it is earlier than all the previous destination trips of the transfers in the reduced set of feasible transfers T(t, L′) passing by the destination station.
-
10.发明申请公开(公告)号：US20200378772A1
公开(公告)日：2020-12-03
申请号：US16830609
申请日：2020-03-26
申请人： Naver Corporation
摘要： 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 (pti) of the origin trip (t), computing at this station (pti) 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 (pti) on the origin trip (t) to a reachable station (puj) on a target trip (u), computing, at each station (puk>j) of the target trip (u) after the reachable station (puj), a value of the earliest arrival/change time specifically associated with the transportation mode (mu) 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.
-
-
-
-
-
-
-
-
-
搜索结果
10 条记录 (耗时 0.017 秒)
