JUCS - Journal of Universal Computer Science 5(8): 464-470, doi: 10.3217/jucs-005-08-0464
A Packing Problem, Solved by Genetic Algorithms
expand article infoGeorg Franck-Oberaspach‡, Dietmar B. Schweiger§, Karl Svozil§
‡ Institut für EDV-gestützte Methoden in Architektur und Raumplanung, University of Technology Vienna, Vienna, Austria§ Institut für Theoretische Physik, University of Technology Vienna, Vienna, Austria

Corresponding author: Georg Franck-Oberaspach ( franck@osiris.iemar.tuwien.ac.at )

© Georg Franck-Oberaspach, Dietmar Schweiger, Karl Svozil.
This article is freely available under the J.UCS Open Content License.
Citation: Franck-Oberaspach G, Schweiger DB, Svozil K (1999) A Packing Problem, Solved by Genetic Algorithms. JUCS - Journal of Universal Computer Science 5(8): 464-470. https://doi.org/10.3217/jucs-005-08-0464
Open Access
Abstract
An arbitrary number of points are arranged in a given twodimensional simply connected region such that their mutual distances and the distance from the region boundary becomes a maximum.