This paper concerns the problem to place N non overlapping circles in a circular container with minimum radius. This is a well known and widely studied problem with applications in manufacturing and logistics and, in particular, to problems related to cutting and packing. In this paper we propose an algorithm that by applying a strength along a selected direction on each circle, simulates the shifting of circles on the plane and tries to reduce the radius of the circular container during this movements. The algorithm is based on a multistart technique where the starting solutions are produced by a tabu search heuristic that uses also the current best solution. The algorithm takes part in a public international contest in order to find optimal solutions to a special case in circle packing. The contest saw the participation of 155 teams and our algorithm achieved the tenth position.
|Titolo:||A tabu search approach for the circle packing problem|
|Data di pubblicazione:||2014|
|Appare nelle tipologie:||4.1 Contributo in Atti di convegno|