Two-stage order picking algorithm under scattered storage mode

Modern B2C distribution centers have introduced a new storage mode known as scattered storage, in which identical products can be stored at different locations. Such a layout increases the complexity of order picking route planning. To address this challenge, this paper proposes a two-stage order picking algorithm. In the first stage, the Minimum Aisle Coverage algorithm in the literature is used to select locations where products are stored. In the second stage, the shortest route for order picking is obtained using the ant colony optimization method. To further enhance order picking efficiency, the product information from the orders to be picked is considered to improve the accuracy in selecting storage locations, and the improved algorithm is obtained. Finally, both the original and improved algorithms are tested through a series of picking experiments to evaluate their performance. Experimental results demonstrate that the improved algorithm consistently yields shorter picking routes, and the maximum improvement rate reached 24.85%.