An adaptive large neighborhood search for the order picking process: the case of a retail distribution company in Italy

Luigi Di Puglia Pugliese,Francesca Guerriero,Giusy Macrina, Massimiliano Matteucci, Veronica Mosca

Procedia Computer Science(2024)

引用 0|浏览0
暂无评分
摘要
Order picking is one of the most important activities in warehouse management. By optimising the picking process, warehouse operations can be managed efficiently in terms of both time and logistics costs. In this work we apply operations research techniques to support the order picking process of an Italian retail distribution company. The picking process poses several challenges from an optimisation point of view, and the related optimization problems are very complex. Therefore, we define an Adaptive Large Neighbourhood Search (ALNS) algorithm that heuristically solves the problem. The proposed metaheuristic is tested on a set of 101 real orders processed by the company within one day. The computational experiments show that the ALNS shows good performances in terms of effectiveness, compared to the optimal solution, as well as allows to implement a better organisation of the order picking process than the one currently adopted by the company.
更多
查看译文
关键词
Adaptive Large Neighbourhood Search,Order picking,Warehouse optimisation,Vehicle Routing Problem,Picker Routing Problem
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要