A Short Note on a Simple Search Heuristic for the Diskspacking Problem

Huang Wenqi () and Kang Yan ()

Annals of Operations Research, 2004, vol. 131, issue 1, 108 pages

Abstract: 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. Copyright Kluwer Academic Publishers 2004

Keywords: disks packing problem; heuristic (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1023/B:ANOR.0000039514.14699.03 (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:spr:annopr:v:131:y:2004:i:1:p:101-108:10.1023/b:anor.0000039514.14699.03

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/B:ANOR.0000039514.14699.03

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().