Dynamic Route Optimization with Trailer Loading Feasibility Check
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Manual techniques for updating route plans in response to change requests are inefficient and complex, leading to potential infeasibility in route and load plans, particularly in meeting promised dates and times.
Innovation Solution
A dynamic single route optimization system that automatically integrates stop changes and conducts trailer loading feasibility checks, using a computer system to generate updated route plans based on input parameters and scenario specifications, ensuring compliance with constraints and optimizing stop sequencing, route start times, and dock out times.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If manual techniques are used to update route plans, then flexibility in handling change requests is maintained, but efficiency and complexity increase significantly
Solution Approach 1:
The patent replaces manual mechanical processes with an automated computer system that uses optimization algorithms to handle route plan updates. The system automatically processes change requests, adjusts routes, and conducts feasibility checks without manual intervention, thereby maintaining flexibility while significantly improving efficiency.
Solution Approach 2:
The system dynamically changes parameters such as route sequencing, stop times, and dock out times based on change requests. By automatically adjusting these parameters through optimization algorithms, the system maintains operational flexibility while improving productivity through automated parameter modification.
2Adaptability or versatility
If manual techniques are used for route plan updates, then adaptability to change requests is preserved, but the complexity of modifications increases
Solution Approach 1:
The patent replaces complex manual modification processes with an automated computer system that uses optimization algorithms. This substitution reduces the complexity of modifications by automatically handling the intricate adjustments required when change requests are processed.
Solution Approach 2:
The system performs self-service by automatically processing change requests and generating updated route plans without requiring manual intervention. The optimization algorithm independently handles the complexity of modifications, making the system adaptable to change requests while reducing modification complexity.
3Ease of operation
If manual techniques are used to meet promised dates and times, then flexibility in scheduling is maintained, but efficiency decreases
Solution Approach 1:
The patent replaces manual scheduling processes with an automated optimization system that quickly generates updated route plans. This substitution maintains scheduling flexibility while significantly reducing the time required for updates through automated calculation and optimization.
Solution Approach 2:
The system conducts preliminary feasibility checks and optimization calculations before finalizing route updates. By performing these actions in advance, the system maintains scheduling flexibility while reducing overall update time through pre-computed optimizations.
Data Source
AI summary
A system comprising one or more processors and one or more non-transitory computer-readable media storing computing instructions, that when executed on the one or more processors, cause the one or more processors, to perform functions comprising: receiving, by an application programing interface (API), a change request for a route plan, wherein the change request is subject to a scenario specification and a load feasibility specification; determining an updated route plan based on whether the change request for the route plan is a feasible route based on the scenario specification and the load feasibility specification, and the route stop time is the route start time is flexible; and outputting the updated route plan and, when the route stop time is flexible, outputting the route start time. Other embodiments are disclosed.


