|
|
||||||||
Dipartimento di Sistemi e Informatica, Università di Firenze, I-50139 Firenze, Italy
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
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
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 |