主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

Chinese Journal of Management Science ›› 2025, Vol. 33 ›› Issue (11): 93-102.doi: 10.16381/j.cnki.issn1003-207x.2023.0911

Previous Articles     Next Articles

Optimization of Outbound Relocating for Four-way Shuttle System Based on Improved A* Algorithm

Yunfeng Ma1,2(), Cong Sheng1,3, Xijie Yang1, Liang Ren1, Zhigang Zhou4   

  1. 1.School of Evergrande Management,Wuhan University of Science and Technology,Wuhan 430065,China
    2.Center for Service Science and Engineering,Wuhan University of Science and Technology,Wuhan 430065,China
    3.Yangtze Memory Technologies Co. ,Ltd,Wuhan 430078 China
    4.Hubei Puluoge Technology Co. ,Ltd,Wuhan 430000,China
  • Received:2023-06-05 Revised:2023-08-14 Online:2025-11-25 Published:2025-11-28
  • Contact: Yunfeng Ma E-mail:mayunfeng@wust.edu.cn

Abstract:

A new type of storage and retrieval system based on shuttles, known as the four-way shuttle storage system, is introduced, which is assured to meet the high demand for inbound and outbound capabilities for massive orders in e-commerce environments. The performance of the four-way shuttle system can be enhanced by the establishment of dual-end inbound and outbound ports, and outbound efficiency can be improved through sequential picking. The feature of the system having multiple depth could cause relocation during the retrieval process. It starts from practical application scenarios in this paper. The existing research mainly focuses on the congestion issues related to single-end entry and exit in traditional automated warehouses, as well as the relocation problem of container yards. Therefore, in a dual-end output four-way shuttle system, the selection of suitable relocation and landing operations to minimize the total number of relocations is deemed critical.The shortest path approach is adopted in this paper to address the ordered dual-end outbound relocating problem with limited conditions in the four-way shuttle storage system, aiming to minimize the number of relocations. The state of each block after each relocation operation is treated as a node, and heuristic upper bounds and evaluation functions are designed to enhance the A* algorithm for finding the optimal solution to the shortest path problem.Numerical experiments were performed on a large scale, with various system layouts generated in different test cases. The results indicate that the improved A* algorithm, when compared to the heuristic algorithm HEUR based on the optimal lane rules, reduced the average number of relocations by 16.62%. The number of relocations can be further reduced by rectangular layouts under the same scale, and the number of relocations can be decreased by an average of 70.43% with a dual-end outbound layout compared to a single-end outbound layout. The algorithm's optimization effect improves as the system size increases, and the negative correlation between storage density and the number of relocations gradually weakens.

Key words: four-way shuttle system, relocation, dual-end outbound, heuristic upper bound, improved A* algorithm

CLC Number: