Skip to main content
Log in

On the global minimum in a balanced circular packing problem

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

The paper considers balanced packing problem of a given family of circles into a larger circle of the minimal radius as a multiextremal nonlinear programming problem. We reduce the problem to unconstrained minimization problem of a nonsmooth function by means of nonsmooth penalty functions. We propose an efficient algorithm to search for local extrema and an algorithm for improvement of the lower bound of the global minimum value of the objective function. The algorithms employ nonsmooth optimization methods based on Shor’s r-algorithm. Computational results are given.

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

Access this article

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Che, C., Wang, Y., Teng, H.: Test problems for quasi-satellite packing: cylinders packing with behavior constraints and all the optimal solutions known. Optimization Online (2008). http://www.optimization-online.org/DB_HTML/2008/09/2093.html

  2. Fasano, G., Pinte’r, J.D. (eds.): Modeling and Optimization in Space Engineering. Series: Springer Optimization and Its Applications, Vol. 73, XII, p. 404 (2013)

  3. Jingfa, L., Gang, L.: Basin filling algorithm for the circular packing problem with equilibrium behavioral constraints. Sci. China Inf. Sci. 53(5), 885–895 (2010)

    Article  MathSciNet  Google Scholar 

  4. Kappel, F., Kuntsevich, A.V.: An implementation of Shor’s \(r\)-algorithm. Comput. Optim. Appl. 15(2), 193–205 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  5. Kovalenko, A.A., Pankratov, A.V., Romanova, T.E., Stetsyuk, P.I.: Packing circular cylinders into a cylindrical container taking into account the system behavior constraints. J. Comput. Appl. Math. Ukraine 1(111), 126–134 (2013). (in Russian)

    Google Scholar 

  6. Nenakhov, E.I., Romanova, T.E., Stetsyuk, P.I.: Balanced packing problem of circles in a circle of minimum radius. Theory of optimal solutions, Ukraine, pp. 143–153 (2013) (in Russian)

  7. Oliveira W.A., Moretti A.C., Salles Neto L.L.: A heuristic for the nonidentical circle packing problem. Anais do CNMAC 3:626–632 (2010)

  8. Pshenichnyi, B.N., Sobolenko, L.A.: Linearization method for inverse convex programming. Cybern. Syst. Anal. 31(6), 852–862 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  9. Shor, N.Z.: Nondifferentiable Optimization and Polynomial Problems. Kluwer Academic Publishers, Dordrecht (1998)

    Book  MATH  Google Scholar 

  10. Shor, N.Z., Stetsyuk, P.I.: Modified \(r\)-algorithm to find the global minimum of polynomial functions. Cybern. Syst. Anal. 33(4), 482–497 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  11. Shor, N.Z., Stetsyuk, P.I.: Dual solution of quadratic-type problems by \(r\)-algorithm (subroutine DSQTPr), Abstracts of Second International Workshop “Recent Advances in Non-Differentiable Optimization”, Kyiv, p. 36 (2001)

  12. Shor, N.Z., Zhurbenko, N.G., Likhovid, A.P., Stetsyuk, P.I.: Algorithms of nondifferentiable optimization: development and application. Cybern. Syst. Anal. 39(4), 537–548 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  13. Stetsyuk, P.I.: Ellipsoid Methods and \(r\)-Algorithms. Evrika, Chisinau (2014). (in Russian)

    Google Scholar 

  14. Stetsyuk, P.I., Romanova, T.E., Schiethauer, G.: On the global minimum of the objective function in a balanced circular packing problem. Dopovidi NAN Ukraine 6, 53–57 (2014). (in Russian)

    MATH  Google Scholar 

  15. Xu, Y.-C., Dong, F.-M., Liu, Y., Xiao, R.-B., Amos, M.: Ant Colony Algorithm for the Weighted Item Layout Optimization Problem (2010). arXiv:1001.4099

  16. Xu, Y.-C., Xiao, R.-B., Amos, M.: A novel algorithm for the layout optimization problem. In: Proceedings of the 2007 IEEE Congress on Evolutionary Computation (CEC07). IEEE Press, pp. 3938–3942 (2007)

Download references

Acknowledgments

We are extremely grateful to the associate editor and the anonymous referee for deep and useful comments that helped us considerably improve our paper. The authors acknowledge the support of the Science and Technology Centre in Ukraine and the National Academy of Sciences of Ukraine, grant 5710.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Petro I. Stetsyuk.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Stetsyuk, P.I., Romanova, T.E. & Scheithauer, G. On the global minimum in a balanced circular packing problem. Optim Lett 10, 1347–1360 (2016). https://doi.org/10.1007/s11590-015-0937-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-015-0937-9

Keywords

Navigation