Skip to main content
SpringerLink
Log in

Efficiently Packing Circles into a Larger Containing Circle

  • Conference paper
High Performance Computing and Applications

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5938))

Abstract

The circles packing problem consists in placing a set of circles into a larger containing circle without overlap. The objective is to determine the smallest radius of the containing circle as well as the coordinates of the center of each given circle. Lacking powerful optimization method is the key obstacle to solve this problem. A novel heuristic global optimization method, energy landscape paving (ELP) which combines core ideas from energy surface deformation and taboo search, is introduced. By giving some critical revisions to the ELP method and incorporating new configuration update strategy into it, an improved energy landscape paving (IELP) algorithm is put forward for the circles packing problem. The effectiveness of the algorithm is demonstrated through a set of typical instances taken from the literature.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Birgin, E.G., Martinez, J.M., Ronconi, D.P.: Optimizing the packing of cylinders into a rectangular container: a nonlinear approach. European Journal of Operational Research 160, 19–33 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  2. Mladenović, N., Plastria, F., Urosević, D.: Reformulation descent applied to circle packing problems. Computers and Operations Research 32, 2419–2434 (2005)

    Article  MATH  Google Scholar 

  3. Huang, W.Q., Kang, Y.: A short note on a simple search heuristic for the disk packing problem. Annals of Operations Research 131, 101–108 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  4. Wang, H.Q., Huang, W.Q., Zhang, Q.A., Xu, D.M.: An improved algorithm for the packing of unequal circles within a larger containing circle. European Journal of Operational Research 141(2), 440–453 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  5. Huang, W.Q., Li, Y., Li, C.M., Xu, R.C.: New heuristics for packing unequal circle into a circular container. Computers and Operations Research 33, 2125–2142 (2006)

    Article  MATH  Google Scholar 

  6. Lü, Z.P., Huang, W.Q.: PERM for solving circle packing problem. Computers and Operations Research 35(5), 1742–1755 (2008)

    Article  MATH  Google Scholar 

  7. Akeb, H., Hifi, M., M’Hallah, R.: A beam search algorithm for the circular packing problem. Computers and Operations Research 36(5), 1513–1528 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  8. Hansmann, U.H.E., Wille, L.T.: Global optimization by energy landscape paving. Physical Review Letters 88(6), 068105 (2002)

    Google Scholar 

  9. Liu, J.F., Huang, W.Q.: Studies of finding low energy configuration in off-lattice protein models. Journal of Theoretical and Computational Chemistry 5(3), 587–594 (2006)

    Article  Google Scholar 

  10. Zhang, D.F., Deng, A.S.: An effective hybrid algorithm for the problem of packing circles into a larger containing circle. Computers and Operations Research 32(8), 1941–1951 (2005)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Jingfa Liu & Jinji Pan

  2. School of Electronic & Information Engineering, Nanjing University of Information Science and Technology, Nanjing, 210044, China

    Yali Wang

Authors
  1. Jingfa Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yali Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jinji Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Engineering and Science, Shanghai University, 200072, Shanghai, P.R. China

    Wu Zhang  & Weiqin Tong  & 

  2. Schulich School of Engineering, University of Calgary, T2N 1N4, Calgary, AB, Canada

    Zhangxin Chen

  3. Department of Mathematics, University of Wyoming, 1000 University Avenue, 82071-3036, Laramie, WY, USA

    Craig C. Douglas

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, J., Wang, Y., Pan, J. (2010). Efficiently Packing Circles into a Larger Containing Circle. In: Zhang, W., Chen, Z., Douglas, C.C., Tong, W. (eds) High Performance Computing and Applications. Lecture Notes in Computer Science, vol 5938. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11842-5_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11842-5_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11841-8

  • Online ISBN: 978-3-642-11842-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation