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.
['Huang Wen-qi', 'Kang Yan']
A Short Note on a Simple Search Heuristic for the Diskspacking Problem