A set of ellipses, with given semi-major and semi-minor axes, is to be cut from a rectangular design plate, while minimizing the area of the design rectangle. The design plate is subject to lower and upper bounds of its widths and lengths; the ellipses are free of any orientation restrictions. We present new mathematical programming formulations for this ellipse cutting problem. The key idea in the developed non-convex nonlinear programming models is to use separating hyperlines to ensure the ellipses do not overlap with each other. For small number of ellipses we compute feasible points which are globally optimal subject to the finite arithmetic of the global solvers at hand. However, for more than 14 ellipses none of the local or global NLP solvers available in GAMS can even compute a feasible point. Therefore, we develop polylithic approaches, in which the ellipses are added sequentially in a strip-packing fashion to the rectangle restricted in width, but unrestricted in length. The rectangle’s area is minimized in each step in a greedy fashion. The sequence in which we add the ellipses is random; this adds some GRASP flavor to our approach. The polylithic algorithms allow us to compute good, near optimal solutions for up to 100 ellipses.
Global optimization Non-convex nonlinear programming Mixed integer programming Cutting stock problem Packing problem Shape constraints Non-overlap constraints Design problem Polylithic solution approach Computational geometry
This is a preview of subscription content, log in to check access.
Thanks are directed to Prof. Dr. Siegfried Jetzke (Ostfalia Hochschule, Salzgitter, Germany) for his interest in this work, comments on the manuscript and discussion about the usefulness of ellipses and ellipsoids in real world problems.
Adjiman, C.S., Androulakis, I.P., Floudas, C.A.: Global optimization of mixed integer nonlinear problems. AIChE J. 46, 1769–1797 (2000)CrossRefGoogle Scholar
Adjiman, C.S., Androulakis, I.P., Maranas, C.D., Floudas, C.A.: A global optimization method aBB for process design. Comput. Chem. Eng. 20(Suppl. 1), S419–424 (1996)CrossRefGoogle Scholar
Androulakis, I.P., Maranas, C.D., Floudas, C.A.: aBB: a global optimization method for general constrained nonconvex problems. J. Glob. Optim. 7, 337–363 (1995)CrossRefGoogle Scholar
Dyckhoff, H.: A typology of cutting and packing problems. Eur. J. Oper. Res. 44, 145–159 (1990)CrossRefGoogle Scholar
Maranas, C.D., Floudas, C.A.: Finding all solutions of nonlinearly constrained systems of equations. J. Glob. Optim. 7, 143–182 (1995)CrossRefGoogle Scholar
Markót, M.C.: Interval methods for verifying structural optimality of circle packing configurations in the unit square. J. Comput. Appl. Math. 199, 353–357 (2007)CrossRefGoogle Scholar
Markót, M.C., Csendes, T.: A new verified optimization technique for the “packing circles in a unit square” problems. SIAM J. Optim. 16, 193–219 (2005)CrossRefGoogle Scholar
Miller, P.: Globally optimal packing of nonconvex two-dimensional shapes by approximation with ellipses. Princeton University, Princeton, NJ, Senior Thesis (2012)Google Scholar
Misener, R., Floudas, C.: GloMIQO: global mixed-integer quadratic optimizer. J. Glob. Optim. pp. 1–48 (2012). doi:10.1007/s10898-012-9874-7
Rebennack, S., Kallrath, J.: Continuous piecewise linear \(\delta \)-approximations for MINLP problems. I. Minimal breakpoint systems for univariate functions. Tech. rep., Colorado School of Mines Division of Economics and Business Working Paper Series 2012–12 (2012)Google Scholar
Rebennack, S., Kallrath, J.: Continuous piecewise linear \(\delta \)-approximations for MINLP problems. II. Bivariate and multivariate functions. Tech. rep., Colorado School of Mines Division of Economics and Business Working Paper Series 2012–13 (2012)Google Scholar
Rebennack, S., Kallrath, J., Pardalos, P.M.: Column enumeration based decomposition techniques for a class of non-convex MINLP problems. J. Glob. Optim. 43, 277–297 (2009)CrossRefGoogle Scholar
Tawarmalani, M., Sahinidis, N.V.: Convexification and global optimization in continuous and mixed-integer nonlinear programming: theory, algorithms, software, and applications. Nonconvex optimization and its applications series. Kluwer, Dordrecht, The Netherlands (2002)CrossRefGoogle Scholar