|
|||||
|
|
Efficiently packing unequal disks in a circle |
|
| Authors: | Bernardetta Addis |
| Affiliation: | a Dip. Sistemi e Informatica, Univ. di Firenze, Italy via di Santa Marta, 3 - 50139 Firenze, Italy b Dip. Informatica, Univ. di Torino, Italy |
| Abstract: | Placing non-overlapping circles in a smallest container is a hard task. In this paper we present our strategy for optimally placing circles in a smallest circle which led us to win an international competition by properly mixing local and global optimization strategies with random search and local moves. |
| Keywords: | Global optimization Basin-hopping Circle packing Local moves Population-based approaches |
| 本文献已被 ScienceDirect 等数据库收录！ | |