Advertisement

Average Case Analysis of Blocks Relocation Heuristics

  • Martin Olsen
  • Allan Gross
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8760)

Abstract

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.

Keywords

Optimal Number Polynomial Time Algorithm High Quality Solution Arrival Sequence Grey Block 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aldous, D., Diaconis, P.: Longest increasing subsequences: From patience sorting to the Baik-Deift-Johansson theorem. Bulletin of the American Mathematical Society 36, 413–432 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Auger, A., Doerr, B.: Theory of Randomized Search Heuristics: Foundations and Recent Developments. World Scientific Publishing Co., River Edge (2011)Google Scholar
  3. 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
  4. 4.
    Caserta, M., Schwarze, S., Voß, S.: A mathematical formulation and complexity considerations for the blocks relocation problem. European Journal of Operational Research 219, 96–104 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Caserta, M., Voß, S., Sniedovich, M.: Applying the corridor method to a blocks relocation problem. OR Spectrum 33, 915–929 (2011)CrossRefzbMATHGoogle Scholar
  6. 6.
    Forster, F., Bortfeldt, A.: A tree search procedure for the container relocation problem. Computers & Operations Research 39(2), 299–309 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Kim, K.H., Hong, G.P.: A heuristic rule for relocating blocks. Computers & Operations Research 33, 940–954 (2006)CrossRefzbMATHGoogle Scholar
  8. 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
  9. 9.
    Petering, M.E., Hussein, M.I.: A new mixed integer program and extended look-ahead heuristic algorithm for the blocks relocation problem. European Journal of Operational Research 231, 120–130 (2013)CrossRefGoogle Scholar
  10. 10.
    Rei, R.J., Pedroso, J.P.: Tree search for the stacking problem. Annals of Operations Research 203, 371–388 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Vijayaraghavan, A.: Beyond Worst-case Analysis in Approximation Algorithms. Ph.D. thesis, Princeton University (2012)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Martin Olsen
    • 1
  • Allan Gross
    • 1
  1. 1.AU HerningAarhus UniversityDenmark

Personalised recommendations