Balanced Circular Packing Problems with Distance Constraints

Romanova, Tetyana; Pankratov, Olexandr; Litvinchev, Igor; Stetsyuk, Petro; Lykhovyd, Oleksii; Marmolejo Saucedo, José Antonio; Vasant, Pandian

doi:10.3390/computation10070113

Balanced Circular Packing Problems with Distance Constraints

Journal

Computation

ISSN

2079-3197

Date Issued

2022

Author(s)

Romanova, Tetyana

Pankratov, Olexandr

Litvinchev, Igor

Stetsyuk, Petro

Lykhovyd, Oleksii

Marmolejo Saucedo, José Antonio

Facultad de Ingeniería - CampCM

Vasant, Pandian

Type

text::journal::journal article

DOI

10.3390/computation10070113

URL

https://scripta.up.edu.mx/handle/20.500.12552/3989

Abstract

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. © 2022 by the authors. Licensee MDPI, Basel, Switzerland.