Packing circles in the smallest circle: an adaptive hybrid algorithm
I Al-Mudahka,
M Hifi and
R M'Hallah
Additional contact information
I Al-Mudahka: Kuwait University, Kuwait
M Hifi: Université de Picardie Jules Verne, Amiens, France
R M'Hallah: Kuwait University, Kuwait
Journal of the Operational Research Society, 2011, vol. 62, issue 11, 1917-1930
Abstract:
The circular packing problem (CPP) consists of packing n circles Ci, i∈N={1, …, n}, into the smallest containing circle ℂ. The objective is to determine the coordinates (xi) of the centre of Ci, i∈N, as well as the radius r and centre (x, y) of ℂ. CPP, which is a variant of the two-dimensional open-dimension problem, is NP hard. This paper presents an adaptive algorithm that incorporates nested partitioning within a tabu search and applies some diversification strategies to obtain a (near) global optimum. The tabu search is to identify the n circles’ ordering, whereas the nested partitioning is to determine the n circles’ positions that yield the smallest r. The computational results show the efficiency of the proposed algorithm.
Date: 2011
References: Add references at CitEc
Citations: View citations in EconPapers (4)
Downloads: (external link)
http://www.palgrave-journals.com/jors/journal/v62/n11/pdf/jors2010157a.pdf Link to full text PDF (application/pdf)
http://www.palgrave-journals.com/jors/journal/v62/n11/full/jors2010157a.html Link to full text HTML (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:62:y:2011:i:11:p:1917-1930
Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274
Access Statistics for this article
Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook
More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().