A Genetic Algorithm-Based Heuristic Approach for Strategically Placing Circles Amid Convex Polygons

Mapping circles within a layout containing convex polygons to fill available space poses a considerable challenge. Alongside circle placement, minimizing overlap between circles and between circles and existing polygons is crucial. Given the absence of a deterministic solution, this work introduces a heuristic approach employing genetic algorithms. In this work, an optimal arrangement of circle placements is identified, which will maximize coverage of available space among all explored arrangements. Experimental findings demonstrate that the area of free space coverage expands with the number of generations the genetic algorithm operates through.