Note on: an improved algorithm for the packing of unequal circles within a larger containing circle

Authors:
Wenqi Huang;Mao Chen
Affiliations:
School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China;School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China
Venue:
Computers and Industrial Engineering
Year:
2006

Citing 2
Cited 5

Layout optimization for the objects located within a rotating vessel — a three-dimensional packing problem with behavioral constraints

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

Computers and Operations Research

A beam search algorithm for the circular packing problem

Computers and Operations Research
Two-dimensional equilibrium constraint layout using simulated annealing

Computers and Industrial Engineering
A probability collectives approach with a feasibility-based rule for constrained optimization

Applied Computational Intelligence and Soft Computing
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.00

Visualization

Abstract

This note proposed an improved version of the algorithm proposed by Wang et al. [Wang, H. Q., Huang, W. Q., Zhang, Q., & Xu, D. M. (2002). An improved algorithm for the packing of unequal circles within a larger containing circle. European Journal of Operational Research, 141, 339 347] for solving the disk packing problem with equilibrium constraints. An efficient strategy of accelerating the search process is introduced in the gradient method to shorten the execution time. A number of computational results are presented, showing the effectiveness of the proposed method.