109 urn:lsid:arphahub.com:pub:3dc5f44e-8666-58db-bc76-a455210e8891 JUCS - Journal of Universal Computer Science jucs 0948-695X 0948-6968 Journal of Universal Computer Science 10.3217/jucs-005-08-0464 27573 Research Article D.2.2 - Design Tools and Techniques J.5 - ARTS AND HUMANITIES A Packing Problem, Solved by Genetic Algorithms Franck-Oberaspach Georg franck@osiris.iemar.tuwien.ac.at 1 Schweiger Dietmar B. 2 Svozil Karl 2 Institut für EDV-gestützte Methoden in Architektur und Raumplanung, University of Technology Vienna, Vienna, Austria 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 Institut für Theoretische Physik, University of Technology Vienna Vienna Austria

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

Academic editor:

1999 28 08 1999 5 8 464 470 DC3AC7E3-E025-5843-B38A-7101D42C9DE7 6995692 Georg Franck-Oberaspach, Dietmar B. Schweiger, Karl Svozil This article is freely available under the J.UCS Open Content License.

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.