Route Optimization Clustering Genetic Algorithms

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Traditional route optimization techniques become computationally intensive and impractical when dealing with large numbers of waypoints, taking hours, days, weeks, or even years to develop adequate solutions.

Innovation Solution

Implementing genetic algorithm techniques to break down large waypoint sets into clusters, optimize subsets individually, and use a fitness function to evaluate and refine routing solutions, significantly reducing computation time.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If traditional route optimization techniques are used, then route optimization accuracy can be maintained, but computation time becomes excessively long when dealing with large numbers of waypoints

Engineering Contradiction:
Improveroute optimization accuracyVSAvoidcomputation time
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The patent divides the large set of waypoints into multiple clusters or groups, and optimizes each cluster separately using traditional optimization techniques. This segmentation allows the system to maintain optimization accuracy for each subset while significantly reducing the overall computation time compared to optimizing all waypoints simultaneously.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces a hierarchical optimization approach that adds a temporal dimension to the optimization process. Instead of a single-pass optimization, the system performs multiple passes: first clustering waypoints, then optimizing each cluster, and finally refining the overall route. This multi-dimensional approach transforms the computationally intensive single problem into a series of smaller, manageable sub-problems.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

2Adaptability or versatility

If the number of waypoints in a route increases, then route coverage and service capability improve, but traditional optimization techniques become computationally infeasible

Engineering Contradiction:
Improveroute coverageVSAvoidcomputation complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

By segmenting the waypoint set into clusters, the system can handle large numbers of waypoints without overwhelming computational resources. Each cluster is optimized independently, allowing the system to scale to larger route coverage while keeping the computational complexity of each optimization task manageable.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent applies optimization rigorously to each clustered subset of waypoints rather than attempting exhaustive optimization of the entire waypoint set. This partial action approach achieves sufficient optimization for practical purposes while avoiding the computational infeasibility of complete optimization, enabling the system to handle larger numbers of waypoints.

Inventive Principle:
Principle #16Partial or excessive action

Data Source

PatentUS11193776B2Route optimization systems and methods
Publication Date: 2021.12.07 TERRITOOL LLC
  • US11193776B2 patent drawing
  • US11193776B2 patent drawing

AI summary

This application describes systems and methods directed to route optimization for routes comprising large numbers of waypoints. When large numbers of waypoints make up a route, developing an optimized route can be computationally intensive, requiring far too much time to develop a solution that is practicable for most needs. Thus, systems and methods of the inventive subject matter involve grouping subsets of waypoints into clusters and then optimizing those clusters according to genetic algorithm development techniques. The end result is a highly optimized route developed in an amount of time that would have been impossible using standard techniques.