Solving radial topology constrained problems with evolutionary algorithms

5Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We report key algorithmic specific features involved in the evolutionary radial network problem solution. We focus on the dimensionality problem of large-scale networks and on the singularities of the radial topology search space. We (1) report the difficulties of the canonical genetic algorithm in handling network topology constraints, and (2) present both the genotype information structure and the recombination operator to overcome such difficulties. The proposed recombination operator processes genetic information as meaningful topological structures, and turns radiality and connectivity into genetic transmissible properties. Results are presented to illustrate the difference between the canonical approach and the approach taken.

Cite

CITATION STYLE

APA

Carvalho, P. M. S., Ferreira, L. A. F. M., & Barruncho, L. M. F. (1999). Solving radial topology constrained problems with evolutionary algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1585, pp. 58–65). Springer Verlag. https://doi.org/10.1007/3-540-48873-1_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free