Abstract
This paper presents principled results demonstrating how the identification and exploitation of variable dependencies by means of Artificial Neural Network powered online model building, combined with a model based local-search, opens the way towards large-scale optimization of hard, non-separable building-block problems.
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
Sastry, K., Goldberg, D.E., Llora, X.: Towards billion-bit optimization via a parallel estimation of distribution algorithm. In: GECCO 2007: Proceedings of the 9th annual conference on Genetic and evolutionary computation, pp. 577–584. ACM, New York (2007)
Yu, T.L., Sastry, K., Goldberg, D.E., Pelikan, M.: Population sizing for entropy-based model building in discrete estimation of distribution algorithms. In: Lipson, H. (ed.) GECCO, pp. 601–608. ACM, New York (2007)
Pelikan, M., Goldberg, D.E., Cantú-Paz, E.: Bayesian optimization algorithm, population sizing, and time to convergence. In: Whitley, L.D., Goldberg, D.E., Cantú-Paz, E., Spector, L., Parmee, I.C., Beyer, H.G. (eds.) GECCO, pp. 275–282. Morgan Kaufmann, San Francisco (2000)
Iclanzan, D., Dumitrescu, D.: Overcoming hierarchical difficulty by hill-climbing the building block structure. In: Thierens, D., et al. (eds.) GECCO 2007: Proceedings of the 9th annual conference on Genetic and Evolutionary Computation, vol. 2, pp. 1256–1263. ACM Press, London (2007)
Watson, R.A., Hornby, G., Pollack, J.B.: Modeling building-block interdependency. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN V 1998. LNCS, vol. 1498, pp. 97–108. Springer, Heidelberg (1998)
Watson, R.A., Pollack, J.B.: Hierarchically consistent test problems for genetic algorithms: Summary and additional results. In: Brave, S. (ed.) GECCO 1999: Late Breaking Papers, Orlando, Florida, USA, July 13, 1999, pp. 292–297 (1999)
Pelikan, M., Goldberg, D.E.: Escaping hierarchical traps with competent genetic algorithms. In: Spectes, L., et al. (eds.) GECCO 2001, pp. 511–518. Morgan Kaufmann, San Francisco (2001)
Sastry, K., Goldberg, D.E.: Designing competent mutation operators via probabilistic model building of neighborhoods. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol. 3103, pp. 114–125. Springer, Heidelberg (2004)
Jones, T.: Evolutionary Algorithms, Fitness Landscapes and Search. PhD thesis, University of New Mexico, Albuquerque, NM (1995)
Iclanzan, D., Dumitrescu, D.: Going for the big fishes: Discovering and combining large neutral and massively multimodal building-blocks with model based macro-mutation. In: GECCO 2008: Proceedings of the 10th annual conference on Genetic and Evolutionary Computation. ACM Press, New York (accepted, 2008)
Kohonen, T.: Self-organized formation of topologically correct feature maps. Biological Cybernetics 43, 59–69 (1982)
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
Iclănzan, D., Dumitrescu, D. (2008). Large-Scale Optimization of Non-separable Building-Block Problems. 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_89
Download citation
DOI: https://doi.org/10.1007/978-3-540-87700-4_89
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)