Travel Route Generation With Incremental Weight Matrices
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The demand-responsive transport system faces challenges in efficiently generating optimal routes due to the exponential increase in possible routes as the number of points to visit increases, leading to high computational complexity and time requirements.
Innovation Solution
A method and apparatus that utilize a weight matrix to record and update estimated travel times between group points, employing multi-point-to-point and point-to-multi-point route finding methods to reduce computational power and time by maintaining previously calculated times without updating them.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the number of points to be visited increases, then the completeness of route coverage is improved, but the computational complexity increases exponentially
Solution Approach 1:
The patent divides the set of points to be visited into multiple groups, where each group contains a subset of points. Instead of calculating all possible routes for the entire set at once (which would be n! routes), the system calculates routes for smaller groups separately (e.g., k1! + k2! + ... where k1 + k2 + ... = n), significantly reducing computational complexity while still covering all points.
Solution Approach 2:
The patent pre-calculates and stores route information for smaller groups of points before combining them. By preparing route data for individual groups in advance and storing it in a weight matrix, the system avoids recalculating these routes when combining groups, thereby reducing the overall computational burden for generating complete multi-point routes.
2Manufacturing precision
If all possible routes are calculated to ensure optimal route selection, then the route optimization quality is improved, but the time required increases exponentially
Solution Approach 1:
The patent segments the route calculation process into multiple stages: first calculating optimal routes for smaller groups of points independently, then combining these group routes to form the complete multi-point route. This segmentation allows the system to find optimal solutions without evaluating all possible permutations of the entire point set, thus reducing calculation time while maintaining optimization quality.
Solution Approach 2:
The system performs preliminary calculations for smaller route segments and stores the results in a weight matrix that includes travel times and costs between all pairs of points. When generating the complete route, the system uses these pre-calculated values instead of recalculating them, significantly reducing the time required to find optimal multi-point routes while ensuring optimality through systematic combination of segment routes.
3Measurement precision
If the weight matrix is updated with new point information, then the route accuracy is improved, but the computational overhead increases
Solution Approach 1:
The patent updates the weight matrix selectively rather than recalculating all route information. When new point information becomes available (such as additional points or updated travel times), the system performs partial updates only for the affected portions of the matrix, leaving unchanged portions intact. This approach maintains route accuracy for affected areas while avoiding the computational overhead of complete recalculation.
Data Source
AI summary
The present disclosure relates to a method and apparatus for generating a travel route. The method according to an embodiment of the present disclosure may include obtaining first information related to first group points, calculating first estimated required times for moving between the first group points, based on the first information, and recording the first estimated required times in a first area of a weight matrix.In addition, the method may further include obtaining second information related to a second group point, calculating, based on the first information and the second information, second estimated required times including estimated required times for moving from the first group points to the second group point, and estimated required times for moving from the second group point to the first group points, and recording the second estimated required times in a second area of the weight matrix.In addition, the method may further include generating a travel route based on the first estimated required times and the second estimated required times.