Artificial immune system to find a set of k-spanning trees with low costs and distinct topologies

Authors:
Priscila C. Berbert;Leonardo J. R. Freitas Filho;Tiago A. Almeida;Márcia B. Carvalho;Akebo Yamakami
Affiliations:
Department of Telematics, School of Electrical and Computer Engineering, State University of Campinas, Campinas, São Paulo, Brazil;Department of Telematics, School of Electrical and Computer Engineering, State University of Campinas, Campinas, São Paulo, Brazil;Department of Telematics, School of Electrical and Computer Engineering, State University of Campinas, Campinas, São Paulo, Brazil;Department of Telematics, School of Electrical and Computer Engineering, State University of Campinas, Campinas, São Paulo, Brazil;Department of Telematics, School of Electrical and Computer Engineering, State University of Campinas, Campinas, São Paulo, Brazil
Venue:
ICARIS'07 Proceedings of the 6th international conference on Artificial immune systems
Year:
2007

Citing 5
Cited 1

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
Routing and wavelength assignment with power considerations in optical networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Artficial Immune Systems and Their Applications

Artficial Immune Systems and Their Applications
Solving Multiobjective Optimization Problems Using an Artificial Immune System

Genetic Programming and Evolvable Machines

Two-stage EDA-based approach for all optical WDM mesh network survivability under SRLG constraints

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work proposes an Artificial Immune System to find a set of k spanning trees with low costs and distinct topologies. The attainment of this set of solutions is necessary when the problem has restrictions or when the interest is to present good alternative solutions for posterior decision making. Solving this problem means to explore an enormous space of solutions that grows as the number of graph nodes increases; it becomes impractible using exact or comparative methods. However, it is known that bio-inspired algorithms have a high capacity of exploration and exploitation of the search space. Moreover, inherent characteristics of AIS become the search mechanism more efficient allowing the resolution of this problem in a feasible computational time.