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 cons...Show MoreMetadata
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.
Date of Conference: 12-17 July 2015
Date Added to IEEE Xplore: 01 October 2015
ISBN Information: