A Two-Stage Path Planning Method for the Rearrangement Problem in Modular Puzzle-Based Storage System

The modular puzzle-based storage system consists of multiple storage modules. The system has multiple input/output (IO) points which can simultaneously deal with multiple orders in one batch. When a batch of orders comes in advance, it is necessary to rearrange the items near each IO point to reduce...

Full description

Saved in:
Bibliographic Details
Published in:Mathematical problems in engineering 2021, Vol.2021, p.1-16
Main Authors: Guo, Penghui, Xiao, Fei, Rui, Wanzhi, Jia, Zhengrong, Xu, Jin
Format: Article
Language:English
Subjects:
Automation
Heuristic
Integer programming
Modular systems
Modules
Optimization
Path planning
Planning
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The modular puzzle-based storage system consists of multiple storage modules. The system has multiple input/output (IO) points which can simultaneously deal with multiple orders in one batch. When a batch of orders comes in advance, it is necessary to rearrange the items near each IO point to reduce the picking time of customers. To complete the rearrangement quickly, this paper proposes a two-stage path planning method considering the simultaneous movement of multiple items. This method includes two stages: planning single moves and merging single moves. In the first stage, the sequence of single moves of each module needs to be obtained so as to convert the system from an initial state to a target state. In the second stage, the single moves in the sequence are merged into block moves and parallel moves to reduce the steps of movement. The simulation results show that the single move planning method can be used to solve the rearrangement problem stably and effectively and that the single move merging method can greatly optimize the experimental results with the optimization rate more than 50% in different configurations.
ISSN:1024-123X
1563-5147
DOI:10.1155/2021/6626569