Route Search System Using Pre-calculated Node Segments
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing route search systems require significant processing time and resources due to the increasing number of representative nodes and distances between them, making it inefficient for calculating delivery routes.
Innovation Solution
A route search system that receives and processes route requests efficiently by storing and referencing route correspondence information, using traffic information, and reducing the number of search points through map matching and candidate node selection, thereby minimizing the number of route calculations and data transmissions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If the number of representative nodes and distances between them increase to improve route search coverage, then the accuracy and completeness of route information is improved, but the processing time required to calculate routes increases significantly
Solution Approach 1:
The patent applies preliminary action by pre-calculating and storing route information between representative nodes before actual route search requests are made. The route search unit retrieves previously calculated route correspondence information from storage, avoiding repeated complex calculations. This allows the system to maintain comprehensive route data for accurate searches while significantly reducing the time required for actual route queries.
2Loss of information
If route calculations are performed for all combinations of points to ensure complete route information, then the completeness of route data is improved, but the number of calculations and processing load increases
Solution Approach 1:
The patent extracts and stores only the essential route correspondence information between representative nodes in a dedicated storage unit. Instead of maintaining all possible route combinations, the system extracts key route segments that can be combined to form complete delivery routes. This extraction approach ensures route data completeness while significantly reducing the computational burden.
Solution Approach 2:
The patent segments the route search problem into two parts: (1) pre-calculated route segments between representative nodes, and (2) dynamic combination of these segments for specific delivery points. By segmenting the problem, the system maintains complete route information through pre-computed segments while improving productivity by avoiding recalculation of all routes for each query.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A route search system 1 includes: a reception means 14 for receiving a search request for a plurality of first routes, that are routes between all the combinations of two of a plurality of points; a search means 16 for, when the search request is received by the reception means 14, searching the plurality of first routes based upon a search condition included in the search request; and a supply means 17 for transmitting route information for the plurality of first routes searched by the search means 16. Both a number of times the search request is received by the reception means, and a number of times route information is transmitted by the supply means 17, are smaller than a number of points in the plurality of points.