Dynamic Minimum Connecting Time Estimation for Journey Planning
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current journey planning systems fail to account for potential delays in calculating minimum connection times, leading to travelers missing connections or arriving late at their destinations, despite efforts to communicate delays in real-time after they occur.
Innovation Solution
The system dynamically estimates minimum connecting times using statistical delay information from past journeys, ensuring that only journey options with connections meeting these estimated times are selected, thereby reducing the risk of missed connections and late arrivals.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If a static minimum connection time is used to limit total travel duration, then the journey planning efficiency is improved, but the reliability of connection timing deteriorates because delays are not considered
Solution Approach 1:
The patent transforms the static minimum connection time into a dynamic value that adapts based on delay conditions. The system calculates different minimum connection times depending on whether the first segment is delayed, allowing the connection time requirement to adjust dynamically to actual travel conditions rather than using a fixed predetermined value
Solution Approach 2:
The system performs preliminary assessment of delay conditions for the first segment before finalizing the journey plan. By evaluating whether delays are expected and calculating the appropriate minimum connection time in advance, the system prepares appropriate buffer times before connections occur, preventing missed connections rather than reacting after delays happen
2Productivity
If the minimum connection time is reduced to optimize journey speed, then the productivity of travel is improved, but the risk of missing connections increases due to unaccounted delays
Solution Approach 1:
The patent changes the parameter of minimum connection time based on delay conditions. When no delays are expected, a shorter minimum connection time is applied to maintain fast travel. When delays are detected in the first segment, the minimum connection time is extended to ensure reliable connections, thus adapting the parameter to actual conditions rather than using a fixed value
3Measurement precision
If real-time delay information is provided to travelers after delays occur, then the information accuracy is improved, but the usefulness for preventing missed connections deteriorates because the information is delivered too late
Solution Approach 1:
The system performs preliminary assessment of delay conditions by evaluating whether delays are expected to occur in the first segment before the journey is finalized. This advance evaluation allows the system to adjust minimum connection times proactively, enabling travelers to make informed decisions before delays impact their connections rather than providing information after delays have already occurred
Data Source
AI summary
Methods, systems, and computer program products for generating journey options in response to a journey request from an origin to a destination. Routes from the origin to the destination are selected as candidates to fulfill the journey request. Delay-related statistical information is derived from delay-related data for past journeys. A minimum connecting time at a connection between first and second segments of each route is estimated based on the statistical information. Journey combinations are determined from the routes based on origin departure time, destination arrival time, and schedule information for the first and second segments of each route. For each route in each journey combination, a determination is made whether the schedule information for the first and second segments satisfies a condition related to the minimum connecting time. Each journey combination for which the condition is satisfied by each route comprising the journey combination is selected as a journey option.