Packing equal circles in a damaged square using simulated annealing and greedy vacancy search.
Authors
Publication date
1 January 2015
Publisher
University of Northern British Columbia
Doi
Abstract
This thesis defines and investigates a generalized circle packing problem, called Packing Equal Circles into a Damaged Square (PECDS). We introduce a new heuristic algorithm that enhances and combines the Greedy Vacancy Search (GVS) and Stimulated Annealing (SA), and demonstrate, through a series of experiments, its ability to find better solutions than either GVS or SA alone. The synergy between the enhanced GVS and SA, along with explicit convergence detection, makes the algorithm robust in escaping the points of local optimum. --Leaf ii.The original print copy of this thesis may be available here: http://wizard.unbc.ca/record=b200686