IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v31y2023i1d10.1007_s11750-022-00625-5.html
   My bibliography  Save this article

Storage location assignment of steel coils in a manufacturing company: an integer linear programming model and a greedy randomized adaptive search procedure

Author

Listed:
  • Emrah B. Edis

    (Manisa Celal Bayar University)

  • Ozlem Uzun Araz

    (Manisa Celal Bayar University)

  • Ozgur Eski

    (Manisa Celal Bayar University)

  • Rahime Sancar Edis

    (Manisa Celal Bayar University)

Abstract

Warehouse operations have a significant role to survive in today’s competitive world. Hence, companies introduce various solutions to improve efficiency of warehouses which is mainly affected by the performance of storage operations. This study deals with a real-life storage location and assignment problem encountered in a fastener company where several orders consisting steel coils are to be assigned into storage areas. Three individual objective functions; minimizing the number of lanes to be used, minimizing area usage, and maximizing volume utilization are considered. For the investigated problem, first, an integer linear programming (ILP) model is developed. Then, a greedy randomized adaptive search procedure (GRASP) which provides quick and efficient solutions is proposed. The proposed methods are applied to the real problem case and the results are compared with the current storage assignment. Moreover, through an extensive computational study, the performances of proposed methods are evaluated on a set of test problems with different range of characteristics. The computational results show that the ILP model proves optimality in most of the problem instances within reasonable computation times, while the GRASP gives quick solutions with small optimality gaps.

Suggested Citation

  • Emrah B. Edis & Ozlem Uzun Araz & Ozgur Eski & Rahime Sancar Edis, 2023. "Storage location assignment of steel coils in a manufacturing company: an integer linear programming model and a greedy randomized adaptive search procedure," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(1), pages 67-109, April.
    • Handle: RePEc:spr:topjnl:v:31:y:2023:i:1:d:10.1007_s11750-022-00625-5
    DOI: 10.1007/s11750-022-00625-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11750-022-00625-5
    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/s11750-022-00625-5?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. Lai, K. K. & Xue, Jue & Zhang, Guoqing, 2002. "Layout design for a paper reel warehouse: A two-stage heuristic approach," International Journal of Production Economics, Elsevier, vol. 75(3), pages 231-243, February.
    2. Zapfel, Gunther & Wasner, Michael, 2006. "Warehouse sequencing in the steel supply chain as a generalized job shop model," International Journal of Production Economics, Elsevier, vol. 104(2), pages 482-501, December.
    3. Gianluca Nastasi & Valentina Colla & Silvia Cateni & Simone Campigli, 2018. "Implementation and comparison of algorithms for multi-objective optimization based on genetic algorithms applied to the management of an automated warehouse," Journal of Intelligent Manufacturing, Springer, vol. 29(7), pages 1545-1557, October.
    4. Lixin Tang & Ren Zhao & Jiyin Liu, 2012. "Models and algorithms for shuffling problems in steel plants," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(7), pages 502-524, October.
    5. 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.
    6. Yun Dong & Ren Zhao & Wen Xu & Miao Yang & Wei Jiang, 2021. "Integrated optimisation of consolidation and stowage planning of steel coil ships using differential evolution," International Journal of Production Research, Taylor & Francis Journals, vol. 59(4), pages 1239-1257, February.
    7. Lixin Tang & Jiyin Liu & Fei Yang & Feng Li & Kun Li, 2015. "Modeling and solution for the ship stowage planning problem of coils in the steel industry," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(7), pages 564-581, October.
    8. Lixin Tang & Xie Xie & Jiyin Liu, 2014. "Crane scheduling in a warehouse storing steel coils," IISE Transactions, Taylor & Francis Journals, vol. 46(3), pages 267-282.
    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. 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).
    2. Yuan, Yuan & Tang, Lixin, 2017. "Novel time-space network flow formulation and approximate dynamic programming approach for the crane scheduling in a coil warehouse," European Journal of Operational Research, Elsevier, vol. 262(2), pages 424-437.
    3. Wang, Haibo & Alidaee, Bahram, 2019. "The multi-floor cross-dock door assignment problem: Rising challenges for the new trend in logistics industry," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 132(C), pages 30-47.
    4. 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).
    5. David Boywitz & Nils Boysen & Dirk Briskorn, 2016. "Resequencing with parallel queues to minimize the maximum number of items in the overflow area," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(5), pages 401-415, August.
    6. Mofidi, Seyed Shahab & Pazour, Jennifer A. & Roy, Debjit, 2018. "Proactive vs. reactive order-fulfillment resource allocation for sea-based logistics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 114(C), pages 66-84.
    7. 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.
    8. Thierry Sauvage & Tony Cragg & Sarrah Chraibi & Oussama El Khalil Houssaini, 2018. "Running the Machine Faster: Acceleration, Humans and Warehousing," Post-Print hal-02905068, HAL.
    9. Jone R. Hansen & Kjetil Fagerholt & Magnus Stålhane & Jørgen G. Rakke, 2020. "An adaptive large neighborhood search heuristic for the planar storage location assignment problem: application to stowage planning for Roll-on Roll-off ships," Journal of Heuristics, Springer, vol. 26(6), pages 885-912, December.
    10. Gianluca Nastasi & Valentina Colla & Silvia Cateni & Simone Campigli, 2018. "Implementation and comparison of algorithms for multi-objective optimization based on genetic algorithms applied to the management of an automated warehouse," Journal of Intelligent Manufacturing, Springer, vol. 29(7), pages 1545-1557, October.
    11. Parikh, Pratik J. & Meller, Russell D., 2010. "A travel-time model for a person-onboard order picking system," European Journal of Operational Research, Elsevier, vol. 200(2), pages 385-394, January.
    12. van Gils, Teun & Ramaekers, Katrien & Braekers, Kris & Depaire, Benoît & Caris, An, 2018. "Increasing order picking efficiency by integrating storage, batching, zone picking, and routing policy decisions," International Journal of Production Economics, Elsevier, vol. 197(C), pages 243-261.
    13. Rafael Diaz, 2016. "Using dynamic demand information and zoning for the storage of non-uniform density stock keeping units," International Journal of Production Research, Taylor & Francis Journals, vol. 54(8), pages 2487-2498, April.
    14. 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).
    15. Ene, Seval & Küçükoğlu, İlker & Aksoy, Aslı & Öztürk, Nursel, 2016. "A genetic algorithm for minimizing energy consumption in warehouses," Energy, Elsevier, vol. 114(C), pages 973-980.
    16. Boysen, Nils & Briskorn, Dirk & Meisel, Frank, 2017. "A generalized classification scheme for crane scheduling with interference," European Journal of Operational Research, Elsevier, vol. 258(1), pages 343-357.
    17. 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).
    18. Shiva Abdoli & Sami Kara, 2017. "A Modelling Framework to Design Executable Logical Architecture of Engineering Systems," Modern Applied Science, Canadian Center of Science and Education, vol. 11(9), pages 1-75, September.
    19. 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.
    20. Van Nieuwenhuyse, Inneke & de Koster, René B.M., 2009. "Evaluating order throughput time in 2-block warehouses with time window batching," International Journal of Production Economics, Elsevier, vol. 121(2), pages 654-664, October.

    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:topjnl:v:31:y:2023:i:1:d:10.1007_s11750-022-00625-5. 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.