IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i7p1577-d1106408.html
   My bibliography  Save this article

A Discrete-Event Simheuristic for Solving a Realistic Storage Location Assignment Problem

Author

Listed:
  • Jonas F. Leon

    (Department of Computer Science, Multimedia and Telecommunication, Universitat Oberta de Catalunya, 08018 Barcelona, Spain
    Spindox España S.L., Calle Muntaner 305, 08021 Barcelona, Spain)

  • Yuda Li

    (Department of Applied Statistics and Operations Research, Universitat Politècnica de València, 03801 Alcoy, Spain)

  • Mohammad Peyman

    (Department of Computer Science, Multimedia and Telecommunication, Universitat Oberta de Catalunya, 08018 Barcelona, Spain)

  • Laura Calvet

    (Department of Telecommunication and Systems Engineering, Autonomous University of Barcelona, 08202 Sabadell, Spain)

  • Angel A. Juan

    (Department of Applied Statistics and Operations Research, Universitat Politècnica de València, 03801 Alcoy, Spain)

Abstract

In the context of increasing complexity in manufacturing and logistic systems, the combination of optimization and simulation can be considered a versatile tool for supporting managerial decision-making. An informed storage location assignment policy is key for improving warehouse operations, which play a vital role in the efficiency of supply chains. Traditional approaches in the literature to solve the storage location assignment problem present some limitations, such as excluding the stochastic variability of processes or the interaction among different warehouse activities. This work addresses those limitations by proposing a discrete-event simheuristic framework that ensures robust solutions in the face of real-life warehouse conditions. The approach followed embraces the complexity of the problem by integrating the order sequence and picking route in the solution construction and uses commercial simulation software to reduce the impact of stochastic events on the quality of the solution. The implementation of this type of novel methodology within a warehouse management system can enhance warehouse efficiency without requiring an increase in automation level. The method developed is tested under a number of computational experiments that show its convenience and point toward future lines of research.

