DocumentCode
3413337
Title
A new algorithm for packing unequal disks in a larger circle
Author
Huang Wenqi ; Zhizhong, Zeng ; Zhanghua, Fu ; Xu, Ruchu
Author_Institution
Sch. of Comput. Sci. & Technol., Huazhong Univ. of Sci. & Technol., Wuhan, China
fYear
2012
fDate
24-26 Aug. 2012
Firstpage
32
Lastpage
35
Abstract
To set unequal disks in a container as small as possible without overlap is a fairly fascinating NP-hard task with wide applications. In this paper, we introduced a new method using the techniques of Tabu search, quasi-human basin-hopping strategy, and BFGS method as its basic elements, and illustrated its efficiency by comparing its outcomes of solving some benchmark problems with those of some other new and efficient algorithms.
Keywords
computational complexity; optimisation; search problems; BFGS method; NP-hard combinatorial optimization problem; packing unequal disks; quasi-human basin-hopping strategy; tabu search; Artificial neural networks; BFGS; NP-hard; Tabu search; basin-hopping; disks packing; quasi-human;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Information Processing (CSIP), 2012 International Conference on
Conference_Location
Xi´an, Shaanxi
Print_ISBN
978-1-4673-1410-7
Type
conf
DOI
10.1109/CSIP.2012.6308788
Filename
6308788
Link To Document