摘要
In this paper, order assignment, order batching and picker routing problems with multiple pickers in a wave picking warehouse of a major US third party logistics company is studied and modeled mathematically. The proposed mathematical model is solved using an exact algorithm. Since the exact algorithm suffers from long CPU time, a Lagrangian decomposition heuristic combined with particle swarm optimization (LD-PSO) algorithm is proposed, which performs well for small size waves. To solve large-scale problems, a hybrid parallel simulated annealing and ant colony optimization (PSA-ACO) is presented. The proposed methods are tested using the warehouse data. The results are compared against the minimum makespan impact (MMI) heuristic that is currently being used in the warehouse and a state-of-the-art variable neighborhood descent (VND). While PSA-ACO slightly outperforms VND, for picking large waves, PSA-ACO and VND can improve the makespan by approximately 7.8% and 6.9% over MMI respectively. Numerical experiments show that increasing number of pickers and picking capacity has a greater impact on reducing makespan when the ratio of orders to number of pickers or picking capacity is high.
学科与关键词
- An estimation distribution algorithm for wave-picking warehouse managementLiang, Jingran; Wu, Zhengning; Zhu, Chenye; Zhang, Zhi-Hai*JOURNAL OF INTELLIGENT MANUFACTURING, 2022, 33(4): 929-942.被引 12
- A comprehensive review of batching problems in low-level picker-to-parts systems with order due dates: Main gaps, trade-offs, and prospects for future researchPinto, Anderson Rogerio Faia; Nagano, Marcelo Seido*JOURNAL OF MANUFACTURING SYSTEMS, 2022, 65: 1-18.被引 8
- Joint green dynamic order batching and picker routing problem using PSO with global worst experienceLin, Chun-Cheng; Peng, Yi-Chun; Kang, Jia-Rong*APPLIED SOFT COMPUTING, 2024, 154: 111336.被引 2
