Verfahren zur Vorverarbeitung eines Satzes von nicht Geplanten Linien Innerhalb eines Multimodalen Transportnetzwerks von Vorbestimmten Stationen und zur Berechnung mindestens einer Reiseroute von einem Abfahrtsort zu einem Ankunftsort

Details

Veröffentlichungs-Nr.

EP3745331

Aktenzeichen

EP19305689

Anmeldetag

29. Mai 2019

Veröffentlichung

25. Februar 2026

Erteilung

25. Februar 2026

Rechtsraum

EP

IPC

G06Q10/02

Abstract

The present invention relates to a method for preprocessing a set of non-scheduled lines within a multimodal transportation network of predetermined stations comprising the implementation of steps of: (a) for each non-scheduled line (I) of said set of non-scheduled lines, associating, to each station p l j <img class="EMIRef" id="683639907-ia01" /> of a sequence of stations (p(l)) defining said non-scheduled line (I), at least one time interval (I(l,j)) during which a trip on the non-scheduled line (I) can depart from said station p l j ; (b) For each first station p l j <img class="EMIRef" id="683639907-ia03" /> of a non-scheduled line (I) which is reachable from a second station p t i <img class="EMIRef" id="683639907-ia04" /> 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 said first station p l j <img class="EMIRef" id="683639907-ia05" /> after transferring is compatible with the at least one time interval (I(l,j)) associated to the second station p l j , <img class="EMIRef" id="683639907-ia06" /> the earliest transfer from said second station p t i <img class="EMIRef" id="683639907-ia07" /> on said trip (t) to the first station p l j ; (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. The present invention further related to a method for computing at least one itinerary from a departure location to an arrival location, each itinerary comprising a main part in a multimodal transportation network of predetermined stations, defined as a sequence of trips on scheduled or non-scheduled lines within the multimodal transportation network and transfers from a set of feasible transfers within the multimodal transportation network; the method comprising preprocessing the set of non-scheduled lines so as to obtain a set of transfers between scheduled lines and non-scheduled lines and performing a routing optimization algorithm so as to select at least one optimal itinerary according to at least one criterion comprising the earliest arrival time, when considering both trips on scheduled or non-scheduled lines; and transfers between trips from the set of feasible transfer.

Anmelder

Firma

Naver Corporation

Land

🇰🇷 Südkorea

Fachgebiete