Investigating the dynamic block relocation problem
S. Raggl, A. Beham, M. Affenzeller - Investigating the dynamic block relocation problem - Computer Aided Systems Theory – EUROCAST 2019, Las Palmas, Gran Canaria, Spain, 2019, pp. 438-445
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 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 occures.