Advertisement

Science China Information Sciences

, Volume 56, Issue 9, pp 1–14 | Cite as

Tabu search algorithm combined with global perturbation for packing arbitrary sized circles into a circular container

  • WenQi Huang
  • ZhangHua Fu
  • RuChu Xu
Research Paper

Abstract

The arbitrary sized circle packing problem (ACP) is concerned about how to pack a number of arbitrary sized circles into a smallest possible circular container without overlapping. As a classical NP-hard problem, ACP is theoretically important and is often encountered in practical applications. Based on the already existing Quasi-physical method, this paper proposes a hybrid algorithm named GP-TS which combines tabu search with global perturbation to solve the two-dimensional ACP. The Quasi-physical method is a continuous optimization method which is used to obtain a local optimal configuration from any initial configuration. The tabu search procedure iteratively updates the incumbent configuration with its best neighboring configuration according to some forbidden rule and aspiration criterion. If the configuration obtained by the tabu search procedure does not satisfy the constraints, the global perturbation operator is subsequently applied in order that the search jumps out of the current local optimum without destroying the incumbent configuration too much. After that, the tabu search procedure is launched again. GP-TS is performed by repeating this process until the stop criterion is met. Computational experiments based on 3 sets of representative instances show that GP-TS can improve many best known results within reasonable time.

Keywords

packing tabu search global perturbation quasi-physical quasi-human 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Hochbaum D S, Maass W. Approximation schemes for covering and packing problems in image processing and VLSI. J ACM, 1985, 1: 130–136MathSciNetCrossRefGoogle Scholar
  2. 2.
    Metcalfe G, Shinbrot T, McCarthy J J, et al. Avalanche mixing of granular solids. Nature, 1995, 374: 39–41CrossRefGoogle Scholar
  3. 3.
    Rossi G, Ferrando R. Global optimization by excitable walkers. Chem Phys Lett, 2006, 423: 17–22CrossRefGoogle Scholar
  4. 4.
    Takeuchi H. Geometry optimization of carbon dioxide clusters (CO2)n for 4 n 40. J Phys Chem A, 2008, 112: 7492–7497CrossRefGoogle Scholar
  5. 5.
    Cui Y D. Generating optimal T-shape cutting patterns for circular blanks. Comput Oper Res, 2005, 32: 143–152CrossRefzbMATHGoogle Scholar
  6. 6.
    Fraser H J, George J A. Integrated container loading software for pulp and paper industry. Eur J Oper Res, 1994, 77: 466–474CrossRefzbMATHGoogle Scholar
  7. 7.
    Birgin E G, Martinez J M, Ronconi D P. Optimizing the packing of cylinders into a rectangular container: a nonlinear approach. Eur J Oper Res, 2005, 160: 19–33MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Adickes M D, Billo R E, Norman B A, et al. Optimization of indoor wireless communication network layouts. IIE Trans, 2002, 34: 823–836Google Scholar
  9. 9.
    Liu J F, Li G. Basin filling algorithm for the circular packing problem with equilibrium behavioral constraints. Sci China Inf Sci, 2010, 53: 885–895MathSciNetCrossRefGoogle Scholar
  10. 10.
    Teng H F, Sun S L, Ge W H, et al. Layout optimization for the dishes installed on a rotating table the packing problem with equilibrium behavioral constraints. Sci China Ser A, 1994, 37: 1272–1280MathSciNetGoogle Scholar
  11. 11.
    Garey M R, Johnson D S. Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman: San Francisco, 1979zbMATHGoogle Scholar
  12. 12.
    Huang W Q, Li Y, Li C M, et al. New heuristics for packing unequal circles into a circular container. Comput Oper Res, 2006, 33: 2125–2142CrossRefzbMATHGoogle Scholar
  13. 13.
    Lü Z P, Huang W Q. PERM for solving circle packing problem. Comput Oper Res, 2008, 35: 1742–1755CrossRefzbMATHGoogle Scholar
  14. 14.
    Akeb H, Hifi M, M’Hallah R. A beam search algorithm for the circular packing problem. Comput Oper Res, 2009, 36: 1513–1528MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Akeb H, Hifi M, M’Hallah R. Adaptive beam search look-ahead algorithms for the circular packing problem. Int Trans Oper Res, 2010, 17: 553–575CrossRefzbMATHGoogle Scholar
  16. 16.
    Hifi M, M’Hallah R. A dynamic adaptive local search algorithm for the circular packing problem. Eur J Oper Res, 2007, 183: 1280–1294MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Al-Mudahka I, Hifi M, M’Hallah R. Packing circles in the smallest circle: an adaptive hybrid algorithm. J Oper Res Soc, 2010, doi: 10.1057/jors.2010.157Google Scholar
  18. 18.
    Huang W Q, Xu R C. Two personnification strategies for solving circles packing problem. Sci China Ser E-Tech Sci, 1999, 42: 595–602CrossRefzbMATHGoogle Scholar
  19. 19.
    Wang H Q, Huang W Q, Zhang Q, et al. An improved algorithm for the packing of unequal circles within a larger containing circle. Eur J Oper Res, 2002, 141: 440–453MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Huang W Q, Kang Y. A short note on a simple search heuristic for the disk packing problem. Ann Oper Res, 2004, 131: 101–108MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Addis B, Locatelli M, Schoen F. Efficiently packing unequal disks in a circle. Oper Res Lett, 2008, 36: 37–42MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Grosso A, Jamali A R M J U, Locatelli M, et al. Solving the problem of packing equal and unequal circles in a circular container. J Global Optim, 2010, 47: 63–81MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    Zhang D F, Deng A S. An effective hybrid algorithm for the problem of packing circles into a larger containing circle. Comput Oper Res, 2005, 32: 1941–1951CrossRefzbMATHGoogle Scholar
  24. 24.
    Liu J F, Xue S J, Liu Z X, et al. An improved energy landscape paving algorithm for the problem of packing circles into a larger containing circle. Comput Ind Eng, 2009, 57: 1144–1149CrossRefGoogle Scholar
  25. 25.
    Liu J F, Wang Y L, Pan J J. Efficiently packing circles into a larger containing circle. LNCS, 2010, 5938: 250–256Google Scholar
  26. 26.
    Castillo I, Kampas F J, Printer J D. Solving circle packing problems by global optimization: numerical results and industrial applications. Eur J Oper Res, 2008, 191: 786–802CrossRefzbMATHGoogle Scholar
  27. 27.
    Hifi M, M’Hallah R. A literature review on circle and sphere packing problems: models and methodologies. Advance Oper Res, 2009, doi: 10.1155/2009/150624Google Scholar
  28. 28.
    F Glover. Tabu search: Part 1. ORSA J Comput, 1989, 1: 190–261CrossRefGoogle Scholar
  29. 29.
    F Glover. Tabu search: Part 2. ORSA J Comput, 1990, 2: 4–32CrossRefGoogle Scholar

Copyright information

© Science China Press and Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  1. 1.School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhanChina

Personalised recommendations