An improved energy landscape paving algorithm for the problem of packing circles into a larger containing circle

Authors:
Jingfa Liu;Shengjun Xue;Zhaoxia Liu;Danhua Xu
Affiliations:
Computer and Software Institute, Nanjing University of Information Science and Technology, Nanjing 210044, China;Computer and Software Institute, Nanjing University of Information Science and Technology, Nanjing 210044, China;Network Information Center, Nanjing University of Information Science and Technology, Nanjing 210044, China;Computer and Software Institute, Nanjing University of Information Science and Technology, Nanjing 210044, China
Venue:
Computers and Industrial Engineering
Year:
2009

Citing 7
Cited 6

SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization

SIAM Journal on Optimization
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
New heuristics for packing unequal circles into a circular container

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

Orthogonal packing of identical rectangles within isotropic convex regions

Computers and Industrial Engineering
Two-dimensional equilibrium constraint layout using simulated annealing

Computers and Industrial Engineering
An augmented beam search-based algorithm for the circular open dimension problem

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

Applied Computational Intelligence and Soft Computing
Heuristic energy landscape paving for protein folding problem in the three-dimensional HP lattice model

Computational Biology and Chemistry
Packing unequal circles using formulation space search

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of packing circles into a larger containing circle is a kind of NP-hard problem. It is of high theoretical and practical value. Lacking powerful optimization method is the key obstacle to solving this problem. The energy landscape paving (ELP) method is a class of heuristic global optimization algorithm and a generation of Monte Carlo method. By incorporating new configuration update mechanism into ELP method, an improved energy landscape paving (ELP+) algorithm is put forward. The computational results, on two sets of instances taken from the literature, show the effectiveness of the proposed algorithm.