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

A new mathematical programming formulation for the Single-Picker Routing Problem

Author

Listed:
  • Scholz, André
  • Henn, Sebastian
  • Stuhlmann, Meike
  • Wäscher, Gerhard

Abstract

The Single-Picker Routing Problem deals with the determination of the sequence according to which article locations have to be visited in a distribution warehouse and the identification of the corresponding paths which have to be traveled by human operators (order pickers) in order to collect a set of items requested by internal or external customers. The Single-Picker Routing Problem (SPRP) represents a special case of the classic Traveling Salesman Problem (TSP) and, therefore, can also be modeled as a TSP. Standard TSP formulations applied to the SPRP, however, neglect that in distribution warehouses article locations are arranged in a specifically structured way. When arranged according to a block layout, articles are located in parallel picking aisles, and order pickers can only change over to another picking aisle at certain positions by means of so-called cross aisles. In this paper, for the first time a mathematical programming formulation is proposed which takes into account this specific property. By means of extensive numerical experiments it is shown that the proposed formulation is superior to standard TSP formulations.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:253:y:2016:i:1:p:68-84
    DOI: 10.1016/j.ejor.2016.02.018
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221716300388
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2016.02.018?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. Sebastian Henn & Gerhard Wäscher, 2010. "Tabu Search Heuristics for the Order Batching Problem in Manual Order Picking Systems," FEMM Working Papers 100007, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    2. 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.
    3. 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.
    4. Gu, Jinxiang & Goetschalckx, Marc & McGinnis, Leon F., 2007. "Research on warehouse operation: A comprehensive review," European Journal of Operational Research, Elsevier, vol. 177(1), pages 1-21, February.
    5. Rego, César & Gamboa, Dorabela & Glover, Fred & Osterman, Colin, 2011. "Traveling salesman problem heuristics: Leading methods, implementations and latest advances," European Journal of Operational Research, Elsevier, vol. 211(3), pages 427-441, June.
    6. 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.
    7. G. Dantzig & R. Fulkerson & S. Johnson, 1954. "Solution of a Large-Scale Traveling-Salesman Problem," Operations Research, INFORMS, vol. 2(4), pages 393-410, November.
    8. 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.
    9. 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.
    10. 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.
    Full references (including those not matched with items on IDEAS)

    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. Sebastian Henn & André Scholz & Meike Stuhlmann & Gerhard Wäscher, 2015. "A New Mathematical Programming Formulation for the Single-Picker Routing Problem in a Single-Block Layout," FEMM Working Papers 150005, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. Sandra Hahn & André Scholz, 2017. "Order Picking in Narrow-Aisle Warehouses: A Fast Approach to Minimize Waiting Times," FEMM Working Papers 170006, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    7. Giannikas, Vaggelis & Lu, Wenrong & Robertson, Brian & McFarlane, Duncan, 2017. "An interventionist strategy for warehouse order picking: Evidence from two case studies," International Journal of Production Economics, Elsevier, vol. 189(C), pages 63-76.
    8. 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.
    9. Fangyu Chen & Hongwei Wang & Yong Xie & Chao Qi, 2016. "An ACO-based online routing method for multiple order pickers with congestion consideration in warehouse," Journal of Intelligent Manufacturing, Springer, vol. 27(2), pages 389-408, April.
    10. 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.
    11. 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.
    12. Weidinger, Felix & Boysen, Nils & Schneider, Michael, 2019. "Picker routing in the mixed-shelves warehouses of e-commerce retailers," European Journal of Operational Research, Elsevier, vol. 274(2), pages 501-515.
    13. 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.
    14. Gerhard Wäscher & André Scholz, 2015. "A Solution Approach for the Joint Order Batching and Picker Routing Problem in a Two-Block Layout," FEMM Working Papers 150004, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    15. 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.
    16. 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.
    17. 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.
    18. 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.
    19. Anderson Rogério Faia Pinto & Marcelo Seido Nagano, 2020. "Genetic algorithms applied to integration and optimization of billing and picking processes," Journal of Intelligent Manufacturing, Springer, vol. 31(3), pages 641-659, March.
    20. 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.

    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:253:y:2016:i:1:p:68-84. 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.