Warehouse Work Plan Segmentation for Dual-Direction AGV Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In large warehouses with numerous article shelves, preparing an efficient work plan for simultaneous pickup and return work using a traveling machine like an AGV is complex due to limited capacity and extensive shelf arrangements.
Innovation Solution
A work plan preparation program that optimizes the path of an AGV by performing both a first search to minimize total moving distance along aisles and a second search to minimize distance between columns, dividing the work plan into subplans, and combining optimization results from both searches.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If a single optimization search is performed for pickup-return work in large warehouses, then the calculation process is simple, but the total moving distance cannot be minimized effectively due to the complex shelf arrangements and limited AGV capacity
Solution Approach 1:
The patent divides the pickup-return work plan into multiple subplans, each corresponding to different search directions (first search along aisle extension direction, second search between column directions). This segmentation allows the complex optimization problem to be broken down into manageable subproblems that can be solved independently and then combined, resolving the contradiction between optimization efficiency and calculation complexity.
2Productivity
If the work plan is divided into multiple subplans and both first search and second search are executed on each subplan, then the total moving distance is minimized effectively, but the calculation time and processing complexity increase
Solution Approach 1:
The patent performs preliminary division of the work plan into subplans before executing the dual optimization searches. By pre-organizing the work plan into manageable subplans with clear directional focuses, the system prepares the data structure in advance to enable efficient parallel or sequential processing of multiple searches, reducing the overall calculation time despite performing multiple optimization passes.
3Ease of operation
If the AGV placement space capacity is limited, then the AGV can be easily controlled and managed, but the number of articles that can be processed in one trip is restricted, requiring more trips and increasing total moving distance
Solution Approach 1:
The patent dynamically adjusts the work plan based on the AGV's limited placement space capacity. The optimization algorithm considers the capacity constraint when generating subplans and assigning articles to trips, creating flexible routing solutions that maximize the utilization of available space while maintaining ease of control. The system adapts the number of trips and article distribution dynamically rather than using fixed rigid patterns.
Data Source
AI summary
A recording medium stores a program for causing a computer to execute a process including: under a condition regarding articles, columns including article shelves, and aisles provided between the columns, and a moving body that has a placement space moves on the aisles, moves the aisles, and performs a first work of placing first articles on the moving body from the article shelves, and a second work of placing second articles placed on the moving body on the article shelves, executing, on a work plan in which the moving body performs the first work and the second work on the articles, either a first search of searching for the work plan so as to decrease a total moving distance in a direction or a second search of searching for the work plan so as to decrease the total moving distance between the columns, and dividing the work plan into subplans.