| Article ID: | iaor20051039 |
| Country: | Netherlands |
| Volume: | 131 |
| Issue: | 1 |
| Start Page Number: | 101 |
| End Page Number: | 108 |
| Publication Date: | Oct 2004 |
| Journal: | Annals of Operations Research |
| Authors: | Huang Wenqi, Kang Yan |
| Keywords: | packing |
This paper presents a short note on a simple heuristic to find a feasible arrangement of a given set of different disks in a given circular area. By restarting with good initial solutions and escaping from the local minima early, a heuristic that simulates a system of elastic solids can solve such a disks packing problem more quickly. A number of computational results show the effectiveness of these improvements.