Journal Journal of Mechanical Engineering – Problemy Mashynobuduvannia
Publisher A. Podgorny Institute for Mechanical Engineering Problems
National Academy of Science of Ukraine
ISSN 0131-2928 (Print), 2411-0779 (Online)
Issue Vol. 19, no. 3, 2016 (September)
Pages 43-60
Cited by J. of Mech. Eng., 2016, vol. 19, no. 3, pp. 43-60



A. Pankratov, A. Podgorny Institute of Mechanical Engineering Problems of NASU (2/10, Pozharsky St., Kharkiv, 61046, Ukraine), e-mail:, ORCID: 0000-0002-2958-8923

T. Romanova, A. Podgorny Institute of Mechanical Engineering Problems of NASU (2/10, Pozharsky St., Kharkiv, 61046, Ukraine), e-mail:, ORCID: 0000-0002-8618-4917

A. Kotelevskiy, A. Podgorny Institute of Mechanical Engineering Problems of NASU (2/10, Pozharsky St., Kharkiv, 61046, Ukraine)



The optimization problem of packing arbitrary objects bounded by arcs of circles and straight line segments into convex regions is considered. A mathematical model is constructed in the form of a problem of non-differentiable optimization, whose set of realizations covers a wide class of scientific and applied problems of geometric design. A methodology for solving packaging problems is developed, taking into account technological constraints (minimum allowable distances, prohibition zones, possibility of continuous transmissions and rotation of objects). A decision space generator and a solver for automatically solving NLP problems of the class under consideration are proposed.


Keywords: packing problem, arbitrary objects, continuous rotations, allowable distances, phi- functions; decision space generator; nonlinear optimization



  1. Wascher, G., Hauner, H., & Schuma, H. (2007). An improved typology of cutting and packing problems. European Journal of Operational Research, no. 183, pp. 1109-1130.
  2. Gomes, A. M. (2013). Irregular Packing Problems: Industrial Applications and New Directions Using Computational Geometry. IFAC Proc. Volumes, vol. 46 (7), pp. 378-38311.
  3. Chazelle, B., Edelsbrunner, H., & Guibas, L. J. (1989). The complexity of cutting complexes. Discrete & Computational Geometry, no. 4(2), pp. 139–81.
  4. Bennell, J. A. & Oliveira J. F. (2008). The geometry of packing problems: A tutorial. European Journal of Operational Research, no. 184(2), pp. 397–415.
  5. Bennell, J. A. & Oliveira J. F. (2009). A tutorial in irregular shape packing problem. Journal of the Operational Research Society, vol. 60, pp. 93–105.
  6. Blazewicz, J., Drozdowski, M., Soniewicki, B., & Walkowiak, R. (1989). Two-dimensional cutting problem basic complexity results and algorithms for irregular shapes. Found. Cont. Eng., no. 14 (4), pp. 137–160.
  7. Burke, E. K., Hellier, R. S. R., Kendall, G., & Whitwell, G. (2007). Complete and robust no-fit polygon generation for the irregular stock cutting problem. EJOR, no. 179, pp. 27–49.
  8. Whitwell, G. (2005). Novel Heuristic and Metaheuristic Approaches to Cutting and Packing. PhD Thesis. School of Computer Science and Information Technology, University of Nottingham, 313 p.
  9. Burke, E.K., Hellier, R., Kendall, G., & Whitwell, G. (2010). Irregular packing using the line and arc no-fit polygon. Operations Research, no. 58 (4), pp. 948–970.
  10. Milenkovic, V. (1999). Rotational polygon containment and minimum enclosure using only robust 2d constructions. Computational Geometry, no. 13(1), pp. 3–19.
  11. Milenkovic, V. (1998). Rotational polygon overlap minimization and compaction. Computational Geometry, no. 10(4), pp. 305–318.
  12. Rocha, P., Rodrigues, R., Gomes, A. M., et al. (2014). Circle Covering Representation for Nesting problems with continuous rotations. Preprints of the 19th World Congress, The International Federation of Automatic Control, Cape Town, South Africa, August 24–29.
  13. Leung, S. C. H., Lin, Y., & Zhang, D. (2012). Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem. Computers & Operations Research, vol. 39, no. 3, pp. 678–686.
  14. Bennell, J., Scheithauer, G., Stoyan, Yu., & Romanova, T. (2010) Tools of mathematical modelling of arbitrary object packing problems. Annals of Operations Research, Publisher Springer Netherlands, vol. 179, iss. 1, pp. 343–368.
  15. Chernov, N., Stoyan, Y., & Romanova, T. (2010). Mathematical model and efficient algorithms for object packing problem. Computational Geometry, Theory and Applications, vol. 43, no. 5, pp. 535–553.
  16. Chernov, N., Stoyan, Y., Romanova, T., & Pankratov, A. (2012). Phi-functions for 2D objects formed by line segments and circular arcs. Advances in Operations Research, 26 p.
  17. Bennell, J., Scheithauer, G., Stoyan, Y., Romanova, T., & Pankratov, A. (2015). Optimal clustering of a pair of irregular objects. Journal of Global Optimization, no. 61(3), pp. 497–524.
  18. Pankratov, A. V. & Stoyan, Yu. G. (2005). Placement of non-convex polygons with rotations into a non-convex polygon. Proc. Workshop Cutting Stock Problems, Alutus, Miercurea-Ciuc, Romania, pp. 29–36.
  19. Wachter, A. & Biegler, L. T. (2006). On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Mathematical Programming, no. 106(1), pp. 25–57.
  20. Stoyan, Yu., Pankratov, A., & Romanova, T. (2015). Cutting and Packing problems for irregular objects with continuous rotations: mathematical modeling and nonlinear optimization. Journal of Operational Research Society, no. 67(5), pp. 786–800.
  21. Kallrath, J. & Rebennack, S. (2013). Cutting Ellipses from Area-Minimizing Rectangles. Journal of Global Optimization, no. 59(2–3), pp. 405–437.


Received 06 September 2016

Published 30 September 2016