Abstract
Packing convex 3D objects inside a convex container with balancing conditions is considered. The convex container is divided into subcontainers by a given number of supporting boards. The problem has applications in space engineering for rocketry design and takes into account both geometric (object orientations, minimum and/or maximum allowable distances between objects, combinatorial characteristics of the object arrangements inside subcontainers) and mechanical constraints (equilibrium, moments of inertia, stability). A general nonlinear optimization model is introduced and a solution strategy is provided. Numerical results are presented to illustrate the approach.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Fasano, G., Pinter, J. (eds.): Modeling and Optimization in Space Engineering, vol. 73. Springer, New York (2013)
Fasano, G., Pinter, J. (eds.): Optimized Packings and Their Applications, vol. 105. Springer, New York (2015)
Fasano, G., Pinter, J. (eds.): Modeling and Optimization in Space Engineering, vol. 2019. Springer, New York (2019)
Che, C., Wang, Y., Teng, H.: Test problems for quasi-satellite packing: cylinders packing with behaviour constraints and all the optimal solutions known. Opt. Online (2008). http://www.optimisation-online.org/DB_HTML/2008/09/2093.html
Sun, Z., Teng, H.: Optimal packing design of a satellite module. Eng. Opt. 35(5), 513–530 (2003)
Liu, J.F., Li, G.: Basin filling algorithm for the circular packing problem with equilibrium behavioural constraints. Sci. China Inf. Sci. 53(5), 885–895 (2010)
Chazelle, B., Edelsbrunner, H., Guibas, L.J.: The complexity of cutting complexes. Discrete Comput. Geom. 4(2), 139–181 (1989)
Stoyan, Yu., Romanova, T., Pankratov, A., Kovalenko, A., Stetsyuk, P.: Modeling and optimization of balance packing problems. In: Fasano, G., Pinter, J. (eds.) Space Engineering. Modeling and Optimization with Case Studies, vol. 114, pp. 369–400. Springer, New York (2016)
Stoyan, Yu., Romanova, T.: Mathematical models of placement optimisation: two- and three-dimensional problems and applications. In: Fasano, G., Pinter J. (eds.) Modeling and Optimization in Space Engineering, vol. 73, pp. 363–388. Springer, New York (2012)
Stoyan, Yu., Grebennik, I., Romanova, T., Kovalenko, A.: Optimized packings in space engineering applications: Part II. In: Fasano, G., Pinter, J. (eds.) Modeling and Optimization in Space Engineering, pp. 439–457. Springer, New York (2019)
Kovalenko, A., Romanova, T., Stetsyuk, P.: Balance packing problem for 3D-objects: mathematical model and solution methods. Cybern. Syst. Anal. 51(4), 556–565 (2015)
Stetsyuk, P., Romanova, T., Scheithauer, G.: On the global minimum in a balanced circular packing problem. Optim. Lett. 10, 1347–1360 (2016)
Stoyan, Yu., Pankratov, A., Romanova, T.: Quasi phi-functions and optimal packing of ellipses. J. Global Optim. 65(2), 283–307 (2016)
Stoyan, Yu., Romanova, T., Pankratov, A., Chugay, A.: Optimized object packings using quasi-phi-functions. In: Fasano, G., Pinter, J. (eds.) Optimized Packings with Applications, vol. 105, pp. 265–293. Springer, New York (2015)
Stoyan, Yu., Pankratov, A., Romanova, T.: Cutting and packing problems for irregular objects with continuous rotations: mathematical modeling and nonlinear optimization. J. Oper. Res. Soc. 67(5), 786–800 (2016)
Romanova, T., Bennell, J., Stoyan, Y., Pankratov, A.: Packing of concave polyhedra with continuous rotations using nonlinear optimization. Eur. J. Oper. Res. 268, 37–53 (2018)
Romanova, T., Pankratov, A., Litvinchev, I., Pankratova, Yu., Urniaieva, I.: Optimized packing clusters of objects in a rectangular container. Math. Probl. Eng., Article ID 4136430 (2019). https://doi.org/10.1155/2019/4136430
Litvinchev, I., Infante, L., Ozuna, L.: Approximate packing: integer programming models, valid inequalities and nesting. In: Fasano, G., Pinter, J.D. (eds.) Optimized Packings and Their Applications, vol. 105, pp. 117–135 (2015)
Torres, R., Marmolejo, J.A., Litvinchev, I.: Binary monkey algorithm for approximate packing non-congruent circles in a rectangular container. Wirel. Netw. (2018). https://doi.org/10.1007/s11276-018-1869-y
Litvinchev, I., Infante, L., Ozuna, L.: Approximate circle packing in a rectangular container. In: Gonzalez-Ramirez, R.G., et al. (eds.) Computational Logistics 5th International Conference Proceedings, Formulations and Valid Inequalities. Lecture Notes in Computer Science, vol. 8760/2014, 4, pp. 7–60. Springer, Berlin-Heidelberg, Valparaiso (2014)
Stoyan, Y., Yaskov, G.: Packing equal circles into a circle with circular prohibited areas. Int. J. Comput. Math. 89(10), 1355–1369 (2012)
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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Romanova, T., Litvinchev, I., Grebennik, I., Kovalenko, A., Urniaieva, I., Shekhovtsov, S. (2020). Packing Convex 3D Objects with Special Geometric and Balancing Conditions. In: Vasant, P., Zelinka, I., Weber, GW. (eds) Intelligent Computing and Optimization. ICO 2019. Advances in Intelligent Systems and Computing, vol 1072. Springer, Cham. https://doi.org/10.1007/978-3-030-33585-4_27
Download citation
DOI: https://doi.org/10.1007/978-3-030-33585-4_27
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-33584-7
Online ISBN: 978-3-030-33585-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)