Combinatorial Configurations in Balance Layout Optimization Problems
- 3 Downloads
The balance layout optimization problem for a given set of 3D objects in a container divided by horizontal racks into subcontainers is considered. For analytical description of non-overlapping and containment constraints, the phi-function technique is used. Combinatorial configurations describing the combinatorial structure of the problem are defined. Based on the introduced configurations, a mathematical model is constructed that takes into account not only the placement constraints and mechanical properties of the system but also the combinatorial features of the problem associated with generation of partitions of the set of objects placed inside the subcontainers. A solution strategy is proposed. The results of numerical experiments are provided.
Keywordsbalance layout combinatorial configurations 3D objects phi-function method mathematical model optimization
Unable to display preview. Download preview PDF.
- 2.N. Chernov, Y. Stoyan, T. Romanova, and A. Pankratov, “Phi-functions for 2D objects formed by line segments and circular arcs,” Advances in Operations Research, DOI: https://doi.org/10.1155/2012/346358 (2012).
- 4.G. Fasano and J. D. Pintér (eds.), Modeling and Optimization in Space Engineering, Springer, Optimization and Its Applications, Vol. 73 (2013).Google Scholar
- 5.C. Che, Y. Wang, and H. Teng, “Test problems for quasi-satellite packing: Cylinders packing with behavior constraints and all the optimal solutions known,” URL: http://www.optimizationonline.org/DB_HTML/2008/09/2093.html.
- 6.G. Fasano and J. D. Pintér (eds.), Space Engineering. Modeling and Optimization with Case Studies, Springer Optimization and its Applications, Vol. 114 (2016).Google Scholar
- 8.K. Lei, “Constrained layout optimization based on adaptive particle swarm optimizer,” in: Zhihua Cai, Zhenhua Li, Zhuo Kang, and Yong Liu (eds.), Proc. ISICA 2009, Advances in Computation and Intelligence, LNCS, Vol. 5821, 434–442 (2009).Google Scholar
- 9.Yu. Stoyan and T. Romanova, “Mathematical models of placement optimization: Two- and three-dimensional problems and applications,” in: G. Fasano and J. D. Pintér (eds.), Modeling and Optimization in Space Engineering, Springer Optimization and its Applications, Vol. 73, Chap. 15, 363–388 (2013).Google Scholar
- 10.I. V. Sergienko and V. P. Shilo, Discrete Optimization Problems: Challenges, Methods, Solutions, and Analysis [in Russian], Naukova Dumka, Kyiv (2003).Google Scholar
- 11.N. V. Semenova and L. M. Kolechkina, Vector Discrete Optimization Problems on Combinatorial Sets: Methods of the Analysis and Solution [in Ukrainian], Naukova Dumka, (2009).Google Scholar
- 13.Yu. Stoyan, T. Romanova, A. Pankratov, A. Kovalenko, and P. Stetsyuk, “Modeling and optimization of balance layout problems,” in: G. Fasano and J. D. Pintér (eds.), Space Engineering. Modeling and Optimization with Case Studies, Springer Optimization and its Applications Vol. 114, 177–208 (2016).Google Scholar
- 14.E. Reingold, J. Nievergelt, and N. Deo, Combinatorial Algorithms: Theory and Practice, Pearson Education (1977).Google Scholar
- 15.Yu. G. Stoyan and I. V. Grebennik, “Description and generation of combinatorial sets having special characteristics,” Intern. J. of Biomedical Soft Computing and Human Sciences, Special Volume “Bilevel Programming, Optimization Methods, and Applications to Economics,” Vol. 18, No. 1, 83–88 (2013).Google Scholar
- 17.I. Grebennik and O. Lytvynenko, “Random generation of combinatorial sets with special properties,” An Intern. Quarterly J. on Economics of Technology and Modelling Processes (ECONTECHMOD), Vol. 5, No. 4, 43–48 (2016).Google Scholar