Average Case Analysis of Blocks Relocation Heuristics
We consider the Blocks Relocation Problem (BRP) where some blocks stored in stacks have to be removed and where the order in which the blocks are to be removed is given in advance. We are only allowed to remove a block on top of a stack or to relocate a block from the top of a stack to the top of another stack. The objective is to remove the blocks using a minimum number of relocations. We present a simple BRP heuristic similar to a heuristic presented by Caserta and Voß. Under certain assumptions on the stack capacity and the initial stack height, we formally show that the heuristic produces high quality solutions with high probability for large BRP instances. For any positive numbers ε 1 and ε 2 we show how the heuristic – under the assumptions mentioned above – can be used to construct a polynomial time algorithm that for any n solves a fraction of 1 − ε 1 of all BRP instances of size n using no more than 1 + ε 2 times the optimal number of relocations.
KeywordsOptimal Number Polynomial Time Algorithm High Quality Solution Arrival Sequence Grey Block
Unable to display preview. Download preview PDF.
- 2.Auger, A., Doerr, B.: Theory of Randomized Search Heuristics: Foundations and Recent Developments. World Scientific Publishing Co., River Edge (2011)Google Scholar
- 3.Ausiello, G., Protasi, M., Marchetti-Spaccamela, A., Gambosi, G., Crescenzi, P., Kann, V.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, New York (1999)Google Scholar
- 8.Kobayashi, H., Mark, B.L., Turin, W.: Probability, Random Processes, and Statistical Analysis: Applications to Communications, Signal Processing, Queueing Theory and Mathematical Finance. Cambridge University Press (2012)Google Scholar
- 11.Vijayaraghavan, A.: Beyond Worst-case Analysis in Approximation Algorithms. Ph.D. thesis, Princeton University (2012)Google Scholar