Cutting circles and polygons from areaminimizing rectangles
 Josef Kallrath
 … show all 1 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
A set of circles, rectangles, and convex polygons are to be cut from rectangular design plates to be produced, or from a set of stocked rectangles of known geometric dimensions. The objective is to minimize the area of the design rectangles. The design plates are subject to lower and upper bounds of their widths and lengths. The objects are free of any orientation restrictions. If all nested objects fit into one design or stocked plate the problem is formulated and solved as a nonconvex nonlinear programming problem. If the number of objects cannot be cut from a single plate, additional integer variables are needed to represent the allocation problem leading to a nonconvex mixed integer nonlinear optimization problem. This is the first time that circles and arbitrary convex polygons are treated simultaneously in this context. We present exact mathematical programming solutions to both the design and allocation problem. For small number of objects to be cut we compute globally optimal solutions. One key idea in the developed NLP and MINLP models is to use separating hyperplanes to ensure that rectangles and polygons do not overlap with each other or with the circles. Another important idea used when dealing with several resource rectangles is to develop a model formulation which connects the binary variables only to the variables representing the center of the circles or the vertices of the polytopes but not to the nonoverlap or shape constraints. We support the solution process by symmetry breaking constraints. In addition we compute lower bounds, which are constructed by a relaxed model in which each polygon is replaced by the largest circle fitting into that polygon. We have successfully applied several solution techniques to solve this problem among them the Branch&Reduce Optimization Navigator (BARON) and the LindoGlobal solver called from GAMS, and, as described in Rebennack et al. [21], a column enumeration approach in which the columns represent the assignments. Good feasible solutions are computed within seconds or minutes usually during preprocessing. In most cases they turn out to be globally optimal. For up to 10 circles, we prove global optimality up to a gap of the order of 10^{−8} in short time. Cases with a modest number of objects, for instance, 6 circles and 3 rectangles, are also solved in short time to global optimality. For test instances involving nonrectangular polygons it is difficult to obtain small gaps. In such cases we are content to obtain gaps of the order of 10%.
 Adjiman C.S., Androulakis I.P. and Floudas C.A. (2000). Global optimization of mixed integer nonlinear problems. AIChE J. 46: 1769–1797 CrossRef
 Adjiman C.S., Androulakis I.P., Maranas C.D. and Floudas C.A. (1996). A global optimization method aBB for process design. Comput. Chem. Eng. Suppl. 20: S419–424 CrossRef
 Androulakis I.P., Maranas C.D. and Floudas C.A. (1995). aBB: a global optimization method for general constrained nonconvex problems. J. Glob. Optim. 7: 337–363 CrossRef
 Birgin E.G., Martínez J.M., Nishihara F.H. and Ronconi D.P. (2006). Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization. Comput. Oper. Res. 33: 3535–3548 CrossRef
 Birgin, E.G., Sobral, F.N.C.: Minimizing the object dimensions in circle and sphere packing problems. Comput. Oper. Res. 34, online 16. Jan 2007.
 Brooke A., Kendrick D. and Meeraus A. (1992). GAMS – A User’s Guide (Release 2.25). Boyd & Fraser Publishing Company, Danvers, Massachusetts
 Dowsland K.A. and Dowsland W.B. (1992). Packing problems. Eur. J. Oper. Res. 56: 2–14 CrossRef
 Dyckhoff H. (1990). A typology of cutting and packing problems. Eur. J. Oper. Res. 44: 145–159 CrossRef
 Floudas C.A., Akrotiriankis I.G., Caratzoulas S., Meyer C.A. and Kallrath J. (2005). Global optimization in the 21st century: advances and challenges for problems with nonlinear dynamics. Comput. Chem. Eng. 29: 1185–1202 CrossRef
 Fraser H.J. and George J.A. (1994). Integrated container loading software for pulp and paper industry. Eur. J. Oper. Res. 77: 466–474 CrossRef
 George J.A., George J.M. and Lamar B.W. (1995). Packing differentsized circles into a rectangular container. Eur. J. Oper. Res. 84: 693–712 CrossRef
 Ghildyal, V., Sahinidis, N.V.: Solving global optimization problems with BARON. In: Migdalas, A., Pardalos, P., Varbrand, P. (eds.) From Local to Global Optimization. A Workshop on the Occasion of the 70th Birthday of Professor Hoang Tuy, Chap. 10, pp. 205–230. Kluwer Academic Publishers, Boston, MA (2001)
 Huang W.Q., Li Y., Akeb H. and Li C.M. (2005). Greedy algorithms for packing unequal circles into a rectangular container. J. Oper. Res. Soc. 56: 539–548 CrossRef
 Jakobs S. (1996). On genetic algorithms for the packing of polygons. Euro. J. Oper. Res. 88: 165–181 CrossRef
 Lenstra J.K. and Rinnooy Kan A.H.G. (1979). Complexity of packing, covering and partitioning problems. In: Schrijver, A. (eds) Packing and Covering in Combinatorics, pp 275–291. Mathematisch Centrum, Amsterdam, The Netherlands
 Liberti, L.: Reformulation and Convex Relaxation Techniques for Global Optimization. Ph.D. Thesis, Imperial College London, London, UK (2004)
 Liberti L. and Pantelides C. (2006). An exact reformulation algorithm for large nonconvex NLPs involving bilinear terms. J. Glob. Optim. 36: 161–189 CrossRef
 Lubachevsky B.D. and Graham R. (2003). Dense packings of congruent circles in rectangles with a variable aspect ratio. In: Aronov, B., Basu, S., Pach, J. and Sharir, M. (eds) Discrete and Computational Geometry – The GoodmanPollack Festschrift, vol. 25 of Algorithms and Combinatorics, pp 633–650. Springer, Heidelberg
 Lubachevsky, B.D., Graham, R.: Minimum perimeter rectangles that enclose congruent nonoverlapping circles. ArXiv Mathematics eprints (2004)
 Maranas C.D. and Floudas C.A. (1995). Finding all solutions of nonlinearly constrained systems of equations. J. Glob. Optim. 7: 143–182 CrossRef
 Rebennack, S., Kallrath, J., Pardalos, P.M.: Column enumeration based decomposition techniques for a class of nonconvex MINLP problems. J. Glob. Optim. * * * : * * *_ * ** (2008)
 Ruda M. (1970). The packing of circles in rectangles (in Hungarian). Magyar Tud. Akad. Mat. Fiz. Tud. Oszt. Közl. 19: 73–87
 Rvachev, V.L., Stoyan, Y.G.: At the problem on optimal placement of circles. Cybernetics 4, 70–75. Kiev, Ukraine (in Russian) (1965)
 Rvachev, V.L., Stoyan, Y.G.: Solution algorithms of optimal cutting problems by circles when ristances between a pair of circles are given. Cybernetics 3, 73–83. Kiev, Ukraine (in Russian) (1965)
 Stoyan Y.G. and Yaskov G.N. (1998). 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
 Stoyan Y.G. and Yaskov G.N. (2004). A mathematical model and a solution method for the problem of placing varioussized circles into a strip. Euro. Jo. Oper. Res. 156: 590–600 CrossRef
 Szabó P.G., Markót M.C., Csendes T., Specht E., Casado L.G. and García I. (2007). New Approaches to Circle Packing in a Square. Springer, Heidelberg
 Tawarmalani M. and Sahinidis N.V. (2002). Convexification and Global Optimization in Continuous and MixedInteger Nonlinear Programming: Theory, Algorithms, Software and Applications. Nonconvex Optimization and its Applications Series. Kluwer Academic Publishers, Dordrecht The Netherlands
 Yu, H.X., Zhang, L.W.: A nonlinear programming model for the packing of unequal circles into a square box. In Proceedings of the 6th World Congress on Intelligent Control and Automation, June 21–23, 2006, Dalian, China, pp. 1044–1047 (2006)
 Title
 Cutting circles and polygons from areaminimizing rectangles
 Journal

Journal of Global Optimization
Volume 43, Issue 23 , pp 299328
 Cover Date
 20090301
 DOI
 10.1007/s1089800792746
 Print ISSN
 09255001
 Online ISSN
 15732916
 Publisher
 Springer US
 Additional Links
 Topics
 Keywords

 Global Optimization
 Mixed integer programming
 Cutting stock problem
 Packing problem
 Shape constraints
 Nonoverlap constraints
 Design problem
 Assignment
 Industry Sectors
 Authors

 Josef Kallrath ^{(1)} ^{(2)}
 Author Affiliations

 1. BASFAG, Scientific Computing, GVC/SB009, 67056, Ludwigshafen, Germany
 2. Department of Astronomy, The University of Florida, Bryan Space Science Building, Gainesville, FL, 32611, USA