Solving the problem of packing equal and unequal circles in a circular container

Authors:
A. Grosso;A. R. Jamali;M. Locatelli;F. Schoen
Affiliations:
Università di Torino, Turin, Italy;Department of Mathematics, Khulna University of Engineering and Technology, Khulna, Bangladesh;Università di Torino, Turin, Italy;Dip. Sistemi e Informatica, Universitá di Firenze, Firenze, Italy
Venue:
Journal of Global Optimization
Year:
2010

Citing 12
Cited 6

SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization

SIAM Journal on Optimization
Global Optimization on Funneling Landscapes

Journal of Global Optimization
Packing equal circles in a square: a deterministic global optimization approach

Discrete Applied Mathematics
An effective hybrid algorithm for the problem of packing circles into a larger containing circle

Computers and Operations Research
Reformulation descent applied to circle packing problems

Computers and Operations Research
A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems

SIAM Journal on Optimization
New Approaches to Circle Packing in a Square: With Program Codes (Springer Optimization and Its Applications)

New Approaches to Circle Packing in a Square: With Program Codes (Springer Optimization and Its Applications)
A Population-based Approach for Hard Global Optimization Problems based on Dissimilarity Measures

Mathematical Programming: Series A and B
Minimizing the object dimensions in circle and sphere packing problems

Computers and Operations Research
Adaptive and restarting techniques-based algorithms for circular packing problems

Computational Optimization and Applications
Cutting circles and polygons from area-minimizing rectangles

Journal of Global Optimization
Efficiently packing unequal disks in a circle

Operations Research Letters

A heuristic approach for packing identical rectangles in convex regions

Computers and Operations Research
On the impact of symmetry-breaking constraints on spatial Branch-and-Bound for circle packing in a square

Discrete Applied Mathematics
Packing unequal circles using formulation space search

Computers and Operations Research
Basin hopping as a general and versatile optimization framework for the characterization of biological macromolecules

Advances in Artificial Intelligence - Special issue on Artificial Intelligence Applications in Biomedicine
A coarse-to-fine quasi-physical optimization method for solving the circle packing problem with equilibrium constraints

Computers and Industrial Engineering
Differential evolution methods based on local searches

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose a Monotonic Basin Hopping approach and its population-based variant Population Basin Hopping to solve the problem of packing equal and unequal circles within a circular container with minimum radius. Extensive computational experiments have been performed both to analyze the problem at hand, and to choose in an appropriate way the parameter values for the proposed methods. Different improvements with respect to the best results reported in the literature have been detected.