Abstract
When using an evolutionary algorithm on an unknown problem, properties like the number of global/local optima must be guessed for properly picking an algorithm and its parameters. It is the aim of current paper to put forward an EA-based method for real-valued optimization to provide an estimate on the number of optima a function exhibits, or at least of the ones that are in reach for a certain algorithm configuration, at low cost. We compare against direct clustering methods applied to different stages of evolved populations; interestingly, there is a turning point (in evaluations) after which our method is clearly better, although for very low budgets, the clustering methods have advantages. Consequently, it is argued in favor of further hybridizations.
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.
Similar content being viewed by others
References
Parmee, I.C.: The Maintenance of Search Diversity for Effective Design Space Decomposition Using Cluster-Oriented Genetic Algorithms (COGA) and Multi-Agent Strategies (GAANT). In: 2nd International Conference on Adaptive Computing in Engineering Design and Control (ACEDC 1996), pp. 128–138. University of Plymouth (1996)
Stoean, C., Preuss, M., Stoean, R., Dumitrescu, D.: Disburdening the Species Conservation Evolutionary Algorithm of Arguing with Radii. In: Lipson, H. (ed.) 9th Annual Conference on Genetic and Evolutionary Computation (GECCO 2007), pp. 1420–1427. ACM Press, New York (2007)
Ramalhino Lourenco, H., Martin, O., Stützle, T.: Iterated Local Search. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics. Kluwer, Dordrecht (2002)
Goldberg, D.E., Richardson, J.: Genetic Algorithms with Sharing for Multimodal Function Optimization. In: 2nd International Conference on Genetic Algorithms, pp. 41–49. Lawrence Erlbaum Associates, Hillsdale (1987)
Mahfound, S.W.: Niching Methods for Genetic Algorithms. Technical Report, IlliGAL, 95001, University of Illinois (1995)
Beasley, D., Bull, D.R., Martin, R.R.: A Sequential Niche Technique for Multimodal Function Optimisation. J. Evol. Comp. 1(2), 101–125 (1993)
Deb, K., Goldberg, D.E.: An Investigation of Niche and Species Formation in Genetic Function Optimization. In: 3rd International Conference on Genetic Algorithms, pp. 42–50. Morgan Kaufman, San Mateo (1989)
Reeves, C.R., Eremeev, A.V.: Statistical Analysis of Local Search Landscapes. JORS 55(7), 687–693 (2004)
Ursem, R.K.: Multinational Evolutionary Algorithms. In: Congress of Evolutionary Computation (CEC 1999), vol. 3, pp. 1633–1640. IEEE Press, Piscataway (1999)
Preuss, M., Schoenemann, L., Emmerich, M.: Counteracting Genetic Drift and Disruptive Recombination in \((\mu_{,}^{+} \alpha)\)-EA on Multimodal Fitness Landscapes. In: Beyer, H.G., O’Reilly, U.M. (eds.) 7th Annual Conference on Genetic and Evolutionary Computation (GECCO 2005), pp. 865–872. ACM Press, New York (2005)
Jarvis, R.A., Patrick, E.A.: Clustering Using a Similarity Measure Based on Shared Near Neighbours. J. IEEE Trans. on Comp., 1025–1034 (1973)
Jelasity, M., Mike Preuss, M.: On Obtaining Global Information in a Peer-to-Peer Fully Distributed Environment. In: Monien, B., Feldmann, R.L. (eds.) Euro-Par 2002. LNCS, vol. 2400, pp. 573–577. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stoean, C., Preuss, M., Stoean, R., Dumitrescu, D. (2008). EA-Powered Basin Number Estimation by Means of Preservation and Exploration. In: Rudolph, G., Jansen, T., Beume, N., Lucas, S., Poloni, C. (eds) Parallel Problem Solving from Nature – PPSN X. PPSN 2008. Lecture Notes in Computer Science, vol 5199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87700-4_57
Download citation
DOI: https://doi.org/10.1007/978-3-540-87700-4_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87699-1
Online ISBN: 978-3-540-87700-4
eBook Packages: Computer ScienceComputer Science (R0)