A Simulated Annealing Algorithm for the Circles Packing Problem
We present a heuristic simulated annealing algorithm to solve the circles packing problem. For constructing a special neighborhood and jumping out of the local minimum trap, some effective heuristic strategies are presented. These strategies are from nature and can allow the iterative process to converge fast. The HSA algorithm inherits the merit of the simulated annealing algorithm, and can avoid the disadvantage of blind search in the simulated annealing algorithm to some extent according to the special neighborhood. The computational results show that the performance of the presented algorithm outperforms that of the quasi-physical quasi-human algorithm.
KeywordsSimulated Annealing Algorithm Packing Problem Heuristic Strategy Special Neighborhood Blind Search
- 6.Lubachevsky, D., Graham, R.L.: Curved hexagonal packing of equal disks in a circle. Discrete & Computational Geometry, 179–194 (1997)Google Scholar
- 7.Wenqi, H., Shuhao, Z.: A quasi-physical method for solving packing problems. Acta Mathematicae Applagatae Sinica 2(2), 176–180 (1979)Google Scholar