Investigating the Dynamic Block Relocation Problem

Research output: Chapter in Book/Report/Conference proceedingsConference contributionpeer-review

2 Citations (Scopus)


The dynamic block relocation problem is a variant of the BRP where the initial configuration and retrieval priorities are known but are subject to change during the implementation of an optimized solution. This paper investigates two kinds of potential changes. The exchange of assigned priorities between two blocks and the arrival of new blocks. For both kind of events we present algorithms that can adjust an existing solution to the changed situation. These algorithms are combined with a branch and bound based solver to enable online optimization with look-ahead. Our experiments show that the algorithms enable finding better solutions in a shorter time after a event occurs.

Original languageEnglish
Title of host publicationComputer Aided Systems Theory – EUROCAST 2019 - 17th International Conference, Revised Selected Papers
EditorsRoberto Moreno-Díaz, Alexis Quesada-Arencibia, Franz Pichler
Number of pages8
ISBN (Print)9783030450922
Publication statusPublished - 2020
Event17th International Conference on Computer Aided Systems Theory, EUROCAST 2019 - Las Palmas de Gran Canaria, Spain
Duration: 17 Feb 201922 Feb 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12013 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference17th International Conference on Computer Aided Systems Theory, EUROCAST 2019
CityLas Palmas de Gran Canaria


  • Changing priorities
  • Dynamic block relocation problem


Dive into the research topics of 'Investigating the Dynamic Block Relocation Problem'. Together they form a unique fingerprint.

Cite this