IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v262y2017i3p817-834.html
   My bibliography  Save this article

Optimally solving the joint order batching and picker routing problem

Author

Listed:
  • Valle, Cristiano Arbex
  • Beasley, John E.
  • da Cunha, Alexandre Salles

Abstract

In this work we investigate the problem of order batching and picker routing in storage areas. These are labour and capital intensive problems, often responsible for a substantial share of warehouse operating costs. In particular, we consider the case of online grocery shopping in which orders may be composed of dozens of items.

Suggested Citation

  • Valle, Cristiano Arbex & Beasley, John E. & da Cunha, Alexandre Salles, 2017. "Optimally solving the joint order batching and picker routing problem," European Journal of Operational Research, Elsevier, vol. 262(3), pages 817-834.
    • Handle: RePEc:eee:ejores:v:262:y:2017:i:3:p:817-834
    DOI: 10.1016/j.ejor.2017.03.069
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221717303004
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2017.03.069?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Fleischmann, Bernhard, 1985. "A cutting plane procedure for the travelling salesman problem on road networks," European Journal of Operational Research, Elsevier, vol. 21(3), pages 307-317, September.
    2. Gibson, David R. & Sharp, Gunter P., 1992. "Order batching procedures," European Journal of Operational Research, Elsevier, vol. 58(1), pages 57-67, April.
    3. Matusiak, Marek & de Koster, René & Kroon, Leo & Saarinen, Jari, 2014. "A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse," European Journal of Operational Research, Elsevier, vol. 236(3), pages 968-977.
    4. Cathy H.Y. Lam & K.L. Choy & G.T.S. Ho & C.K.M. Lee, 2014. "An order-picking operations system for managing the batching activities in a warehouse," International Journal of Systems Science, Taylor & Francis Journals, vol. 45(6), pages 1283-1295, June.
    5. de Koster, Rene & Le-Duc, Tho & Roodbergen, Kees Jan, 2007. "Design and control of warehouse order picking: A literature review," European Journal of Operational Research, Elsevier, vol. 182(2), pages 481-501, October.
    6. S. Lin & B. W. Kernighan, 1973. "An Effective Heuristic Algorithm for the Traveling-Salesman Problem," Operations Research, INFORMS, vol. 21(2), pages 498-516, April.
    7. R. Dekker & M. B. M. de Koster & K. J. Roodbergen & H. van Kalleveen, 2004. "Improving Order-Picking Response Time at Ankor's Warehouse," Interfaces, INFORMS, vol. 34(4), pages 303-313, August.
    8. Hong, Soondo & Johnson, Andrew L. & Peters, Brett A., 2012. "Batch picking in narrow-aisle order picking systems with consideration for picker blocking," European Journal of Operational Research, Elsevier, vol. 221(3), pages 557-570.
    9. Editors, 2014. "International Journal of Systems Science," International Journal of Systems Science, Taylor & Francis Journals, vol. 45(12), pages 1-1, December.
    10. Scholz, André & Henn, Sebastian & Stuhlmann, Meike & Wäscher, Gerhard, 2016. "A new mathematical programming formulation for the Single-Picker Routing Problem," European Journal of Operational Research, Elsevier, vol. 253(1), pages 68-84.
    11. Soondo Hong & Andrew Johnson & Brett Peters, 2012. "Large-scale order batching in parallel-aisle picking systems," IISE Transactions, Taylor & Francis Journals, vol. 44(2), pages 88-106.
    12. H. Donald Ratliff & Arnon S. Rosenthal, 1983. "Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem," Operations Research, INFORMS, vol. 31(3), pages 507-521, June.
    13. Roodbergen, Kees Jan & de Koster, Rene, 2001. "Routing order pickers in a warehouse with a middle aisle," European Journal of Operational Research, Elsevier, vol. 133(1), pages 32-43, August.
    14. Henn, Sebastian & Wäscher, Gerhard, 2012. "Tabu search heuristics for the order batching problem in manual order picking systems," European Journal of Operational Research, Elsevier, vol. 222(3), pages 484-494.
    15. Theys, Christophe & Bräysy, Olli & Dullaert, Wout & Raa, Birger, 2010. "Using a TSP heuristic for routing order pickers in warehouses," European Journal of Operational Research, Elsevier, vol. 200(3), pages 755-763, February.
    16. Letchford, Adam N. & Nasiri, Saeideh D. & Theis, Dirk Oliver, 2013. "Compact formulations of the Steiner Traveling Salesman Problem and related problems," European Journal of Operational Research, Elsevier, vol. 228(1), pages 83-92.
    17. Soondo Hong & Andrew L. Johnson & Brett A. Peters, 2016. "Order batching in a bucket brigade order picking system considering picker blocking," Flexible Services and Manufacturing Journal, Springer, vol. 28(3), pages 425-441, September.
    18. Irnich, Stefan & Laganà, Demetrio & Schlebusch, Claudia & Vocaturo, Francesca, 2015. "Two-phase branch-and-cut for the mixed capacitated general routing problem," European Journal of Operational Research, Elsevier, vol. 243(1), pages 17-29.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Minfang Huang & Qiong Guo & Jing Liu & Xiaoxu Huang, 2018. "Mixed Model Assembly Line Scheduling Approach to Order Picking Problem in Online Supermarkets," Sustainability, MDPI, vol. 10(11), pages 1-16, October.
    2. Cambazard, Hadrien & Catusse, Nicolas, 2018. "Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane," European Journal of Operational Research, Elsevier, vol. 270(2), pages 419-429.
    3. Arbex Valle, Cristiano & Beasley, John E, 2020. "Order batching using an approximation for the distance travelled by pickers," European Journal of Operational Research, Elsevier, vol. 284(2), pages 460-484.
    4. Boysen, Nils & de Koster, René & Weidinger, Felix, 2019. "Warehousing in the e-commerce era: A survey," European Journal of Operational Research, Elsevier, vol. 277(2), pages 396-411.
    5. Briant, Olivier & Cambazard, Hadrien & Cattaruzza, Diego & Catusse, Nicolas & Ladier, Anne-Laure & Ogier, Maxime, 2020. "An efficient and general approach for the joint order batching and picker routing problem," European Journal of Operational Research, Elsevier, vol. 285(2), pages 497-512.
    6. Çelik, Melih & Archetti, Claudia & Süral, Haldun, 2022. "Inventory routing in a warehouse: The storage replenishment routing problem," European Journal of Operational Research, Elsevier, vol. 301(3), pages 1117-1132.
    7. Fangyu Chen & Gangyan Xu & Yongchang Wei, 2019. "An Integrated Metaheuristic Routing Method for Multiple-Block Warehouses with Ultranarrow Aisles and Access Restriction," Complexity, Hindawi, vol. 2019, pages 1-14, June.
    8. Žulj, Ivan & Salewski, Hagen & Goeke, Dominik & Schneider, Michael, 2022. "Order batching and batch sequencing in an AMR-assisted picker-to-parts system," European Journal of Operational Research, Elsevier, vol. 298(1), pages 182-201.
    9. Mustapha Haouassi & Yannick Kergosien & Jorge E. Mendoza & Louis-Martin Rousseau, 2022. "The integrated orderline batching, batch scheduling, and picker routing problem with multiple pickers: the benefits of splitting customer orders," Flexible Services and Manufacturing Journal, Springer, vol. 34(3), pages 614-645, September.
    10. van Gils, Teun & Caris, An & Ramaekers, Katrien & Braekers, Kris, 2019. "Formulating and solving the integrated batching, routing, and picker scheduling problem in a real-life spare parts warehouse," European Journal of Operational Research, Elsevier, vol. 277(3), pages 814-830.
    11. Pardo, Eduardo G. & Gil-Borrás, Sergio & Alonso-Ayuso, Antonio & Duarte, Abraham, 2024. "Order batching problems: Taxonomy and literature review," European Journal of Operational Research, Elsevier, vol. 313(1), pages 1-24.
    12. Ardjmand, Ehsan & Shakeri, Heman & Singh, Manjeet & Sanei Bajgiran, Omid, 2018. "Minimizing order picking makespan with multiple pickers in a wave picking warehouse," International Journal of Production Economics, Elsevier, vol. 206(C), pages 169-183.
    13. Wagner, Stefan & Mönch, Lars, 2023. "A variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices," European Journal of Operational Research, Elsevier, vol. 304(2), pages 461-475.
    14. van Gils, Teun & Ramaekers, Katrien & Caris, An & de Koster, René B.M., 2018. "Designing efficient order picking systems by combining planning problems: State-of-the-art classification and review," European Journal of Operational Research, Elsevier, vol. 267(1), pages 1-15.
    15. Moaad Abdulaziz Alrasheed & Ateekh Ur Rehman & Ibrahim M. Alharkan, 2024. "Developing an Efficient Model for Online Grocery Order Fulfillment," Sustainability, MDPI, vol. 16(10), pages 1-24, May.
    16. Antonio Maria Coruzzolo & Francesco Lolli & Elia Balugani & Elisa Magnani & Miguel Afonso Sellitto, 2023. "Order Picking Problem: A Model for the Joint Optimisation of Order Batching, Batch Assignment Sequencing, and Picking Routing," Logistics, MDPI, vol. 7(3), pages 1-18, September.
    17. Dominik Goeke & Michael Schneider, 2021. "Modeling Single-Picker Routing Problems in Classical and Modern Warehouses," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 436-451, May.
    18. Mar Vazquez-Noguerol & Jose Comesaña-Benavides & Raul Poler & J. Carlos Prado-Prado, 2022. "An optimisation approach for the e-grocery order picking and delivery problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 30(3), pages 961-990, September.
    19. AERTS, Babiche & CORNELISSENS, Trijntje & SÖRENSEN, Kenneth, 2020. "Solving the joint order batching and picker routing problem, as a clustered vehicle routing problem," Working Papers 2020003, University of Antwerp, Faculty of Business and Economics.
    20. Xie, Lin & Li, Hanyi & Luttmann, Laurin, 2023. "Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses," European Journal of Operational Research, Elsevier, vol. 307(2), pages 713-730.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Arbex Valle, Cristiano & Beasley, John E, 2020. "Order batching using an approximation for the distance travelled by pickers," European Journal of Operational Research, Elsevier, vol. 284(2), pages 460-484.
    2. Çağla Cergibozan & A. Serdar Tasan, 2019. "Order batching operations: an overview of classification, solution techniques, and future research," Journal of Intelligent Manufacturing, Springer, vol. 30(1), pages 335-349, January.
    3. van Gils, Teun & Ramaekers, Katrien & Caris, An & de Koster, René B.M., 2018. "Designing efficient order picking systems by combining planning problems: State-of-the-art classification and review," European Journal of Operational Research, Elsevier, vol. 267(1), pages 1-15.
    4. Glock, Christoph H. & Grosse, Eric H. & Abedinnia, Hamid & Emde, Simon, 2019. "An integrated model to improve ergonomic and economic performance in order picking by rotating pallets," European Journal of Operational Research, Elsevier, vol. 273(2), pages 516-534.
    5. Masae, Makusee & Glock, Christoph H. & Vichitkunakorn, Panupong, 2021. "A method for efficiently routing order pickers in the leaf warehouse," International Journal of Production Economics, Elsevier, vol. 234(C).
    6. Matusiak, Marek & de Koster, René & Kroon, Leo & Saarinen, Jari, 2014. "A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse," European Journal of Operational Research, Elsevier, vol. 236(3), pages 968-977.
    7. De Santis, Roberta & Montanari, Roberto & Vignali, Giuseppe & Bottani, Eleonora, 2018. "An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses," European Journal of Operational Research, Elsevier, vol. 267(1), pages 120-137.
    8. Fangyu Chen & Yongchang Wei & Hongwei Wang, 2018. "A heuristic based batching and assigning method for online customer orders," Flexible Services and Manufacturing Journal, Springer, vol. 30(4), pages 640-685, December.
    9. Matusiak, Marek & de Koster, René & Saarinen, Jari, 2017. "Utilizing individual picker skills to improve order batching in a warehouse," European Journal of Operational Research, Elsevier, vol. 263(3), pages 888-899.
    10. Pardo, Eduardo G. & Gil-Borrás, Sergio & Alonso-Ayuso, Antonio & Duarte, Abraham, 2024. "Order batching problems: Taxonomy and literature review," European Journal of Operational Research, Elsevier, vol. 313(1), pages 1-24.
    11. Heiko Diefenbach & Simon Emde & Christoph H. Glock & Eric H. Grosse, 2022. "New solution procedures for the order picker routing problem in U-shaped pick areas with a movable depot," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(2), pages 535-573, June.
    12. André Scholz & Daniel Schubert & Gerhard Wäscher, 2016. "Order picking with multiple pickers and due dates – Simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems," FEMM Working Papers 160005, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    13. Atashi Khoei, Arsham & Süral, Haldun & Tural, Mustafa Kemal, 2023. "Energy minimizing order picker forklift routing problem," European Journal of Operational Research, Elsevier, vol. 307(2), pages 604-626.
    14. Ardjmand, Ehsan & Shakeri, Heman & Singh, Manjeet & Sanei Bajgiran, Omid, 2018. "Minimizing order picking makespan with multiple pickers in a wave picking warehouse," International Journal of Production Economics, Elsevier, vol. 206(C), pages 169-183.
    15. Matusiak, M. & de Koster, M.B.M. & Saarinen, J., 2015. "Data-driven warehouse optimization," ERIM Report Series Research in Management ERS-2015-008-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    16. Neves-Moreira, Fábio & Amorim, Pedro, 2024. "Learning efficient in-store picking strategies to reduce customer encounters in omnichannel retail," International Journal of Production Economics, Elsevier, vol. 267(C).
    17. André Scholz, 2016. "An Exact Solution Approach to the Single-Picker Routing Problem in Warehouses with an Arbitrary Block Layout," FEMM Working Papers 160006, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    18. Žulj, Ivan & Kramer, Sergej & Schneider, Michael, 2018. "A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem," European Journal of Operational Research, Elsevier, vol. 264(2), pages 653-664.
    19. Boysen, Nils & de Koster, René & Füßler, David, 2021. "The forgotten sons: Warehousing systems for brick-and-mortar retail chains," European Journal of Operational Research, Elsevier, vol. 288(2), pages 361-381.
    20. Scholz, André & Henn, Sebastian & Stuhlmann, Meike & Wäscher, Gerhard, 2016. "A new mathematical programming formulation for the Single-Picker Routing Problem," European Journal of Operational Research, Elsevier, vol. 253(1), pages 68-84.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:262:y:2017:i:3:p:817-834. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.