考虑重复优先级的四向穿梭车系统无限制翻箱出库研究

Four-way shuttle storage and retrieval system is an efficient intensive storage system, in accordance with the order of goods out of the warehouse to pick up the goods, due to the structure of the system multi-depth position characteristics, may result in a new blockage caused by additional box. In order to further shorten the outgoing time, enterprises usually divide the goods without strict time window restrictions into a group and do not distinguish the order of picking up the goods, the same picking up order of the goods is known as duplicate priority. For the four-way shuttle storage and retrieval system considering the duplicate priority of the unrestricted relocation problem, this paper proposes an exact algorithm using iterative deepening branch and bound to obtain the minimum number of required relocations.By comparing the experimental results, the validity of the iterative deepening branch-and-bound algorithm was verified from the two dimensions of time and the number of bin-searching operations in comparison with the improved A* algorithm and the heuristic algorithms commonly used in enterprises. The results demonstrate that the algorithm proposed in this paper can yield the optimal bin-searching scheme within a short period, further enhancing the outbound efficiency of goods.