IDEAS home Printed from https://ideas.repec.org/a/spr/joinma/v33y2022i4d10.1007_s10845-020-01688-6.html
   My bibliography  Save this article

An estimation distribution algorithm for wave-picking warehouse management

Author

Listed:
  • Jingran Liang

    (Tsinghua University)

  • Zhengning Wu

    (University of Sydney)

  • Chenye Zhu

    (University of Sydney)

  • Zhi-Hai Zhang

    (Tsinghua University)

Abstract

Recently, market has witnessed a tremendous growth in E-commerce sales, which bring tons of opportunities as well as challenges. Warehouses have to handle unique characteristics of customer orders in the era of E-commerce which consists of small order scales, large items count, unexpected irregular order arrival patterns, seasonality demand peeks, and high service level expectations. Warehouses are adopting wave-picking as an effective policy composed of item-batching, load-assignment and picker-routing problems. In this research, principle combination of load-assignment and picker-routing problems is studied. A mixed integer mathematical model is established based on features of a wave-picking warehouse. In order to conquer the complexity caused by routing decision of the proposed problem, a set of effective modified Estimation Distribution Algorithms is developed. The set of proposed algorithms is proved to have stable gaps (1% on average and maximum less than 2%) compared with Cplex 12.8, while can be solved in much larger scale within quite short time (100 pickers and 350 items in each wave within less than 2 min).

Suggested Citation

  • Jingran Liang & Zhengning Wu & Chenye Zhu & Zhi-Hai Zhang, 2022. "An estimation distribution algorithm for wave-picking warehouse management," Journal of Intelligent Manufacturing, Springer, vol. 33(4), pages 929-942, April.
    • Handle: RePEc:spr:joinma:v:33:y:2022:i:4:d:10.1007_s10845-020-01688-6
    DOI: 10.1007/s10845-020-01688-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10845-020-01688-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10845-020-01688-6?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. 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.
    2. Chen, Tzu-Li & Cheng, Chen-Yang & Chen, Yin-Yann & Chan, Li-Kai, 2015. "An efficient hybrid algorithm for integrated order batching, sequencing and routing problem," International Journal of Production Economics, Elsevier, vol. 159(C), pages 158-167.
    3. Bo Yan & Chang Yan & Feng Long & Xing-Chao Tan, 2018. "Multi-objective optimization of electronic product goods location assignment in stereoscopic warehouse based on adaptive genetic algorithm," Journal of Intelligent Manufacturing, Springer, vol. 29(6), pages 1273-1285, August.
    4. Jason Acimovic & Stephen C. Graves, 2015. "Making Better Fulfillment Decisions on the Fly in an Online Retail Environment," Manufacturing & Service Operations Management, INFORMS, vol. 17(1), pages 34-51, February.
    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. 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. Bektaş, Tolga & Gouveia, Luis, 2014. "Requiem for the Miller–Tucker–Zemlin subtour elimination constraints?," European Journal of Operational Research, Elsevier, vol. 236(3), pages 820-832.
    8. Ming-Jong Yao & Jia-Yen Huang, 2017. "Optimal lot-sizing and joint replenishment strategy under a piecewise linear warehousing cost structure," Journal of Intelligent Manufacturing, Springer, vol. 28(3), pages 791-803, March.
    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.
    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. Li Zhou & Huwei Liu & Junhui Zhao & Fan Wang & Jianglong Yang, 2022. "Performance Analysis of Picking Routing Strategies in the Leaf Layout Warehouse," Mathematics, MDPI, vol. 10(17), pages 1-28, September.

    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. 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.
    2. 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.
    3. Ç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.
    4. 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).
    5. Rajabighamchi, Farzaneh & van Hoesel, Stan & Defryn, Christof, 2023. "The order picking problem under a scattered storage policy," Research Memorandum 006, Maastricht University, Graduate School of Business and Economics (GSBE).
    6. Jose Alejandro Cano & Pablo Cortés & Jesús Muñuzuri & Alexander Correa-Espinal, 2023. "Solving the picker routing problem in multi-block high-level storage systems using metaheuristics," Flexible Services and Manufacturing Journal, Springer, vol. 35(2), pages 376-415, June.
    7. 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.
    8. Srinivas, Sharan & Yu, Shitao, 2022. "Collaborative order picking with multiple pickers and robots: Integrated approach for order batching, sequencing and picker-robot routing," International Journal of Production Economics, Elsevier, vol. 254(C).
    9. Lam, H.Y. & Ho, G.T.S. & Mo, Daniel Y. & Tang, Valerie, 2023. "Responsive pick face replenishment strategy for stock allocation to fulfil e-commerce order," International Journal of Production Economics, Elsevier, vol. 264(C).
    10. Li Zhou & Huwei Liu & Junhui Zhao & Fan Wang & Jianglong Yang, 2022. "Performance Analysis of Picking Routing Strategies in the Leaf Layout Warehouse," Mathematics, MDPI, vol. 10(17), pages 1-28, September.
    11. Ž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.
    12. 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).
    13. 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.
    14. Ž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.
    15. 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.
    16. 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.
    17. 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.
    18. Shandong Mou, 2022. "Integrated Order Picking and Multi-Skilled Picker Scheduling in Omni-Channel Retail Stores," Mathematics, MDPI, vol. 10(9), pages 1-19, April.
    19. Scholz, André & Schubert, Daniel & Wäscher, Gerhard, 2017. "Order picking with multiple pickers and due dates – Simultaneous solution of Order Batching, Batch Assignment and Sequencing, and Picker Routing Problems," European Journal of Operational Research, Elsevier, vol. 263(2), pages 461-478.
    20. 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.

    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:spr:joinma:v:33:y:2022:i:4:d:10.1007_s10845-020-01688-6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.