Abstract
The paper considers a problem of packing unequal circles into a rectangular strip with fixed width and minimal length. We develop the idea of increasing the dimension of the solution space by assuming radii of circles to be variables. A mathematical model of the problem is constructed and its characteristics are investigated. Taking into account the characteristics we offer a solution strategy of the problem including a number of non-linear programming subproblems of packing circles of variable radii. The solution strategy involves special ways of construction of starting points, calculation of local minima, jump from one local extremum to another, decrease of the problem dimension and rearrangement of pairs of circles. For calculating local extrema an interior point optimizer together with the concept of active inequalities are used. We compare 146 numerical benchmark examples and give seven new ones for 125, 150, 175, 225, 250, 275 and 300 circles.
Similar content being viewed by others
References
Wäscher, G., Hausner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183, 1109–1130 (2007)
Hifi, M., M’Hallah, R.: A literature review on circle and sphere packing problems: models and methodologies. Adv. Oper. Res. 2009 (2009). doi:10.1155/2009/150624
Hifi, M., M’Hallah, R.: A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes. Int. Trans. Oper. Res. 10(3), 195–216 (2003)
Huang, W.Q., Li, Y., Akeb, H., Li, C.M.: Greedy algorithms for packing unequal circles into a rectangular container. J. Oper. Res. Soc. 56(5), 539–548 (2005)
Akeb, H., Hifi, M.: Algorithms for the circular two-dimensional open dimension problem. Int. Trans. Oper. Res. 15(6), 685–704 (2008)
Rvachev, V.L., Stoyan, Yu.G.: On the problem of optimal layout of circular patterns. Cybern. Syst. Anal. 1(4), 80–84 (1965). doi:10.1007/BF01071258
Rvachev, V.L., Stoyan, Yu.G.: Algorithm for solution of the problem of optimum layout of circular patterns with restrictions on the distances between patterns. Cybern. Syst. Anal. 1(3), 79–85 (1965). doi:10.1007/BF01885707
Stoyan, Yu.G., Cherepakhin, V.M.: On rational packing of geometric objects. In: Controlled systems, 4, 5, Nauka, Siberian Branch of AS of USSR, Novosibirsk (1970) (in Russian)
Stoyan, Yu.G., Gil, N.I.: Methods and algorithms for packing geometric objects. Naukova Dumka, Kiev (1976) (in Russian)
Stoyan, Yu.G.: Mathematical methods for geometric design. In: Ellis, T.M.R., Semenkoc, O.J. (eds.) Advances in CAD/CAM, Proceedings of PROLAMAT’82, pp. 67–86. Leningrad, Amsterdam (1983)
George, J.A., George, J.M., Lamar, B.W.: Packing different-sized circles into a rectangular container. Eur. J. Oper. Res. 84, 693–712 (1995)
Hifi, M., M’Hallah, R.: Approximate algorithms for constrained circular cutting problems. Comput. Oper. Res. 31, 675–694 (2004)
Rudnev, A.S.: Probabilistic search with prohibition for the circle and rectangle packing problem into a strip. Discrete Anal. Oper. Res. 16(4), 61–86 (2009) (in Russian)
He, Y., Wu, Y.: Packing non-identical circles within a rectangle with open length. J. Global Opt. (2012). doi:10.1007/s10898-012-9948-6
Hifi, M., Paschos, V.Th., Zissimopoulos, V.: A simulated annealing approach for the circular cutting problem. Eur. J. Oper. Res. 159(2), 430–448 (2004)
Kubach, T., Bortfeldt, A., Gehring, H.: Parallel greedy algorithms for packing unequal circles into a strip or a rectangle. Central Eur. J. Oper. Res. 17(4), 461–477 (2009)
Akeb, H., Hifi, M., Negre, S.: An augmented beam search-based algorithm for the circular open dimension problem. Comput. Ind. Eng. 61(2), 373–381 (2011). doi:10.1016/j.cie.2011.02.009
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, 786–802 (2008)
Birgin, E.G., Gentil, J.M.: New and improved results for packing identical unitary radius circles within triangles, rectangles and strips. Comput. Oper. Res. 37(7), 1318–1327 (2010)
Stoyan, Yu.G., Yaskov, G.: Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints. Int. Trans. Oper. Res. 5(1), 45–57 (1998)
Shmigol, V.G.: Mathematical support for local optimization of geometric design problems. Dissertation of Cand. of Techn. Sciences, Kharkov Institute of Radio and Electronics, p. 158 (1991) (in Russian)
Stoyan, Yu.G., Yaskov, G.N.: A mathematical model and a solution method for the problem of placing various-sized circles into a strip. Eur. J. Oper. Res. 156, 590–600 (2004)
Specht, E.: The best known solutions of the circular open dimension problem (CODP). Otto-von-Guericke-University of Magdeburg, Germany (2012). http://www.packomania.com/cst/
Lenstra, J.K., Rinnooy, A.H.G.: Complexity of packing, covering, and partitioning problems. In: Schrijver A (ed.) Packing and Covering in Combinatorics, pp. 275–291, Mathematisch Centrum, Amsterdam (1979)
Szabó, P.G., Markót, M.C., Csendes, T., Specht, E., Casado, L.G., García, I.: New approaches to circle packing in a square. Springer Optim. Appl. 6, 238 (2007)
Locatelli, M., Raber, U.: Packing equal circles in a square: a deterministic global optimization approach. Discrete Appl. Math. 122(1–3), 139–166 (2002)
Stoyan, Yu., Yaskov, G.: Packing congruent hyperspheres into a hypersphere. J. Global Optim. 52(4), 855–868 (2012)
Wächter, A., Biegler, L.T.: On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Math. Programm. 106(1), 25–57 (2006)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Stoyan, Y., Yaskov, G. Packing unequal circles into a strip of minimal length with a jump algorithm. Optim Lett 8, 949–970 (2014). https://doi.org/10.1007/s11590-013-0646-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-013-0646-1