MATHEMATICAL MODELS AND INFORMATION TECHNOLOGIES OF LAYOUT SYNTHESIS OF SPHERICAL CONFIGURATIONS

Алексей Викторович Карташов, Кирилл Петрович Коробчинский

Abstract


The concept of layout synthesis of optimal configurations is introduced in the article. Under the tasks of layout synthesis it means the formation of a set of geometric objects in such a mutual arrangement that would satisfy the given relations (constraints, properties) and would deliver an extremum to a certain quality criterion. One problem of finding the optimal configuration of geometric objects of spherical shape is considered. The problem is to find such an arrangement of set of spheres without their mutual overlaps, so that their spherical shell is minimal. For this problem, several equivalent mathematical models are given. Since the problem is NP-complete, methods are considered for solving it, based on the search and improvement of local minima.

To find one local minimum, it can be used any method of non-linear optimization. In this paper it is used an open system IPOPT for solving optimization problems, using the methods of internal points to search for a local minimum.

To search for a local minima, there are used several approaches. The first of them is based on the application of the  space expansion method. This method consists in finding a local minimum for a problem with constant radii, and then at the resulting point, a transition to a model with variable radii is made, in which the initial values of the radii of the circles change in a certain range in a random way. After that, the local search is performed again, and so many times. This approach allows for a directed search of a local minima, improving the solution.

The second approach is based on a multiple search for a local minima using a genetic algorithm.

The third approach is an interactive and uses human intuition. After obtaining some solution, the result is displayed in a graphical editor and the researcher can change the mutual position of objects, after which one of the automatic methods is applied. It is necessary that initial position objects do not be feasible. 

When solving a problem, it is necessary to ensure interaction between different stages of the solution. To do this, it is need to repeatedly convert geometric information from one form to another. Information technologies for the transformation of geometric information in the process of solving the problem are proposed.

An example of a numerical solution is given.


Keywords


layout synthesis; geometric information; optimal configuration; spherical object; optimal placement

References


Hifi, M., M’Hallah, R. A literature Review on Circle and Sphere Packing Problems: Model and Methodologies. Advances in Optimization Research, 2009, no. 7, pp. 27–28.

Stoyan, Yu. G., Scheithauer, G., Yaskov, G. N. Packing Unequal Spheres into Various Containers. Cybernetics and Systems Analysis, 2016, no. 52(3), pp. 419–426.

Stoyan, Yu., Yaskov, G. Packing unequal circles into a strip of minimal length with a jump algorithm. Optimization Letters, 2014, vol.8(3), pp. 949-970.

Stoyan, Yu., Yaskov, G., Scheithauer, G. Packing of Various Solid Spheres into a Parallelepiped. Central European Journal of Operational Research, 2003, no. 11(4), pp. 389–407.

Hifi, M., Yousef, L. Width Beam and Hill-Climbing Strategies for the Three-Dimensional Sphere Packing Problem. In Proceedings of the 2014 Federated Conference on Computer Science and Information Systems, 2014, vol. 2, pp. 421–428.

Liu, J., Yao, Y., Zheng, Yu., Geng, H., Zhou, G. An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems. Combinatorial Optimization and Applications. Lecture Notes in Computer Science, 2009, vol. 5573, pp. 135–144.

Sutou, A., Day, Y. Global optimization approach to unequal sphere packing problems in 3D. Journal of Optimization Theory and Applications, 2002, no. 114(3), pp. 671–694.

Birgin, E. G., Sobral, F. N. C. Minimizing the object dimensions in circle and sphere packing problems Computers, Operations Research, 2008, no. 35, pp. 2357–2375.

Wang, J. Packing of Unequal Spheres and Automated Radiosurgical Treatment Planning. Journal of Combinatorial Optimization, 1999, vol. 3, pp. 453–463.

Zeng, Z. Z., Huang, W. Q., Xu, R. C., Fu, Z. H. An al-gorithm to packing unequal spheres in a larger sphere, Advanced Materials Research, 2012, vol. 546, pp. 1464–1469.

Stoyan, Yu. G. Prostranstva geometricheskikh informatsii [Spaces of geometric information]. Preprint. AN USSR In-t probl. Mashinostroenie - Academy of Sciences of the USSR In-t problems Mechanical engineering, no. 173, Kharkov, 1982. – 54 p.

Stoyan, Yu. G., Yakovlev, S. V. Matematicheskie modeli i optimizatsionnye metody geometricheskogo proektirovaniya [Mathematical models and optimization methods for geometric projection]. Kiev, Nauk. Dumka Publ., 1986. 268 p.

Yakovlev, S. V. Тhe method of artificial space dilation in problems of optimal packing of geometric objects Cybernetics and Systems Analysis, 2017, vol. 53(5), pp. 725-732.

Kawajir, Y. Introduction to Ipopt: A tutorial for downloading, installing, and using Ipopt. Available at: http://www.coin-or.org/Ipopt/documentation (accessed 10.10.2017).




DOI: https://doi.org/10.32620/reks.2017.4.09

Refbacks

  • There are currently no refbacks.