New heuristics for packing unequal circles into a circular container

Authors:
Wen Qi Huang;Yu Li;Chu Min Li;Ru Chu Xu
Affiliations:
College of Computer Science, HuaZhong University of Science and Technology, Wuhan, China;LaRIA, Université de Picardie Jules Verne, Amiens cedex, France;LaRIA, Université de Picardie Jules Verne, Amiens cedex, France;College of Computer Science, HuaZhong University of Science and Technology, Wuhan, China
Venue:
Computers and Operations Research
Year:
2006

Citing 5
Cited 9

Introduction to algorithms

Introduction to algorithms
Approximation schemes for covering and packing problems in image processing and VLSI

Journal of the ACM (JACM)
Dense packings of congruent circles in a circle

Discrete Mathematics
Approximate algorithms for constrained circular cutting problems

Computers and Operations Research
An effective hybrid algorithm for the problem of packing circles into a larger containing circle

Computers and Operations Research

PERM for solving circle packing problem

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

Computational Optimization and Applications
A beam search algorithm for the circular packing problem

Computers and Operations Research
An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
An improved energy landscape paving algorithm for the problem of packing circles into a larger containing circle

Computers and Industrial Engineering
Efficiently packing circles into a larger containing circle

HPCA'09 Proceedings of the Second international conference on High Performance Computing and Applications
Solving the circular open dimension problem by using separate beams and look-ahead strategies

Computers and Operations Research
Packing unequal circles using formulation space search

Computers and Operations Research
A coarse-to-fine quasi-physical optimization method for solving the circle packing problem with equilibrium constraints

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

We propose two new heuristics to pack unequal circles into a two-dimensional circular container. The first one, denoted by A1.0, is a basic heuristic which selects the next circle to place according to the maximal hole degree rule. The second one, denoted by A1.5, uses a self look-ahead strategy to improve A1.0. We evaluate A1.0 and A1.5 on a series of instances up to 100 circles from the literature and compare them with existing approaches. We also study the behaviour of our approach for packing equal circles comparing with a specified approach in the literature. Experimental results show that our approach has a good performance in terms of solution quality and computational time for packing unequal circles.