Evolving point packings in the plane

Authors/Creators

Daniel Ashlock
Philip Hingston, Edith Cowan University
Cameron McGuinness

Abstract

The problem of packing a fixed number of points into a square while maximizing the distance between them is a good test bed for comparing representations for real optimization problems not based on a simple mathematical formula. The problem does permit the applications of forms of gradient search and so allows simple and hybrid algorithms to be compared. In this study we compare a simple representation comprised of an array of points to a more complex generative representation called the walking triangle representation.

Document Type

Journal Article

Date of Publication

2015

Publisher

Springer Verlag

School

School of Science

RAS ID

21624

Comments

Ashlock, D., Hingston, P., McGuinness, C. (2015). Evolving point packings in the plane In Proceedings of the First Australasian Conference on Artificial Life and Computational Intelligence (pp. 297-309). Newcastle, Australia: The University of Newcastle. Available here.

Copyright

subscription content