Science China Information Sciences

, Volume 53, Issue 5, pp 885–895 | Cite as

Basin filling algorithm for the circular packing problem with equilibrium behavioral constraints

Research Papers

Abstract

With the background of the satellite module layout design, the circular packing problem with equilibrium behavioral constraints is a layout optimization problem and NP-hard problem in math. For lack of a powerful optimization method, this problem is hard to solve. The energy landscape paving (ELP) method is a class of stochastic global optimization algorithms based on the Monte Carlo sampling. Based on the quasiphysical strategy and the penalty function method, the problem is converted into an unconstrained optimization problem. Here by combining the improved ELP method, the gradient method based on local search and the heuristic configuration update mechanism, a new global search algorithm, basin filling algorithm, is put forward. The numerical results show that the proposed algorithm is effective to solving the circular packing problem with equilibrium behavioral constraints, and is easy to be popularized to other layout optimization problems.

Keywords

equilibrium behavioral constraints packing problem layout optimization 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Lodi A, Martello S, Monaci M. Two-dimensional packing problems: a survey. Eur J Oper Res, 2002, 141: 241–252MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    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–33MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Huang W Q, Liu J F. A deterministic heuristic algorithm based on Euclidian distance for solving the rectangles packing problem. Chinese J Comput, 2006, 29: 734–739Google Scholar
  4. 4.
    Huang W Q, He K. A caving degree approach for the single container loading problem. Eur J Oper Res, 2009, 196: 93–101MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Wei L J, Zhang D F, Chen Q S. A least wasted first heuristic algorithm for the rectangular packing problem. Comput Oper Res, 2009, 36: 1608–1614MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    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
  7. 7.
    Tang F, Teng H F. A modified genetic algorithm and its application to layout optimization. J Softw, 1999, 10: 1096–1102Google Scholar
  8. 8.
    Qian Z Q, Teng H F, Sun Z G. Human-computer interactive genetic algorithm and its application to constrained layout optimization. Chinese J Comput, 2001, 24: 553–559Google Scholar
  9. 9.
    Yu Y, Cha J Z, Tang X J. Learning based GA and application in packing. Chinese J Comput, 2001, 24: 1242–1249MathSciNetGoogle Scholar
  10. 10.
    Li N, Liu F, Sun D B. A study on the particle swarm optimization with mutation operator constrained layout optimization. Chinese J Comput, 2004, 27: 897–903MathSciNetGoogle Scholar
  11. 11.
    Zhou C, Gao L, Gao H B. Particle swarm optimization based algorithm for constrained layout optimization. Contral Decision, 2005, 20: 36–40MATHGoogle Scholar
  12. 12.
    Lei K Y, Qiu Y H. A study of constrained layout optimization using adaptive particle swarm optimizer. J Comput Research Develop, 2006, 43: 1724–1731CrossRefGoogle Scholar
  13. 13.
    Huang W Q, Chen M. Note on: an improved algorithm for the packing of unequal circles within a larger containing circle. Comput Indust Eng, 2006, 50: 338–344CrossRefGoogle Scholar
  14. 14.
    Wang H Q, Huang W Q, Zhang Q A, et al. An improved algorithm for the packing of unequal circles within a larger containing circle. Eur J Oper Res, 2002, 141: 440–453MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Wang Y S, Shi Y J, Teng H F. An improved scatter search for circles packing problem with the equilibrium constraint. Chinese J Comput, 2009, 32: 1214–1221CrossRefGoogle Scholar
  16. 16.
    Blum C, Roli A. Meta-heuristic in combinatorial optimization: overview and conceptual comparison. ACM Comput Survey, 2003, 35: 268–308CrossRefGoogle Scholar
  17. 17.
    Hansmann U H E, Wille L T. Global optimization by energy landscape paving. Phys Rev Lett, 2002, 88: 068105CrossRefGoogle Scholar
  18. 18.
    Besold G, Risbo J, Mouritsen O G. Efficient Monte Carlo sampling by direct flattening of free energy barriers. Comput Mater Sci, 1999, 15: 311–340CrossRefGoogle Scholar
  19. 19.
    Cvijovic D, Klinowski J. Taboo search: an approach to the multiple minima problem. Science, 1995, 267: 664–666CrossRefMathSciNetGoogle Scholar
  20. 20.
    Schug A, Wenzel W, Hansmann U H E. Energy landscape paving simulations of the trp-cage protein. J Chem Phys, 2005, 122: 194711CrossRefGoogle Scholar
  21. 21.
    Liu J F, Huang W Q. Studies of finding low energy configuration in off-lattice protein models. J Theor Comput Chem, 2006, 5: 587–594CrossRefGoogle Scholar
  22. 22.
    Bachmann M, Arkin H, Janke W. Multicanonical study of coarse-grained off-lattice models for folding heteropolymers. Phys Rev E, 2005, 71: 031906CrossRefMathSciNetGoogle Scholar
  23. 23.
    Huang W Q, Xu R C. Two personnification strategies for solving circles packing problem. Sci China Ser E-Tech Sci, 1999, 42: 595–602MATHCrossRefGoogle Scholar

Copyright information

© Science China Press and Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  1. 1.School of Computer and SoftwareNanjing University of Information Science & TechnologyNanjingChina
  2. 2.School of Mathematics and PhysicsNanjing University of Information Science & TechnologyNanjingChina

Personalised recommendations