Energy Landscape Paving Algorithm for Solving Circles Packing Problem

Author

Liu, Jingfa ; Xu, Danhua ; Yao, Yonglei ; Zheng, Yu

Author_Institution

Comput. & Software Inst., Nanjing Univ. of Inf. Sci. & Technol., Nanjing, China

Volume

1

fYear

2009

fDate

6-7 June 2009

Firstpage

107

Lastpage

110

Abstract

In this paper, we study the circles packing problem which consists of packing a set of equal or unequal circles of known radii into a larger containing circle without overlapping. The energy landscape paving (ELP) method is a class of heuristic global optimization algorithm. By combining the ELP method with the gradient descent (GD) procedure, an improved energy landscape paving (ELP+) algorithm for the circles packing problem is put forward. The computational results show the effectiveness of the proposed algorithm.

Keywords

bin packing; gradient methods; optimisation; circles packing problem; energy landscape paving algorithm; gradient descent procedure; heuristic global optimization algorithm; Computational intelligence; Containers; Heuristic algorithms; Humans; Information science; Optimization methods; Proteins; Shape; Simulated annealing; Software algorithms; Packing problem; combinatorial optimization; energy landscape paving; gradient descent method;

fLanguage

English

Publisher

ieee

Conference_Titel

Computational Intelligence and Natural Computing, 2009. CINC '09. International Conference on

Conference_Location

Wuhan

Print_ISBN

978-0-7695-3645-3

Type

conf

DOI

10.1109/CINC.2009.195

Filename

5231379