Skip to main content
SpringerLink
Log in

Monkey Algorithm for Packing Circles with Binary Variables

  • Conference paper
  • First Online:
Intelligent Computing & Optimization (ICO 2018)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 866))

Included in the following conference series:

Abstract

The problem of packing non-congruent circles within a rectangular container is considered. The objective is to place the maximum number of circles inside the container such that no circle overlaps with another one. This problem is known to be NP-Hard. Dealing with these problems efficiently is difficult, so heuristic-based methods have been used. In this paper the problem of packing non-congruent circles is solved using the binary version of monkey algorithm. The proposed algorithm uses a grid for approximating the container and considering the grid points as potential positions for assigning centers of the circles. The algorithm consists of five main routines: the climb process, watch-jump process, repairing process, cooperation process and somersault process. Numerical results on packing non-congruent circles are presented to demonstrate the efficiency of the proposed approach.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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

References

  1. Birgin, E.G., Bustamante, L.H., Flores Callisaya H., Martínez, J.M.: Packing circles within ellipses. Int. Trans. Oper. Res. 365–389 (2013)

    Article  MathSciNet  Google Scholar 

  2. Castillo, I., Kampas, F.J., Pintér, J.D.: Solving circle packing problems by global optimization: numerical results and industrial applications. Eur. J. Oper. Res. 191(3), 786–802 (2008)

    Article  MathSciNet  Google Scholar 

  3. Hifi, M., M’Hallah, R.: A literature review on circle and sphere packing problems: models and methodologies. Adv. Oper. Res. 2009, Article ID 150624, 22 (2009)

    Google Scholar 

  4. Flores, J.J., Martínez, J., Calderón, F.: Evolutionary computation solutions to the circle packing problem. Soft. Comput. 20(4), 1521–1535 (2015)

    Article  Google Scholar 

  5. Huang, W., Xu, R.: Two personification strategies for solving circles packing problem. Sci. China Ser. E Technol. Sci. 42(6), 595–602 (1999)

    Article  MathSciNet  Google Scholar 

  6. Birgin, E.G.: Applications of nonlinear programming to packing problems. In: Applications + Practical Conceptualization + Mathematics = fruitful Innovation: Proceedings of the Forum of Mathematics for Industry 2014, Tokyo, pp. 31–39. Springer, Japan (2016)

    Google Scholar 

  7. Huang, W., Ye, T.: Quasi-physical global optimization method for solving the equal circle packing problem. Sci. China Inf. Sci. 54(7), 1333–1339 (2011)

    Article  MathSciNet  Google Scholar 

  8. Miyazawa, F.K., Pedrosa, L.L.C., Schouery, R.C.S., Sviridenko, M., Wakabayashi, Y.: Polynomial-time approximation schemes for circle packing problems. Algorithmica 76(2), 536–568 (2016)

    Article  MathSciNet  Google Scholar 

  9. He, Y., Wu, Y.: Packing non-identical circles within a rectangle with open length. J. Global Optim. 56(3), 1187–1215 (2013)

    Article  MathSciNet  Google Scholar 

  10. Zhao, R., Tang, W.: Monkey algorithm for global numerical optimization. J. Uncertain Syst. 2(3), 165–176 (2007)

    Google Scholar 

  11. Beasley, J.E.: An exact two-dimensional non-guillotine cutting tree search procedure. Oper. Res. 33(1), 49–64 (1985)

    Article  MathSciNet  Google Scholar 

  12. Galiev, S.I., Lisafina, M.S.: Linear models for the approximate solution of the problem of packing equal circles into a given domain. Eur. J. Oper. Res. 230(3), 505–514 (2013)

    Article  MathSciNet  Google Scholar 

  13. Toledo, F.M., Carravilla, M.A., Ribeiro, C., Oliveira, J.F., Gomes, A.M.: The dotted-board model: a new MIP model for nesting irregular shapes. Int. J. Prod. Econ. 145(2), 478–487 (2013)

    Article  Google Scholar 

  14. Litvinchev, I., Ozuna Espinosa, E.L.: Integer programming formulations for approximate packing circles in a rectangular container. Math. Probl. Eng. 2014, Article ID 317697, 6 (2014)

    Google Scholar 

  15. Litvinchev, I., Infante, L., Ozuna Espinosa, E.L.: Packing circular-like objects in a rectangular container. J. Comput. Syst. Sci. Int. 54(2), 259–267 (2015)

    Article  MathSciNet  Google Scholar 

  16. Zhou, Y., Chen, X., Zhou, G.: An improved monkey algorithm for a 0/1 knapsack problem. Appl. Soft Comput. 38(2016), 817–830 (2016)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Engineering, Universidad Anáhuac México. North Campus, Av.Universidad Anáhuac 46, Lomas Anáhuac, 52786, Huixquilucan, Estado de México, Mexico

    Rafael Torres-Escobar

  2. Universidad Panamericana, Facultad de Ingeniería, Augusto Rodin 498, 03920, México, Ciudad de México, Mexico

    José Antonio Marmolejo-Saucedo

  3. Faculty of Mechanical and Electrical Engineering, Nuevo Leon State University, 66450, Monterrey, NL, Mexico

    Igor Litvinchev

  4. Department of Fundamental and Applied Sciences, Universiti Teknologi Petronas, Seri Iskandar, Malaysia

    Pandian Vasant

Authors
  1. Rafael Torres-Escobar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. José Antonio Marmolejo-Saucedo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Igor Litvinchev
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Pandian Vasant
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to José Antonio Marmolejo-Saucedo .

Editor information

Editors and Affiliations

  1. Department of Fundamental and Applied Sciences, Universiti Teknologi Petronas, Tronoh, Perak, Malaysia

    Pandian Vasant

  2. Faculty of Electrical Engineering and Computer Science, VŠB TU Ostrava, Ostrava, Czech Republic

    Ivan Zelinka

  3. Institute of Applied Mathematics, METU, Ankara, Ankara, Turkey

    Gerhard-Wilhelm Weber

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Torres-Escobar, R., Marmolejo-Saucedo, J.A., Litvinchev, I., Vasant, P. (2019). Monkey Algorithm for Packing Circles with Binary Variables. In: Vasant, P., Zelinka, I., Weber, GW. (eds) Intelligent Computing & Optimization. ICO 2018. Advances in Intelligent Systems and Computing, vol 866. Springer, Cham. https://doi.org/10.1007/978-3-030-00979-3_58

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-00979-3_58

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-00978-6

  • Online ISBN: 978-3-030-00979-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation