IDEAS home Printed from https://ideas.repec.org/a/wly/complx/v2022y2022i1n1382558.html

A Mixed Integer Linear Formulation and a Grouping League Championship Algorithm for a Multiperiod‐Multitrip Order Picking System with Product Replenishment to Minimize Total Tardiness

Author

Listed:
  • Morteza Farhadi Sartangi
  • Ali Husseinzadeh Kashan
  • Hassan Haleh
  • Abolfazl Kazemi

Abstract

Order picking, which is collecting a set of products from different locations in a warehouse, has repeatedly been described as one of the most laborious and time‐consuming internal logistic processes. Each order is issued to pick some products located at given locations in the warehouse. In this paper, we consider an order picking problem, in which a number of orders with different delivery due dates are going to be retrieved by a limited number of order pickers in multiperiods such that the total tardiness is minimized. The aim is to determine a retrieval plan in terms of order batching and order picker multitrip routing as decision variables. Besides, products are arrived and replenished at the predetermined locations at different periods. Therefore, products sitting in those locations should be delivered soon to provide empty rooms for replenishment. A mixed integer linear programming formulation is proposed for this new problem. The model is optimally solved for small‐size problems. For larger instances, grouping metaheuristic algorithms are proposed based on particle swarm optimization and the league championship algorithm that use group‐based operators to generate reasonable batches of orders. Improvement heuristics are designed as well. The performance of the MILP formulation and metaheuristic algorithms is analyzed for different problem instances whose designs are based on real data gathered from an auto parts warehouse. Results indicate that our algorithms can stably solve large instances of the problem in a reasonable time.

Suggested Citation

  • Morteza Farhadi Sartangi & Ali Husseinzadeh Kashan & Hassan Haleh & Abolfazl Kazemi, 2022. "A Mixed Integer Linear Formulation and a Grouping League Championship Algorithm for a Multiperiod‐Multitrip Order Picking System with Product Replenishment to Minimize Total Tardiness," Complexity, John Wiley & Sons, vol. 2022(1).
    • Handle: RePEc:wly:complx:v:2022:y:2022:i:1:n:1382558
    DOI: 10.1155/2022/1382558
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2022/1382558
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2022/1382558?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
    ---><---

    References listed on IDEAS

    as
    1. Masae, Makusee & Glock, Christoph H. & Grosse, Eric H., 2020. "Order picker routing in warehouses: A systematic literature review," International Journal of Production Economics, Elsevier, vol. 224(C).
    2. Sebastian Henn & Sören Koch & Gerhard Wäscher, 2011. "Order Batching in Order Picking Warehouses: A Survey of Solution Approaches," FEMM Working Papers 110001, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    3. Sebastian Henn & Verena Schmid, 2011. "Metaheuristics for Order Batching and Sequencing in Manual Order Picking Systems," FEMM Working Papers 110011, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    4. Makusee Masae & Christoph H. Glock & Panupong Vichitkunakorn, 2020. "Optimal order picker routing in the chevron warehouse," IISE Transactions, Taylor & Francis Journals, vol. 52(6), pages 665-687, June.
    5. Petersen, Charles G. & Aase, Gerald, 2004. "A comparison of picking, storage, and routing policies in manual order picking," International Journal of Production Economics, Elsevier, vol. 92(1), pages 11-19, November.
    6. Husseinzadeh Kashan, Ali & Ozturk, Onur, 2022. "Improved MILP formulation equipped with valid inequalities for scheduling a batch processing machine with non-identical job sizes," Omega, Elsevier, vol. 112(C).
    7. de Koster, M.B.M. & Le-Duc, T. & Roodbergen, K.J., 2006. "Design and Control of Warehouse Order Picking: a literature review," ERIM Report Series Research in Management ERS-2006-005-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.
    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. Wahlen, Julia, 2026. "Solving the multi-block order batching problem with branch-price-and-cut," European Journal of Operational Research, Elsevier, vol. 330(2), pages 398-415.
    2. Huerta-Muñoz, Diana L. & Ríos-Mercado, Roger Z. & López-Pérez, Jesús F., 2025. "Iterated greedy local search for the order picking problem considering storage location and order batching decisions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 201(C).
    3. 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).
    4. Bock, Stefan & Boysen, Nils, 2025. "Stow & pick: Optimizing combined stowing and picking tours in scattered storage warehouses," European Journal of Operational Research, Elsevier, vol. 324(3), pages 1002-1016.
    5. Rubio, Francisco & Llopis-Albert, Carlos & Valero, Francisco, 2021. "Multi-objective optimization of costs and energy efficiency associated with autonomous industrial processes for sustainable growth," Technological Forecasting and Social Change, Elsevier, vol. 173(C).
    6. Maria A. M. Trindade & Paulo S. A. Sousa & Maria R. A. Moreira, 2022. "Ramping up a heuristic procedure for storage location assignment problem with precedence constraints," Flexible Services and Manufacturing Journal, Springer, vol. 34(3), pages 646-669, September.
    7. 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.
    8. Vichitkunakorn, Panupong & Emde, Simon & Masae, Makusee & Glock, Christoph H. & Grosse, Eric H., 2024. "Locating charging stations and routing drones for efficient automated stocktaking," European Journal of Operational Research, Elsevier, vol. 316(3), pages 1129-1145.
    9. Laura Korbacher & Katrin Heßler & Stefan Irnich, 2023. "The Single Picker Routing Problem with Scattered Storage: Modeling and Evaluation of Routing and Storage Policies," Working Papers 2302, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    10. Chen, Ran & Yang, Jingjing & Yu, Yugang, 2026. "Integrated scattered storage and picker routing in picker-to-parts warehouses," European Journal of Operational Research, Elsevier, vol. 329(3), pages 808-824.
    11. Thibault Prunet & Nabil Absi & Diego Cattaruzza, 2025. "A note on the complexity of the picker routing problem in multi-block warehouses and related problems," Annals of Operations Research, Springer, vol. 347(3), pages 1595-1605, April.
    12. Zhang, Jiayuan & Yalcin, Mehmet G. & Hales, Douglas N., 2021. "Elements of paradoxes in supply chain management literature: A systematic literature review," International Journal of Production Economics, Elsevier, vol. 232(C).
    13. 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.
    14. 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.
    15. Bock, Stefan & Boysen, Nils, 2025. "Due date-oriented picker routing, an efficient exact solution algorithm, and its application to pick-from-store omnichannel retailing," European Journal of Operational Research, Elsevier, vol. 321(3), pages 775-788.
    16. Wu, Jingwen & Yang, Zhiyuan & Zhen, Lu & Li, Wenxin & Ren, Yiran, 2025. "Joint optimization of order picking and replenishment in robotic mobile fulfillment systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 194(C).
    17. Asghari, Mohammad & Mirzapour Al-e-hashem, S. Mohammad J., 2021. "Green vehicle routing problem: A state-of-the-art review," International Journal of Production Economics, Elsevier, vol. 231(C).
    18. Giacomo Lanza & Mauro Passacantando & Maria Grazia Scutellà, 2023. "Sequencing and routing in a large warehouse with high degree of product rotation," Flexible Services and Manufacturing Journal, Springer, vol. 35(4), pages 1206-1255, December.
    19. Anastasios Gialos & Vasileios Zeimpekis, 2024. "A state-of-the-art classification and review of parameters that affect the design, control, and operating strategies of order-picking systems," Operational Research, Springer, vol. 24(1), pages 1-52, March.
    20. Ç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.

    More about this item

    Statistics

    Access and download statistics

    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:wly:complx:v:2022:y:2022:i:1:n:1382558. 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: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/8503 .

    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.