Nowadays, fast delivery services have created the need for high-density
warehouses. The puzzle-based storage system is a practical way to enhance the
storage density, however, facing difficulties in the retrieval process. In this
work, a deep reinforcement learning algorithm, specifically the Double&Dueling
Deep Q Network, is developed to solve the multi-item retrieval problem in the
system with general settings, where multiple desired items, escorts, and I/O
points are placed randomly. Additionally, we propose a general compact integer
programming model to evaluate the solution quality. Extensive numerical
experiments demonstrate that the reinforcement learning approach can yield
high-quality solutions and outperforms three related state-of-the-art heuristic
algorithms. Furthermore, a conversion algorithm and a decomposition framework
are proposed to handle simultaneous movement and large-scale instances
respectively, thus improving the applicability of the PBS system.

用深度强化学习算法，包括 Double&Dueling Deep Q Network 来解决谜题式存储系统中多个物品的检索问题，并提出一种紧凑的整数规划模型来评估解决方案的质量。该方法在 PBS 系统中表现出高效性，并提出一种转换算法和分解框架来改善 PBS 系统的适用性。