登入選單
返回Google圖書搜尋
Mathematical Models, Heuristic and Exact Method for Order Picking in 3D-narrow Aisles
註釋Order picking is one of the most challenging operations in distribution center management and one of the most important sources of costs. One way to reduce the lead time and associated costs is to minimize the total amount of work for collecting all orders. This paper is motivated by a collaboration with an industrial partner who delivers furniture and electronic equipments. We have modeled their 3D narrow aisle warehouse as a vehicle routing problem through a series of distance transformations between all pairs of locations. Security issues arising when working on narrow-aisles impose an extra layer of difficulty when determining the routes. Nevertheless, our approach yields an exact representation of all possible picking sequences. We have then solved large sets of instances reproducing realistic configurations using a combination of an heuristic and an exact algorithm, minimizing the total distance traveled for picking all items. Through extensive computational experiments, we identify for which aisle configurations our methods work best. We also compare our solutions with those obtained by the company order picking procedure, showing that significant improvements can be achieved by using our approach.--Résumé de l'éditeur.