Development of the mathematical model and the method to solve a problem on the optimization of packing the ellipsoids into a convex container
DOI:
https://doi.org/10.15587/1729-4061.2018.140722Keywords:
optimal packing, ellipsoids, convex container, method of phi-functions, modeling the arrangement relations, nonlinear optimizationAbstract
This paper addresses the problem on the optimal packing of the predefined set of ellipsoids into a convex container of minimum volume. The ellipsoids are assigned by the dimensions of semi-axes and arrangement parameters in the local coordinate system and may permit continuous rotation and translation. The container could be a cuboid (rectangular parallelepiped), a cylinder, a sphere, an ellipsoid, or a convex polyhedron. To analytically describe the non-overlapping relations between ellipsoids, we use the quasi-phi-functions. To model the inclusion relations, we apply the quasi-phi-functions or phi-functions depending on the shape of a container. By employing the appropriate modeling tools, we construct a mathematical model in the form of a non-linear programming task.
The solution strategy is devised based on the method of a multistart. We propose a fast algorithm for generating the starting points from the region of feasible solutions, as well as the specialized optimization procedure that reduces the problem of large dimensionality O(n2) with a large number of nonlinear inequalities to a sequence of sub-tasks in nonlinear programming with a smaller dimensionality O(n) with fewer non-linear inequalities.
The optimization procedure makes it possible to significantly reduce (by 10 % to 90 %, depending on the dimensionality of a problem) computing resources, such as time and memory. Depending on the shape of a container, constraints for the orientation of ellipsoids (continuous turns, fixed orientation) and features in metric characteristics of ellipsoids, the result of solving the problem is the derived locally optimal or good feasible solutions. In the work we report numerical experiments for different containers (including a cylinder, a cuboid, a sphere, an ellipsoid).
References
- Chazelle, B., Edelsbrunner, H., Guibas, L. J. (1989). The complexity of cutting complexes. Discrete & Computational Geometry, 4 (2), 139–181. doi: https://doi.org/10.1007/bf02187720
- Choi, Y.-K., Chang, J.-W., Wang, W., Kim, M.-S., Elber, G. (2009). Continuous Collision Detection for Ellipsoids. IEEE Transactions on Visualization and Computer Graphics, 15 (2), 311–325. doi: https://doi.org/10.1109/tvcg.2008.80
- Uhler, C., Wright, S. J. (2013). Packing Ellipsoids with Overlap. SIAM Review, 55 (4), 671–706. doi: https://doi.org/10.1137/120872309
- Donev, A. (2004). Improving the Density of Jammed Disordered Packings Using Ellipsoids. Science, 303 (5660), 990–993. doi: https://doi.org/10.1126/science.1093010
- Bezrukov, A., Stoyan, D. (2006). Simulation and Statistical Analysis of Random Packings of Ellipsoids. Particle & Particle Systems Characterization, 23 (5), 388–398. doi: https://doi.org/10.1002/ppsc.200600974
- Man, W., Donev, A., Stillinger, F. H., Sullivan, M. T., Russel, W. B., Heeger, D. et. al. (2005). Experiments on Random Packings of Ellipsoids. Physical Review Letters, 94 (19). doi: https://doi.org/10.1103/physrevlett.94.198001
- Kallrath, J. (2015). Packing ellipsoids into volume-minimizing rectangular boxes. Journal of Global Optimization, 67 (1-2), 151–185. doi: https://doi.org/10.1007/s10898-015-0348-6
- Birgin, E. G., Lobato, R. D., Martínez, J. M. (2015). Packing ellipsoids by nonlinear optimization. Journal of Global Optimization, 65 (4), 709–743. doi: https://doi.org/10.1007/s10898-015-0395-z
- Stoyan, Y., Romanova, T. (2012). Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications. Modeling and Optimization in Space Engineering, 363–388. doi: https://doi.org/10.1007/978-1-4614-4469-5_15
- Stoyan, Y., Romanova, T., Pankratov, A., Chugay, A. (2015). Optimized Object Packings Using Quasi-Phi-Functions. Springer Optimization and Its Applications, 265–293. doi: https://doi.org/10.1007/978-3-319-18899-7_13
- Stoyan, Y. G., Patsuk, V. M. (2014). Covering a convex 3D polytope by a minimal number of congruent spheres. International Journal of Computer Mathematics, 91 (9), 2010–2020. doi: https://doi.org/10.1080/00207160.2013.865726
- Romanova, T., Bennell, J., Stoyan, Y., Pankratov, A. (2018). Packing of concave polyhedra with continuous rotations using nonlinear optimisation. European Journal of Operational Research, 268 (1), 37–53. doi: https://doi.org/10.1016/j.ejor.2018.01.025
- Ipopt home page. Available at: https://projects.coin-or.org/Ipopt
- Wolfram Language & System Documentation Center. Available at: http://reference.wolfram.com/language/ref/FindArgMin.html
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2018 Olha Khlud, Olexander Pankratov, Olexander Pankratov, Tetyana Romanova, Tetyana Romanova
This work is licensed under a Creative Commons Attribution 4.0 International License.
The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.
A license agreement is a document in which the author warrants that he/she owns all copyright for the work (manuscript, article, etc.).
The authors, signing the License Agreement with TECHNOLOGY CENTER PC, have all rights to the further use of their work, provided that they link to our edition in which the work was published.
According to the terms of the License Agreement, the Publisher TECHNOLOGY CENTER PC does not take away your copyrights and receives permission from the authors to use and dissemination of the publication through the world's scientific resources (own electronic resources, scientometric databases, repositories, libraries, etc.).
In the absence of a signed License Agreement or in the absence of this agreement of identifiers allowing to identify the identity of the author, the editors have no right to work with the manuscript.
It is important to remember that there is another type of agreement between authors and publishers – when copyright is transferred from the authors to the publisher. In this case, the authors lose ownership of their work and may not use it in any way.
