Title :
Packing equal circles in a damaged square
Author :
Xinyi Zhuang; Ling Yan; Liang Chen
Author_Institution :
Department of Computer Science, University of Northern British Columbia, Prince George, Canada
fDate :
7/1/2015 12:00:00 AM
Abstract :
This paper proposes a Simulated Annealing enhanced Greed Vacancy Search Algorithm (eGVXSA) for solving packing equal circles in a damaged square. The damaged area is consisted of a number of small square regions that are randomly distributed within the container. The benefits present at its efficiency of consuming limited space. For this problem, Experiments have shown the efficiency over the original Greedy Vacancy Search Algorithm.
Keywords :
"Complexity theory","Annealing","Search problems"
Conference_Titel :
Neural Networks (IJCNN), 2015 International Joint Conference on
Electronic_ISBN :
2161-4407
DOI :
10.1109/IJCNN.2015.7280846
