Route Optimization With Transfer Points for Multi-Resource Transport
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing logistical challenges in transporting objects and people include ensuring uninterrupted refrigeration, compliance with driving and rest time regulations, efficient use of parking spaces, and minimizing energy consumption, while also addressing security risks and environmental impact.
Innovation Solution
A computer-implemented method and hardware module that determine a route by characterizing transport resources, including vehicles and drivers, and optimizing the route based on transfer locations and times, using an optimization algorithm to select the fastest, safest, and most cost-effective path, allowing for 'flying changes' among drivers and vehicles.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If multiple intermediate destinations are included to serve multiple clients, then more destinations are reached on a single route, but the total route length and transport time increase
Solution Approach 1:
The patent divides the transport task into multiple independent transport orders, each with its own optimized route. Instead of combining multiple destinations into one route, the system segments them into separate orders that can be executed independently or in parallel, thereby avoiding the time penalty of serving multiple destinations in sequence while maintaining high productivity through efficient resource allocation across segmented tasks.
2Reliability
If the object is secured at the transfer point, then theft and damage are prevented, but security risks remain and additional time is required
Solution Approach 1:
The patent replaces mechanical security systems (physical securing of the object at transfer points) with an electronic key management system. The centralized server manages digital keys that are automatically distributed to authorized vehicles, eliminating the need for physical securing operations while maintaining security and reducing transfer time through automated key distribution and verification.
3Reliability
If driving time limits are strictly observed, then driver strain is reduced and regulations are complied with, but transport time to destination increases
Solution Approach 1:
The patent dynamically optimizes route planning by integrating driver working time regulations directly into the routing algorithm. The system calculates routes that maximize driving time within legal limits while minimizing total transport time, automatically planning rest periods and driver rotations. This dynamic approach ensures full regulatory compliance while achieving the fastest possible transport times within those constraints.
4Object-affected harmful factors
If existing parking spaces are utilized efficiently, then expansion costs are avoided and environmental impact is reduced, but parking space availability decreases with increased traffic
Solution Approach 1:
The patent implements a universal parking space management system where parking spaces are dynamically allocated and shared across multiple carriers and transport orders. The centralized server optimizes parking space utilization by assigning spaces based on real-time needs, allowing the same parking infrastructure to serve multiple purposes and multiple users efficiently, thereby avoiding the need for additional parking expansion while accommodating increased traffic volume.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
The invention relates to a computer-implemented method and a hardware module for determining a route, the method comprising the steps of: providing a data structure that characterizes two or more transport resources, wherein each transport resource is at least one vehicle, at least one driver, at least one suitability of the vehicle, or...The process includes: the driver's input for transporting an object, a current location of the transport resource and/or a projected location of the transport resource; receiving a route input, wherein the route input characterizes an object to be transported and a start and destination of the object; determining two or more transport resources for transporting the object from the start to the destination; determining a transfer location and/or a transfer time range for transferring the object to be transported from a transferring transport resource to a receiving transport resource of the two or more determined transport resources; and determining, by means of an optimization algorithm, at least one route from the start to the destination based on the transfer location and/or the transfer time range.