Greedy algorithms for packing unequal circles into a rectangular container

W Q Huang, Y Li (), H Akeb and C M Li ()
Additional contact information
W Q Huang: HuaZhong University of Science and Technology
Y Li: Université de Picardie Jules Verne
H Akeb: Université de Picardie Jules Verne
C M Li: Université de Picardie Jules Verne

Journal of the Operational Research Society, 2005, vol. 56, issue 5, 539-548

Abstract: Abstract In this paper, we study the problem of packing unequal circles into a two-dimensional rectangular container. We solve this problem by proposing two greedy algorithms. The first algorithm, denoted by B1.0, selects the next circle to place according to the maximum-hole degree rule, that is inspired from human activity in packing. The second algorithm, denoted by B1.5, improves B1.0 with a self-look-ahead search strategy. The comparisons with the published methods on several instances taken from the literature show the good performance of our approach.

Keywords: circle packing problem; combinatorial optimization; greedy algorithm; heuristic (search for similar items in EconPapers)
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2601836 Abstract (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:56:y:2005:i:5:d:10.1057_palgrave.jors.2601836

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2601836

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 ().