181 / 2024-04-22 19:58:58

An overview of efficient algorithms for order retrieval in compact storage systems

Compact Storage Systems,Scheduling,Algorithm

The compact storage system can effectively enhance the utilization of land resources, enabling better responsiveness to the needs of mass customization era. Initially, investigations into compact storage systems were primarily analytical, focusing on assessing systems’ overall performance and exploring potential application scenarios. However, with the increasing complexity of compact storage systems and the growing demand for prompt order fulfillment, order retrieval scheduling capability has emerged as a crucial factor in improving efficiency in warehouse. This shift has garnered considerable attention among scholars. In recent studies, we have extensively investigated retrieval and reshuffling scheduling problems pertaining to compact warehouse systems, identifying multiple modeling frameworks and algorithm designing principles that are well-suited for addressing these complexities. Notably, time-space network models, A* algorithms, and dynamic programming techniques have exhibited remarkable efficacy in providing precise solutions. Furthermore, based on these exact approaches, heuristic algorithms developed in combination with neighborhood search, multi-stage strategy of accurate algorithm, or beam search have demonstrated the capability to deliver superior approximate solutions for medium-scale and large-scale problems, thereby offering a practical approach to tackling scheduling challenges within compact storage systems.