Multimodal Itinerary Routing with Preprocessed Non-Scheduled Transfers
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing journey planners struggle to efficiently compute itineraries that combine scheduled and non-scheduled transportation modes in multimodal networks, as current algorithms like the Trip-Based Public Transit Routing algorithm do not account for non-scheduled modes such as bike-sharing or on-demand buses, leading to inefficient and time-consuming searches.
Innovation Solution
A method that preprocesses non-scheduled lines within a multimodal transportation network by simulating schedules for these modes and integrating them with scheduled lines, pruning unnecessary transfers to optimize the search for itineraries that include both types of transportation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If the complete set of feasible transfers between trips is used during the search phase, then all possible itineraries can be explored, but the exploration time increases significantly due to the large number of useless arcs
Solution Approach 1:
The patent applies preliminary action by performing preprocessing before the search phase to identify and store only the relevant feasible transfers. During preprocessing, the algorithm computes and prunes the set of feasible transfers between trips, keeping only those that can potentially belong to an optimal path. This pre-computed pruned set is then used during the search phase, avoiding the need to evaluate all possible transfers and thus significantly reducing exploration time while maintaining completeness.
2Adaptability or versatility
If non-scheduled transportation modes are integrated into the multimodal network, then the versatility of journey planning is enhanced, but the complexity of computing itineraries increases
Solution Approach 1:
The patent handles non-scheduled transportation modes by applying preliminary action through preprocessing. During preprocessing, the algorithm computes feasible transfers involving non-scheduled modes and prunes this set to retain only relevant transfers. This pre-computation transforms the complex problem of handling non-scheduled modes during real-time query into a manageable pre-processed dataset, reducing computation complexity during actual itinerary requests.
Solution Approach 2:
The patent uses an intermediary approach by introducing a preprocessing layer that acts as a mediator between the complex multimodal network (including non-scheduled modes) and the itinerary computation algorithm. The preprocessing step creates a simplified representation of feasible transfers that captures the essential connectivity information while filtering out unnecessary complexity, making the subsequent search more efficient.
3Device complexity
If the TB algorithm is restricted to only transit and walking between stations, then the algorithm remains simple, but it cannot combine with non-scheduled modes like bike or car-sharing
Solution Approach 1:
The patent applies universality by extending the TB algorithm framework to handle multiple transportation modes uniformly. The preprocessing step computes feasible transfers for all mode combinations (transit-transit, transit-walking, transit-bike sharing, transit-car sharing, etc.) using a unified approach. This allows the algorithm to maintain its core simplicity while becoming universally applicable to diverse transportation modes through the generalized preprocessing procedure.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
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 plj 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 plj; (b) For each first station plj of a non-scheduled line (I) 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 said first station plj after transferring is compatible with the at least one time interval (I(l,j)) associated to the second station plj, the earliest transfer from said second station pti on said trip (t) to the first station plj; (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.