DocumentCode
537566
Title
A Hybrid Algorithm for the Circular Packing Problem with Constraint of Equilibrium
Author
Wang Jinmin ; Qi Yang ; Li Yonggang
Author_Institution
Sch. of Mech. Eng., Tianjin Univ. of Technol. & Educ., Tianjin, China
Volume
1
fYear
2010
fDate
23-24 Oct. 2010
Firstpage
105
Lastpage
108
Abstract
The circular packing problem is widely found in applications such as production, shipbuilding and aerospace. By combining simulated annealing with particle swarm optimization, a hybrid algorithm for the circular packing problem with constraint of equilibrium is presented. In order to enhance algorithm´s search ability and get out of local minima, some strategies can be used such as eliminating overlapping, inner attraction, exterior press, twice cycle. The computated results of example are provided and compared with that of some other algorithms.
Keywords
bin packing; particle swarm optimisation; aerospace; circular packing problem; equilibrium constraint; hybrid algorithm; particle swarm optimization; search ability; shipbuilding; NP-hard; circular packing problem; particle swarm optimization; simulated annealing;
fLanguage
English
Publisher
ieee
Conference_Titel
Web Information Systems and Mining (WISM), 2010 International Conference on
Conference_Location
Sanya
Print_ISBN
978-1-4244-8438-6
Type
conf
DOI
10.1109/WISM.2010.172
Filename
5662292
Link To Document