Route Planning Elliptical Perimeter Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing route-finding technologies fail to efficiently incorporate multiple points of interest into a travel route, leading to suboptimal travel commitments in terms of time and distance, and often result in excessive computational delays.
Innovation Solution
The implementation of a process that identifies an advanced route by selecting locations within an elliptical perimeter around a preliminary route, ensuring each user-identified point of interest is included, and optimizing the order and selection of these locations to minimize travel commitment, using a combination of user interfaces and geographic mapping techniques.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If existing route-finding technologies are used to incorporate multiple points of interest, then the route can include multiple stops, but the computational delay increases excessively
Solution Approach 1:
The patent segments the route planning process into distinct phases: first determining a preliminary route between origin and destination, then independently identifying points of interest along this preliminary route. This segmentation allows the system to handle multiple points of interest without excessive computational delay by breaking down the complex routing problem into manageable steps.
Solution Approach 2:
The patent employs preliminary action by first establishing a preliminary route before incorporating specific points of interest. This preliminary route serves as a framework that guides the subsequent selection and integration of multiple stops, reducing the computational complexity of finding optimal routes that pass through all desired locations simultaneously.
2Adaptability or versatility
If existing route-finding technologies are used to incorporate multiple points of interest, then the route can include multiple stops, but the travel commitment (time and distance) increases
Solution Approach 1:
The patent applies local quality by selecting points of interest that are locally optimal along the preliminary route. Instead of requiring globally optimal routes that pass through all specified locations in any order, the system identifies points of interest at specific locations along the preliminary route, allowing users to visit multiple stops with minimal additional travel commitment by choosing locations that are conveniently positioned along the way.
3Loss of time
If a route is optimized to pass through multiple specific locations, then the travel commitment is minimized, but the computational complexity increases
Solution Approach 1:
The patent segments the computational task into two independent parts: first calculating the preliminary route using standard routing algorithms, then identifying points of interest along this pre-established route. This segmentation significantly reduces computational complexity compared to solving the complete routing problem with multiple constraints simultaneously, while still achieving minimized travel commitment for the given points of interest.
Data Source
AI summary
A computer-implemented method for identifying a route that is configured to travel through multiple points of interest includes receiving a query that includes an origin location, a destination location, and at least a first point of interest and a second point of interest. The method also includes identifying a perimeter that surrounds the received origin and destination locations in response to the query. The perimeter is then used to identify a set of locations for each of the first and second points of interest.