The Impact of Complex Network Models to EDAs

Article Preview

Abstract:

The study conducted in this paper is mainly driven by the topological characteristics of the structures that the interactions among the variables of the problems provide. Taking as reference the emergent field of complex networks, we generate a wide spectrum of networks that will serve as problem structures. Then, the impact that the topological characteristics of those networks have, both in the hardness of the optimization problem and in the behavior of the EDA, is analyzed. This reveals a relationship among the topology of the problem structure, the difficulty of the problems and the dependences that the algorithm needs to learn in order to solve the problems.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 926-930)

Pages:

3290-3293

Citation:

Online since:

May 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] J. J. Grefenstette. Optimization of control parameters for genetic algorithms. IEEE Transactions on Systems, Man, and Cybernetics, 16(1): 122-128, (1986).

DOI: 10.1109/tsmc.1986.289288

Google Scholar

[2] J. H. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI, (1975).

Google Scholar

[3] A. A. Zhigljavsky. Theory of Global Random Search. Kluwer Academic Publishers, The Netherlands, (1991).

Google Scholar

[4] D. J. Watts, and S. H. Strogatz. Collective dynamics of small-world networks. Nature, 393(6684): 440–442, (1998).

DOI: 10.1038/30918

Google Scholar

[5] M. Pelikan. Hierarchical Bayesian Optimization Algorithm. Toward a New Generation of Evolutionary Algorithms. Studies in Fuzziness and Soft Computing. Springer, (2005).

DOI: 10.1007/978-3-540-32373-0_6

Google Scholar