摘要

In recent years, robotic mobile fulfillment systems have become an important development direction of intelligent logistics and warehousing in China. However, the efficiency of this system hinges on the multi-robot scheduling procedure. In this paper, we integrate the decisions of rack storage and retrieval. We formulate an integer programming model to minimize the total distance of robots. To solve the problem, we first present a dynamic programming method based on beam search to find an initial solution quickly. We then embed the integer programming model into the adaptive large neighborhood search framework and propose an efficient adaptive matheuristic, which can find a near-optimal solution within small computational runtimes. The results show that the proposed integrated optimization approach can reduce about 60% of the traveling distance of robots compared with those methods that consider the two problems separately. In addition, our method can reduce 10% to 15% of the traveling distance of robots compared with the nearest assignment rule. This paper provides a theoretical guidance and decision support for the warehouse layout configurations, which has important practical significance for the development of the intelligent warehouses of China. ? 2023 Systems Engineering Society of China.

全文