The picker routing problem in mixed-shelves, multi-block warehouses

被引:1
作者
Haouassi, Mustapha [1 ,2 ]
Kergosien, Yannick [2 ]
Mendoza, Jorge E. [3 ]
Rousseau, Louis-Martin [1 ]
机构
[1] Ecole Polytech Montreal, CIRRELT, Montreal, PQ, Canada
[2] Univ Tours, LIFAT, 64 Ave Jean Portalis, F-37200 Tours, France
[3] HEC Montreal, CIRRELT, Montreal, PQ, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Picker routing; mixed-shelves warehouse; multi-block layout; logic-based Benders decomposition; exact method; ORDER-PICKING; BENDERS DECOMPOSITION; ALGORITHMS; SINGLE;
D O I
10.1080/00207543.2024.2374845
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Unlike conventional warehouses, where the inventory of an item is concentrated on a single shelf, the inventory in mixed-shelves warehouses is broken down into units and dispersed throughout the warehouse. As a result, the locations from where items are to be retrieved must be chosen when designing the picker tour. The rare research on the picker routing problem (PRP) in mixed-shelves warehouses focuses on (and heavily exploits the properties of) 1-block warehouses, which are warehouses with only two cross aisles. Here, we tackle the more general PRP in mixed-shelves, multi-block warehouses. To solve the problem, we propose a logic-based Benders decomposition method whereby the master problem selects the locations from where each item is retrieved and the subproblem designs the associated picker tour. We introduce tailored optimality cuts and prove their validity. In addition, we propose a set of various techniques to enhance the performance of the logic-based Benders decomposition, including a lower bounding function and valid inequalities. We show the efficiency and effectiveness of the proposed method through extensive computational experiments carried out on both standard instances from the literature (for the 1-block setting) and newly generated instances (for our case). We also leverage our algorithms to generate managerial insights into the benefits of multi-block layouts and mixed-shelves policies in warehousing.
引用
收藏
页码:1304 / 1325
页数:22
相关论文
共 27 条
  • [1] [Anonymous], 2021, Retail e-commerce revenue in the United States from 2017 to 2025 | Statista
  • [2] Bhatti A., 2020, INT J FUTUR GENER CO, V13, P1449, DOI DOI 10.1016/J.CHB.2016.09.026
  • [3] Warehousing in the e-commerce era: A survey
    Boysen, Nils
    de Koster, Rene
    Weidinger, Felix
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 277 (02) : 396 - 411
  • [4] Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane
    Cambazard, Hadrien
    Catusse, Nicolas
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 270 (02) : 419 - 429
  • [5] Design and control of warehouse order picking: A literature review
    de Koster, Rene
    Le-Duc, Tho
    Roodbergen, Kees Jan
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 182 (02) : 481 - 501
  • [6] New solution procedures for the order picker routing problem in U-shaped pick areas with a movable depot
    Diefenbach, Heiko
    Emde, Simon
    Glock, Christoph H.
    Grosse, Eric H.
    [J]. OR SPECTRUM, 2022, 44 (02) : 535 - 573
  • [7] Logic-based benders decomposition for scheduling a batching machine
    Emde, Simon
    Polten, Lukas
    Gendreau, Michel
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2020, 113 (113)
  • [8] Logic-based Benders decomposition for the heterogeneous fixed fleet vehicle routing problem with time windows
    Fachini, Ramon Faganello
    Armentano, Vinicius Amaral
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2020, 148
  • [9] Modeling Single-Picker Routing Problems in Classical and Modern Warehouses
    Goeke, Dominik
    Schneider, Michael
    [J]. INFORMS JOURNAL ON COMPUTING, 2021, 33 (02) : 436 - 451
  • [10] The integrated orderline batching, batch scheduling, and picker routing problem with multiple pickers: the benefits of splitting customer orders
    Haouassi, Mustapha
    Kergosien, Yannick
    Mendoza, Jorge E.
    Rousseau, Louis-Martin
    [J]. FLEXIBLE SERVICES AND MANUFACTURING JOURNAL, 2022, 34 (03) : 614 - 645