Iterative Route Determination Without Graph Representation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing systems for determining routes in public transportation networks are inefficient when considering time-dependent factors and real-time changes, leading to increased computational time and inability to provide adequate alternative paths.
Innovation Solution
A method and system that iteratively determine routes between an origin and a destination without relying on graph representations, selecting the shortest path and alternative paths with arrival times within a threshold, using an iterative process to scan reachable stops and store relevant route information for efficient retrieval.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If graph-based path finding algorithms are used to determine routes in public transportation systems, then route determination can be performed, but computational time increases significantly when time dimension and real-time changes are added
Solution Approach 1:
The patent segments the route determination process into discrete time intervals (time buckets) and processes routes in rounds based on departure times. Instead of analyzing the entire network simultaneously, the system divides the problem into manageable time-based segments, allowing efficient processing of time-dependent public transportation routes without requiring full graph exploration.
Solution Approach 2:
The system implements periodic scanning of routes in discrete rounds, where each round processes routes departing within a specific time window. This periodic approach allows the system to efficiently handle real-time changes by periodically updating route information without requiring continuous reanalysis of the entire network, thus reducing computational time while maintaining accuracy.
2Productivity
If preprocessing techniques are applied to improve graph path finding efficiency, then computation time is reduced for static networks, but the techniques become useless for real-time updates as they require several hours to analyze data
Solution Approach 1:
The patent implements a dynamic route determination system that adapts to real-time changes in public transportation networks. Instead of using static preprocessing techniques, the system dynamically scans and updates route information in discrete rounds based on current departure times and real-time network changes, enabling both high productivity and real-time adaptability.
Solution Approach 2:
The system performs preliminary organization of route data by departure time and systematically scans routes in predetermined rounds. This preliminary structuring of data allows efficient real-time processing without requiring lengthy preprocessing, as the data is already organized for rapid sequential access and comparison during runtime.
3Productivity
If the RAPTOR algorithm is used to scan marked routes and identify shortest paths, then computation speed is improved, but alternative paths are overlooked to improve performance
Solution Approach 1:
The patent extends the RAPTOR algorithm to serve multiple functions: it not only identifies the shortest path but also systematically determines alternative paths by continuing the scanning process beyond the first shortest route. The same iterative scanning mechanism that finds optimal routes is reused to find alternative routes within acceptable time thresholds, providing multi-functionality without requiring separate algorithms.
Solution Approach 2:
Instead of stopping after finding the shortest path, the system continues the iterative scanning process to identify additional routes that meet alternative path criteria. This continuous action maintains computational efficiency while expanding the solution set to include multiple viable options, ensuring that the useful computational work continues to produce valuable alternative routes.
4Adaptability or versatility
If multiple variables are introduced such as walking to multiple points of origin, then route options increase, but required processing time becomes prohibitive
Solution Approach 1:
The patent incorporates walking segments as an additional dimension to the traditional public transportation route model. By allowing users to walk to nearby stops and combining this with transit segments, the system creates multi-modal routes without proportionally increasing processing time, as the walking portions are integrated into the existing time-bucketed scanning framework.
Data Source
AI summary
This document discloses a system that selects a path to reach a destination in a transportation network. The system receives information related to a public transportation network with multiple stops. Each stop includes at least one associated link with another stop. Each link represents a mode of transportation between two stops. When the system receives a request for routes between an origin and a destination within the transportation network, it will determine a set of routes between the origin and the destination using an iterative process without reference to a graph representation of the network. The system will select a shortest path that corresponds to the route having the earliest arrival time at the destination. The system will also select an alternative path that corresponds to a route having an arrival time that is no more than a threshold amount later than the earliest arrival time.