Skip to main content
Registrieren
Springer Professional
SUCHE
MENÜ 1 2 3 4
nach oben

Tipp

Weitere Artikel dieser Ausgabe durch Wischen aufrufen

10.01.2023 | Original Article

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

verfasst von: Sven Boge, Sigrid Knust

Erschienen in: OR Spectrum

Einloggen, um Zugang zu erhalten
share
TEILEN

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.

Sie möchten Zugang zu diesem Inhalt erhalten? Dann informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 58.000 Bücher
  • über 300 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko





Jetzt 90 Tage mit der neuen Mini-Lizenz testen!

Jetzt informieren

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 69.000 Bücher
  • über 500 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt 90 Tage mit der neuen Mini-Lizenz testen!

Jetzt informieren
Anhänge
Nur mit Berechtigung zugänglich
Literatur
Blasum U, Bussieck MR, Hochstättler W, Moll C, Scheel H-H, Winter T (1999) Scheduling trams in the morning. Math Methods Oper Res 49(1):137–148 CrossRef
Boge S, Knust S (2020) The parallel stack loading problem minimizing the number of reshuffles in the retrieval stage. Eur J Oper Res 280(3):940–952 CrossRef
Caserta M, Schwarze S, Voß S (2012) A mathematical formulation and complexity considerations for the blocks relocation problem. Eur J Oper Res 219(1):96–104 CrossRef
Dekker R, Voogd P, van Asperen E (2006) Advanced methods for container stacking. OR Spectrum 28(4):563–586 CrossRef
Eglese RW (1990) Simulated annealing: a tool for operational research. Eur J Oper Res 46(3):271–281 CrossRef
Expósito-Izquierdo C, Melián-Batista B, Moreno-Vega JM (2012) Pre-marshalling problem: heuristic solution method and instances generator. Expert Syst Appl 39(9):8337–8349 CrossRef
Fernandes E, Freire L, Passos A, Street A (2012) Solving the non-linear slab stack shuffling problem using linear binary integer programming. In: EngOpt 2012-3rd international conference on engineering optimization
Forster F, Bortfeldt A (2012) A tree search procedure for the container relocation problem. Comput Oper Res 39(2):299–309 CrossRef
Jin B, Zhu W, Lim A (2015) Solving the container relocation problem by an improved greedy look-ahead heuristic. Eur J Oper Res 240(3):837–847 CrossRef
Kaufman L, Broeckx F (1978) An algorithm for the quadratic assignment problem using Bender’s decomposition. Eur J Oper Res 2(3):207–211 CrossRef
Lehnfeld J, Knust S (2014) Loading, unloading and premarshalling of stacks in storage areas: survey and classification. Eur J Oper Res 239(2):297–312 CrossRef
Li T, Luan Z, Wang B, Dong G (2017) Estimation of distribution algorithm for solving the slab stack shuffling and relocation problem. Xitong Gongcheng Lilun yu Shijian/Syst Eng Theory Pract 37:2955–2964
Ren H, Tang L (2010) Modeling and an ILP-based algorithm framework for the slab stack shuffling problem considering crane scheduling. In: 2010 international conference on computing, control and industrial engineering, vol 2, pp 3–6
Singh KA, Tiwari MK (2004) Modelling the slab stack shuffling problem in developing steel rolling schedules and its solution using improved parallel genetic algorithms. Int J Prod Econ 91(2):135–147 CrossRef
Tang L, Ren H (2010) Modelling and a segmented dynamic programming-based heuristic approach for the slab stack shuffling problem. Comput Oper Res 37(2):368–375 CrossRef
Tang L, Liu J, Rong A, Yang Z (2001) An effective heuristic algorithm to minimise stack shuffles in selecting steel slabs from the slab yard for heating and rolling. J Oper Res Soc 52(10):1091–1097 CrossRef
Tang L, Liu J, Rong A, Yang Z (2002) Modelling and a genetic algorithm solution for the slab stack shuffling problem when implementing steel rolling schedules. Int J Prod Res 40(7):1583–1595 CrossRef
Winter T, Zimmermann UT (2000) Real-time dispatch of trams in storage yards. Ann Oper Res 96(1):287–315 CrossRef
Zhu W, Qin H, Lim A, Zhang H (2012) Iterative deepening A* algorithms for the container relocation problem. IEEE Trans Autom Sci Eng 9(4):710–722 CrossRef
Metadaten
Titel
The blocks relocation problem with item families minimizing the number of reshuffles
verfasst von
Sven Boge
Sigrid Knust
Publikationsdatum
10.01.2023
Verlag
Springer Berlin Heidelberg
Erschienen in
OR Spectrum
Print ISSN: 0171-6468
Elektronische ISSN: 1436-6304
DOI
https://doi.org/10.1007/s00291-022-00703-x

Premium Partner

Pluta
    Bildnachweise