Skip to main content
SpringerLink
Log in

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

  • Research Papers
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Lodi A, Martello S, Monaci M. Two-dimensional packing problems: a survey. Eur J Oper Res, 2002, 141: 241–252

    Article  MATH  MathSciNet  Google Scholar 

  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–33

    Article  MATH  MathSciNet  Google Scholar 

  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–739

    Google Scholar 

  4. Huang W Q, He K. A caving degree approach for the single container loading problem. Eur J Oper Res, 2009, 196: 93–101

    Article  MATH  MathSciNet  Google Scholar 

  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–1614

    Article  MATH  MathSciNet  Google Scholar 

  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–1280

    MathSciNet  Google Scholar 

  7. Tang F, Teng H F. A modified genetic algorithm and its application to layout optimization. J Softw, 1999, 10: 1096–1102

    Google Scholar 

  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–559

    Google Scholar 

  9. Yu Y, Cha J Z, Tang X J. Learning based GA and application in packing. Chinese J Comput, 2001, 24: 1242–1249

    MathSciNet  Google Scholar 

  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–903

    MathSciNet  Google Scholar 

  11. Zhou C, Gao L, Gao H B. Particle swarm optimization based algorithm for constrained layout optimization. Contral Decision, 2005, 20: 36–40

    MATH  Google Scholar 

  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–1731

    Article  Google Scholar 

  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–344

    Article  Google Scholar 

  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–453

    Article  MATH  MathSciNet  Google Scholar 

  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–1221

    Article  Google Scholar 

  16. Blum C, Roli A. Meta-heuristic in combinatorial optimization: overview and conceptual comparison. ACM Comput Survey, 2003, 35: 268–308

    Article  Google Scholar 

  17. Hansmann U H E, Wille L T. Global optimization by energy landscape paving. Phys Rev Lett, 2002, 88: 068105

    Article  Google Scholar 

  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–340

    Article  Google Scholar 

  19. Cvijovic D, Klinowski J. Taboo search: an approach to the multiple minima problem. Science, 1995, 267: 664–666

    Article  MathSciNet  Google Scholar 

  20. Schug A, Wenzel W, Hansmann U H E. Energy landscape paving simulations of the trp-cage protein. J Chem Phys, 2005, 122: 194711

    Article  Google Scholar 

  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–594

    Article  Google Scholar 

  22. Bachmann M, Arkin H, Janke W. Multicanonical study of coarse-grained off-lattice models for folding heteropolymers. Phys Rev E, 2005, 71: 031906

    Article  MathSciNet  Google Scholar 

  23. Huang W Q, Xu R C. Two personnification strategies for solving circles packing problem. Sci China Ser E-Tech Sci, 1999, 42: 595–602

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer and Software, Nanjing University of Information Science & Technology, Nanjing, 210044, China

    JingFa Liu

  2. School of Mathematics and Physics, Nanjing University of Information Science & Technology, Nanjing, 210044, China

    Gang Li

Authors
  1. JingFa Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gang Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to JingFa Liu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, J., Li, G. Basin filling algorithm for the circular packing problem with equilibrium behavioral constraints. Sci. China Inf. Sci. 53, 885–895 (2010). https://doi.org/10.1007/s11432-010-0080-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-010-0080-2

Keywords

Search

Navigation