A nonlinear programming model with implicit variables for packing ellipsoids
- 332 Downloads
The problem of packing ellipsoids is considered in the present work. Usually, the computational effort associated with numerical optimization methods devoted to packing ellipsoids grows quadratically with respect to the number of ellipsoids being packed. The reason is that the number of variables and constraints of ellipsoids’ packing models is associated with the requirement that every pair of ellipsoids must not overlap. As a consequence, it is hard to solve the problem when the number of ellipsoids is large. In this paper, we present a nonlinear programming model for packing ellipsoids that contains a linear number of variables and constraints. The proposed model finds its basis in a transformation-based non-overlapping model recently introduced by Birgin et al. (J Glob Optim 65(4):709–743, 2016). For solving large-sized instances of ellipsoids’ packing problems with up to 1000 ellipsoids, a multi-start strategy that combines clever initial random guesses with a state-of-the-art (local) nonlinear optimization solver is presented. Numerical experiments show the efficiency and effectiveness of the proposed model and methodology.
KeywordsCutting and packing ellipsoids Optimization Nonlinear programming Models Numerical experiments
The authors are indebted to the anonymous referees whose comments helped to improve this paper.
- 30.Kallrath, J.: Packing ellipsoids into volume-minimizing rectangular boxes. J. Glob. Optim. (2015). doi: 10.1007/s10898-015-0348-6
- 32.Kampas, F.J., Castillo, I., Pintér, J.D.: General ellipse packings in optimized regular polygons. http://www.optimization-online.org/DB_HTML/2016/03/5348.html (2016)
- 33.Kampas, F.J., Pintér, J.D., Castillo, I.: General ellipse packings in an optimized circle using embedded Lagrange multipliers. http://www.optimization-online.org/DB_HTML/2016/01/5293.html (2016)
- 34.Lobato, R.D.: Ellipsoid packing. PhD thesis, University of Sao Paulo (2015)Google Scholar
- 38.Pankratov, A., Romanova, T., Khlud, O.: Quasi-phi-functions in packing problem of ellipsoids. Radioelectron. Inform. 68(1), 37–41 (2015)Google Scholar
- 39.Stoyan, Y., Romanova, T., Pankratov, A., Chugay, A.: Optimized object packings using quasi-phi-functions. In: Fasano, G., Pintér, J.D. (eds.) Optimized Packings with Applications, Volume 105 of Springer Optimization and Its Applications, Chapter 13, pp. 265–293. Springer, Cham (2015)CrossRefGoogle Scholar