Suggested Citation

  • Jonas F. Leon & Yuda Li & Mohammad Peyman & Laura Calvet & Angel A. Juan, 2023. "A Discrete-Event Simheuristic for Solving a Realistic Storage Location Assignment Problem," Mathematics, MDPI, vol. 11(7), pages 1-24, March.
  • Handle: RePEc:gam:jmathe:v:11:y:2023:i:7:p:1577-:d:1106408
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/7/1577/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/11/7/1577/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Chen, Lu & Langevin, André & Riopel, Diane, 2011. "A tabu search algorithm for the relocation problem in a warehousing system," International Journal of Production Economics, Elsevier, vol. 129(1), pages 147-156, January.
    2. Lanza, Giacomo & Passacantando, Mauro & Scutellà, Maria Grazia, 2022. "Assigning and sequencing storage locations under a two level storage policy: Optimization model and matheuristic approaches," Omega, Elsevier, vol. 108(C).
    3. Zhang, Guoqing & Shang, Xiaoting & Alawneh, Fawzat & Yang, Yiqin & Nishi, Tatsushi, 2021. "Integrated production planning and warehouse storage assignment problem: An IoT assisted case," International Journal of Production Economics, Elsevier, vol. 234(C).
    4. Guo, Xiaolong & Chen, Ran & Du, Shaofu & Yu, Yugang, 2021. "Storage assignment for newly arrived items in forward picking areas with limited open locations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 151(C).
    5. Silva, Allyson & Coelho, Leandro C. & Darvish, Maryam & Renaud, Jacques, 2020. "Integrating storage location and order picking problems in warehouse planning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    6. Ronald J. Mantel & Peter C. Schuur & Sunderesh S. Heragu, 2007. "Order oriented slotting: a new assignment strategy for warehouses," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 1(3), pages 301-316.
    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. Jonas F. Leon & Mohammad Peyman & Xabier A. Martin & Angel A. Juan, 2024. "Simulation of Heuristics for Automated Guided Vehicle Task Sequencing with Resource Sharing and Dynamic Queues," Mathematics, MDPI, vol. 12(2), pages 1-19, January.
    2. Mengyue Zhai & Zheng Wang, 2024. "Optimizing Rack Locations in the Mobile-Rack Picking System: A Method of Integrating Rack Heat and Relevance," Mathematics, MDPI, vol. 12(3), pages 1-20, January.

    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. Silva, Allyson & Coelho, Leandro C. & Darvish, Maryam & Renaud, Jacques, 2020. "Integrating storage location and order picking problems in warehouse planning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    2. Chen, Gang & Feng, Haolin & Luo, Kaiyi & Tang, Yanli, 2021. "Retrieval-oriented storage relocation optimization of an automated storage and retrieval system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 155(C).
    3. Kovács, András, 2011. "Optimizing the storage assignment in a warehouse served by milkrun logistics," International Journal of Production Economics, Elsevier, vol. 133(1), pages 312-318, September.
    4. Schuur, Peter C., 2015. "The worst-case performance of the Cube per Order Index slotting strategy is infinitely bad – A technical note," International Journal of Production Economics, Elsevier, vol. 170(PC), pages 801-804.
    5. Jiang, Min & Huang, George Q., 2022. "Intralogistics synchronization in robotic forward-reserve warehouses for e-commerce last-mile delivery," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    6. Chen, Ran & Yang, Jingjing & Yu, Yugang & Guo, Xiaolong, 2023. "Retrieval request scheduling in a shuttle-based storage and retrieval system with two lifts," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 174(C).
    7. Jiang, Min & Leung, K.H. & Lyu, Zhongyuan & Huang, George Q., 2020. "Picking-replenishment synchronization for robotic forward-reserve warehouses," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 144(C).
    8. Derhami, Shahab & Smith, Jeffrey S. & Gue, Kevin R., 2020. "A simulation-based optimization approach to design optimal layouts for block stacking warehouses," International Journal of Production Economics, Elsevier, vol. 223(C).
    9. Zhang, Canrong & Wang, Qi & Yuan, Guoping, 2023. "Novel models and algorithms for location assignment for outbound containers in container terminals," European Journal of Operational Research, Elsevier, vol. 308(2), pages 722-737.
    10. Yang, Peng & Zhao, Zhijie & Guo, Huijie, 2020. "Order batch picking optimization under different storage scenarios for e-commerce warehouses," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 136(C).
    11. 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).
    12. Kaibo Liang & Li Zhou & Jianglong Yang & Huwei Liu & Yakun Li & Fengmei Jing & Man Shan & Jin Yang, 2023. "Research on a Dynamic Task Update Assignment Strategy Based on a “Parts to Picker” Picking System," Mathematics, MDPI, vol. 11(7), pages 1-29, March.
    13. David Winkelmann & Frederik Tolkmitt & Matthias Ulrich & Michael Romer, 2022. "Integrated storage assignment for an e-grocery fulfilment centre: Accounting for day-of-week demand patterns," Papers 2209.03998, arXiv.org, revised May 2023.
    14. Hsieh, Ling-Feng & Huang, Yi-Chen, 2011. "New batch construction heuristics to optimise the performance of order picking systems," International Journal of Production Economics, Elsevier, vol. 131(2), pages 618-630, June.
    15. Guo, Xiaolong & Chen, Ran & Du, Shaofu & Yu, Yugang, 2021. "Storage assignment for newly arrived items in forward picking areas with limited open locations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 151(C).
    16. Fatemi-Anaraki, Soroush & Tavakkoli-Moghaddam, Reza & Foumani, Mehdi & Vahedi-Nouri, Behdin, 2023. "Scheduling of Multi-Robot Job Shop Systems in Dynamic Environments: Mixed-Integer Linear Programming and Constraint Programming Approaches," Omega, Elsevier, vol. 115(C).
    17. Lihle N. Tikwayo & Tebello N. D. Mathaba, 2023. "Applications of Industry 4.0 Technologies in Warehouse Management: A Systematic Literature Review," Logistics, MDPI, vol. 7(2), pages 1-19, April.
    18. Mehrnaz Bathaee & Hamed Nozari & Agnieszka Szmelter-Jarosz, 2023. "Designing a New Location-Allocation and Routing Model with Simultaneous Pick-Up and Delivery in a Closed-Loop Supply Chain Network under Uncertainty," Logistics, MDPI, vol. 7(1), pages 1-33, January.
    19. Pazour, Jennifer A. & Carlo, Héctor J., 2015. "Warehouse reshuffling: Insights and optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 73(C), pages 207-226.
    20. Niraj Ramesh Dayama & Andreas Ernst & Mohan Krishnamoorthy & Vishnu Narayanan & Narayan Rangaraj, 2017. "New models and algorithms for the container stack rearrangement problem by yard cranes in maritime ports," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 307-348, December.

    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:gam:jmathe:v:11:y:2023:i:7:p:1577-:d:1106408. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.