Diversified Route Planning for Public Transit Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Users of public transportation networks face difficulties in selecting appropriate routes due to the complexity of extensive networks with various services and time constraints, as existing systems fail to consider multiple criteria such as travel time, number of transfers, and user preferences effectively.
Innovation Solution
A computer-implemented method and system that generates diversified k shortest paths for public transportation routes based on user input parameters, including origination and destination nodes, departure time, and preferences, using a transportation graph with cost information and transport schedules, displayed on a user device.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If a public transportation network includes numerous services and lines to provide extensive coverage, then the network offers users numerous options to reach their destination, but it becomes complicated for users to select an appropriate option based on time and preferences
Solution Approach 1:
The patent introduces a route planning system as an intermediary between the complex transportation network and the user. This system automatically processes multiple criteria (travel time, number of transfers, user preferences) and presents simplified route options, resolving the contradiction by mediating the information overload without reducing network coverage
Solution Approach 2:
The system incorporates user feedback mechanisms where users can rate or select preferred routes, and the system learns from this feedback to improve future recommendations. This creates a closed-loop system that adapts to user preferences while managing the complexity of extensive networks
2Productivity
If the system provides only the single shortest path, then the computation is simple and fast, but the user lacks alternative options when time constraints or preferences change
Solution Approach 1:
The system pre-calculates and stores multiple potential routes (k shortest paths) along with their associated costs and characteristics. When a user queries for routes, the system can quickly retrieve pre-computed alternatives rather than calculating them in real-time, thus providing both speed and diversity of options
Solution Approach 2:
The system varies the parameters of route evaluation by considering multiple criteria simultaneously (travel time, number of transfers, user preferences) rather than a single parameter. This allows the generation of diverse route options that satisfy different user needs while maintaining computational efficiency through structured parameter optimization
3Reliability
If the system considers multiple criteria such as travel time, number of transfers, and user preferences, then the route suggestions improve user satisfaction, but the computational complexity increases
Solution Approach 1:
The patent segments the route planning problem into distinct components: graph construction, cost calculation, path finding, and result presentation. Each component handles specific aspects of multi-criteria evaluation independently, reducing overall computational complexity while maintaining comprehensive consideration of multiple factors
Solution Approach 2:
The system computes k shortest paths where k is a configurable parameter that balances computational effort with the need for alternative options. Rather than exhaustively evaluating all possible routes, the system computes a sufficient number of high-quality alternatives that meet user needs without unnecessary computational overhead
Data Source
AI summary
A route planner for a transportation network is disclosed. The route planner generates k suggested routes based on a user query using a diversified k shortest routes technique. The diversified k shortest routes techniques analyzes a transportation graph and suggests k routes to the user. The diversified k shortest routes can provide a user with options to take the next best route if they miss the optimal one. These options also include other preferences, such as less number of transfers, as long as they are reasonable in terms of total travel time. The suggested routes take into account travel calendars, as well as location-to-location queries which require geocoding and reverse geocoding capabilities. Transfers between different types of transportation services such as train and bus are also supported.