Balanced Circular Packing Problems with Distance Constraints
Tetyana Romanova,
Olexandr Pankratov,
Igor Litvinchev,
Petro Stetsyuk,
Oleksii Lykhovyd,
Jose Antonio Marmolejo-Saucedo,
Pandian Vasant
Affiliations
Tetyana Romanova
Department of Mathematical Modeling and Optimal Design, A. Pidhornyi Institute for Mechanical Engineering Problems, National Academy of Sciences of Ukraine, 61046 Kharkiv, Ukraine
Olexandr Pankratov
Department of Mathematical Modeling and Optimal Design, A. Pidhornyi Institute for Mechanical Engineering Problems, National Academy of Sciences of Ukraine, 61046 Kharkiv, Ukraine
Igor Litvinchev
Faculty of Mechanical and Electrical Engineering, Nuevo Leon State University (UANL), Av. Universidad s/n, Col. Ciudad Universitaria, San Nicolas de los Garza 66455, Mexico
Petro Stetsyuk
Department of Nonsmooth Optimization Methods, V. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, 40 Academika Glushkova Ave., 03187 Kyiv, Ukraine
Oleksii Lykhovyd
Department of Nonsmooth Optimization Methods, V. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, 40 Academika Glushkova Ave., 03187 Kyiv, Ukraine
Jose Antonio Marmolejo-Saucedo
Facultad de Ingenieria, Universidad Panamericana, Augusto Rodin 498, Ciudad de Mexico 03920, Mexico
Pandian Vasant
Modeling Evolutionary Algorithms Simulation & Artificial Intelligence (MERLIN), Faculty of Electrical & Electronic Engineering, Ton Duc Thang University, Ho Chi Minh City 700000, Vietnam
The packing of different circles in a circular container under balancing and distance conditions is considered. Two problems are studied: the first minimizes the container’s radius, while the second maximizes the minimal distance between circles, as well as between circles and the boundary of the container. Mathematical models and solution strategies are provided and illustrated with computational results.
