Logistics Server Route Graph Generation for Mobile Fuel Supply
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing methods for fuel supply between mobile objects often result in increased travel distances for both the supply and reception mobile objects, leading to inefficient routes and longer travel times.
Innovation Solution
An information processing device that acquires map and position information to generate route graphs with refueling scheduled positions, determining the shortest travel distance route for supply and reception mobile objects, and generating control information to optimize their paths, thereby reducing travel distance and time.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a supply position is previously set and included in the delivery route, then the fuel supply can be executed, but the travel distance of the supply mobile object and the reception mobile object becomes long
Solution Approach 1:
The patent applies dynamics by making the route plan flexible rather than fixed. The control unit dynamically adjusts the route by selecting from multiple alternative routes based on real-time positions and statuses of mobile objects. The route graph is generated with multiple options, allowing the system to adapt to changing conditions and minimize travel distance while ensuring fuel supply execution.
Solution Approach 2:
The patent changes the parameter of route selection by generating multiple route graphs with different paths and selecting the optimal one. The system varies the route parameters (distance, time, sequence) to find the best combination that satisfies fuel supply requirements while minimizing travel distance. The control unit selects routes based on calculated travel distances and thresholds.
2Loss of time
If the route is optimized to shorten travel distance, then the travel time is reduced, but the complexity of route calculation and control increases
Solution Approach 1:
The patent segments the route calculation process into distinct components: generating multiple alternative routes, calculating travel distances for each route, comparing routes against thresholds, and selecting the optimal route. This segmentation allows the complex problem to be solved through a series of simpler, manageable steps rather than a single complex optimization.
Solution Approach 2:
The control unit acts as an intermediary that manages the complexity between the route generation process and the mobile objects. It receives multiple route options, performs the selection based on travel distance criteria, and outputs the chosen route to the mobile objects. This intermediary handles the computational complexity centrally, keeping the individual mobile objects' control simple.
Data Source
AI summary
A logistics management server includes an acquisition unit that acquires map information, position information on a supply mobile object, position information on a reception mobile object, and delivery position information and a control unit that generates a plurality of route graphs including a plurality of refueling scheduled positions based on the map information, the position information on the supply mobile object, the position information on the reception mobile object, and the delivery position information, determines a route graph of a route in which a travel distance of the supply mobile object and the reception mobile object is the shortest, a route graph of a route in which the travel distance is less than or equal to a predetermined threshold value, or a route graph of a route determined based on an ordinal rank corresponding to the travel distance out of the plurality of route graphs, and generates control information.


