INFORMS Journal on Computing
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


INFORMS JOURNAL ON COMPUTING
Vol. 20, No. 4, Fall 2008, pp. 516-524
DOI: 10.1287/ijoc.1080.0263
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Addis, B.
Right arrow Articles by Schoen, F.
Right arrow Search for Related Content

Disk Packing in a Square: A New Global Optimization Approach

B. Addis, M. Locatelli, F. Schoen

Dipartimento di Sistemi e Informatica, Università di Firenze, I-50139 Firenze, Italy
Dipartimento di Informatica, Università di Torino, I-10149 Torino, Italy
Dipartimento di Sistemi e Informatica, Università di Firenze, I-50139 Firenze, Italy

b.addis{at}ing.unifi.it
locatell{at}di.unito.it
fabio.schoen{at}unifi.it

We present a new computational approach to the problem of placing n identical nonoverlapping disks in the unit square in such a way that their radii are maximized. The problem has been studied in a large number of papers, from both a theoretical and a computational point of view. In this paper, we conjecture that the problem possesses a so-called funneling landscape, a feature that is commonly found in molecular conformation problems. Based on this conjecture, we develop a stochastic search algorithm that displays excellent numerical performance. Thanks to this algorithm, we could improve over previously known putative optima in the range n ≤ 130 in as many as 32 instances, the smallest of which is n = 53.

Key words: disk packing; circle packing; continuous dispersion problem; basin hopping; global optimization; stochastic methods
History: received October 2005; revised June 2006; accepted December 2007.







HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2008 by INFORMS.