IDEAS home Printed from https://ideas.repec.org/a/spr/orspec/v45y2023i2d10.1007_s00291-022-00703-x.html
   My bibliography  Save this article

The blocks relocation problem with item families minimizing the number of reshuffles

Author

Listed:
  • Sven Boge

    (Osnabrück University)

  • Sigrid Knust

    (Osnabrück University)

Abstract

In this paper, we consider the process of unloading items from a storage (e.g., a warehouse, depot, etc.). The items are stored in stacks where only the topmost item of each stack can be directly accessed. Each item belongs to a certain family indicating the main type of the item. For a given sequence of families, it has to be decided which item of each demanded family is unloaded from the storage with the objective to minimize the total number of reshuffles. Besides new complexity results, we propose IP formulations and a two-stage simulated annealing algorithm. Computational results are presented for real-world data from a company, benchmark instances from the literature and randomly generated instances with different characteristics.

Suggested Citation

  • Sven Boge & Sigrid Knust, 2023. "The blocks relocation problem with item families minimizing the number of reshuffles," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 45(2), pages 395-435, June.
    • Handle: RePEc:spr:orspec:v:45:y:2023:i:2:d:10.1007_s00291-022-00703-x
    DOI: 10.1007/s00291-022-00703-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00291-022-00703-x
    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/s00291-022-00703-x?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. Ulrich Blasum & Michael R. Bussieck & Winfried Hochstättler & Christoph Moll & Hans-Helmut Scheel & Thomas Winter, 1999. "Scheduling trams in the morning," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 49(1), pages 137-148, March.
    2. Boge, Sven & Knust, Sigrid, 2020. "The parallel stack loading problem minimizing the number of reshuffles in the retrieval stage," European Journal of Operational Research, Elsevier, vol. 280(3), pages 940-952.
    3. Thomas Winter & Uwe Zimmermann, 2000. "Real-time dispatch of trams in storage yards," Annals of Operations Research, Springer, vol. 96(1), pages 287-315, November.
    4. Lehnfeld, Jana & Knust, Sigrid, 2014. "Loading, unloading and premarshalling of stacks in storage areas: Survey and classification," European Journal of Operational Research, Elsevier, vol. 239(2), pages 297-312.
    5. Caserta, Marco & Schwarze, Silvia & Voß, Stefan, 2012. "A mathematical formulation and complexity considerations for the blocks relocation problem," European Journal of Operational Research, Elsevier, vol. 219(1), pages 96-104.
    6. Eglese, R. W., 1990. "Simulated annealing: A tool for operational research," European Journal of Operational Research, Elsevier, vol. 46(3), pages 271-281, June.
    7. Kaufman, L. & Broeckx, F., 1978. "An algorithm for the quadratic assignment problem using Bender's decomposition," European Journal of Operational Research, Elsevier, vol. 2(3), pages 207-211, May.
    8. Singh, Kumar Ashutosh & Srinivas & Tiwari, M. K., 2004. "Modelling the slab stack shuffling problem in developing steel rolling schedules and its solution using improved Parallel Genetic Algorithms," International Journal of Production Economics, Elsevier, vol. 91(2), pages 135-147, September.
    9. L Tang & J Liu & A Rong & Z Yang, 2001. "An effective heuristic algorithm to minimise stack shuffles in selecting steel slabs from the slab yard for heating and rolling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(10), pages 1091-1097, October.
    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. Boysen, Nils & Emde, Simon, 2016. "The parallel stack loading problem to minimize blockages," European Journal of Operational Research, Elsevier, vol. 249(2), pages 618-627.
    2. Boge, Sven & Goerigk, Marc & Knust, Sigrid, 2020. "Robust optimization for premarshalling with uncertain priority classes," European Journal of Operational Research, Elsevier, vol. 287(1), pages 191-210.
    3. Ruiyou Zhang & Shixin Liu & Herbert Kopfer, 2016. "Tree search procedures for the blocks relocation problem with batch moves," Flexible Services and Manufacturing Journal, Springer, vol. 28(3), pages 397-424, September.
    4. Gharehgozli, Amir & Zaerpour, Nima, 2018. "Stacking outbound barge containers in an automated deep-sea terminal," European Journal of Operational Research, Elsevier, vol. 267(3), pages 977-995.
    5. Tanaka, Shunji & Voß, Stefan, 2019. "An exact algorithm for the block relocation problem with a stowage plan," European Journal of Operational Research, Elsevier, vol. 279(3), pages 767-781.
    6. de Melo da Silva, Marcos & Toulouse, Sophie & Wolfler Calvo, Roberto, 2018. "A new effective unified model for solving the Pre-marshalling and Block Relocation Problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 40-56.
    7. Boschma, René & Mes, Martijn R.K. & de Vries, Leon R., 2023. "Approximate dynamic programming for container stacking," European Journal of Operational Research, Elsevier, vol. 310(1), pages 328-342.
    8. Zehendner, Elisabeth & Caserta, Marco & Feillet, Dominique & Schwarze, Silvia & Voß, Stefan, 2015. "An improved mathematical formulation for the blocks relocation problem," European Journal of Operational Research, Elsevier, vol. 245(2), pages 415-422.
    9. Zweers, Bernard G. & Bhulai, Sandjai & van der Mei, Rob D., 2020. "Optimizing pre-processing and relocation moves in the Stochastic Container Relocation Problem," European Journal of Operational Research, Elsevier, vol. 283(3), pages 954-971.
    10. Gharehgozli, Amir & Yu, Yugang & de Koster, René & Du, Shaofu, 2019. "Sequencing storage and retrieval requests in a container block with multiple open locations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 125(C), pages 261-284.
    11. Lehnfeld, Jana & Knust, Sigrid, 2014. "Loading, unloading and premarshalling of stacks in storage areas: Survey and classification," European Journal of Operational Research, Elsevier, vol. 239(2), pages 297-312.
    12. Feng, Yuanjun & Song, Dong-Ping & Li, Dong & Zeng, Qingcheng, 2020. "The stochastic container relocation problem with flexible service policies," Transportation Research Part B: Methodological, Elsevier, vol. 141(C), pages 116-163.
    13. Ting, Ching-Jung & Wu, Kun-Chih, 2017. "Optimizing container relocation operations at container yards with beam search," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 103(C), pages 17-31.
    14. Hamdouni, Mohamed & Soumis, Francois & Desaulniers, Guy, 2007. "Parking buses in a depot with stochastic arrival times," European Journal of Operational Research, Elsevier, vol. 183(2), pages 502-515, December.
    15. Juan P. Cavada & Cristián E. Cortés & Pablo A. Rey, 2023. "Comparing allocation and relocation policies at a logistics service container terminal: a discrete-event simulation approach," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 31(4), pages 1281-1316, December.
    16. V. Galle & V. H. Manshadi & S. Borjian Boroujeni & C. Barnhart & P. Jaillet, 2018. "The Stochastic Container Relocation Problem," Transportation Science, INFORMS, vol. 52(5), pages 1035-1058, October.
    17. Bacci, Tiziano & Mattia, Sara & Ventura, Paolo, 2020. "A branch-and-cut algorithm for the restricted Block Relocation Problem," European Journal of Operational Research, Elsevier, vol. 287(2), pages 452-459.
    18. 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.
    19. Haahr, Jørgen & Lusby, Richard M., 2017. "Integrating rolling stock scheduling with train unit shunting," European Journal of Operational Research, Elsevier, vol. 259(2), pages 452-468.
    20. Florian Jaehn & Alena Otto & Kilian Seifried, 2018. "Shunting operations at flat yards: retrieving freight railcars from storage tracks," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(2), pages 367-393, March.

    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:orspec:v:45:y:2023:i:2:d:10.1007_s00291-022-00703-x. 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.