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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ashlock, D., Krisk, N., Fogel, G.: Functions for the analysis of exploration and exploitation. In: Proceedings of the 2013 Congress on Evolutionary Computation, pp. 2020–2027. IEEE Press, Piscataway (2013)
Ashlock, W., Ashlock, D.: Single parent genetic programming. In: Proceedings of the 2005 Congress on Evolutionary Computation, pp. 1172–1179 (2005)
Bryden, K.M., Ashlock, D.A., Corns, S., Willson, S.J.: Graph based evolutionary algorithms. IEEE Transactions on Evolutionary Computation 10, 550–567 (2006)
Caflisch, R.E.: Monte carlo and quasi-monte carlo methods. Acta Numerica 7, 1–49 (1998)
León, C., Miranda, G., RodrÃguez, C., Segura, C.: 2D cutting stock problem: A new parallel algorithm and bounds. In: Kermarrec, A.-M., Bougé, L., Priol, T. (eds.) Euro-Par 2007. LNCS, vol. 4641, pp. 795–804. Springer, Heidelberg (2007)
Locatelli, M., Raber, U.: Packing equal circles in a square: A deterministic global optimization approach. Discrete Appl. Math. 122(1-3), 139–166 (2002), doi:10.1016/S0166-218X(01)00359-6
Markot, M.C., Csendes, T.: A new verified optimization technique for the ‘packing circles in a unit square; problems. SIAM J. Optimization 16(1), 193–219 (2005)
McEachern, A., Ashlock, D., Shonfeld, J.: Sequence classification with side effect machines evolved via ring optimization. Biosystems 113(1), 9–27 (2013)
Smith, R.E., Forrest, S., Perelson, A.S.: Searching for diverse, cooperative populations with genetic algorithms. Evolutionary Computation 1(2), 127–149 (1993)
Syswerda, G.: A study of reproduction in generational and steady state genetic algorithms. In: Foundations of Genetic Algorithms, pp. 94–101. Morgan Kaufmann, San Francisco (1991)
Tomassini, M.: Spatially Structured Evolutionary Algorithms. Springer, New York (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Ashlock, D., Hingston, P., McGuinness, C. (2015). Evolving Point Packings in the Plane. In: Chalup, S.K., Blair, A.D., Randall, M. (eds) Artificial Life and Computational Intelligence. ACALCI 2015. Lecture Notes in Computer Science(), vol 8955. Springer, Cham. https://doi.org/10.1007/978-3-319-14803-8_23
Download citation
DOI: https://doi.org/10.1007/978-3-319-14803-8_23
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-14802-1
Online ISBN: 978-3-319-14803-8
eBook Packages: Computer ScienceComputer Science (R0)