Article ID: | iaor20062092 |
Country: | United Kingdom |
Volume: | 56 |
Issue: | 5 |
Start Page Number: | 539 |
End Page Number: | 548 |
Publication Date: | May 2005 |
Journal: | Journal of the Operational Research Society |
Authors: | Li Y., Huang W.Q., Li C.M. |
Keywords: | heuristics |
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.