Title :
Evolutionary algorithms for the edge biconnectivity augmentation problem
Author :
Rao, T.M. ; Rao, Raghuveer ; Sahin, Ferat ; Tillett, Jason
Author_Institution :
Dept. of Comput. Sci., SUNY, Brockport, NY, USA
Abstract :
A graph is edge-biconnected if it requires the removal of at least two edges to disconnect it. Assume that we have weighted graph that is not biconnected, and an additional set of augmentation edges. The (NP-hard) edge biconnectivity augmentation problem is to select a minimal subset of the augmentation edges, whose inclusion will cause the graph to be biconnected. This paper explores the application of particle swarm optimization and genetic algorithms for this problem.
Keywords :
computational complexity; genetic algorithms; graph theory; NP-hard problems; augmentation edges; edge biconnectivity augmentation problem; edge removal; evolutionary algorithms; genetic algorithms; minimal subset; particle swarm optimization; weighted graph; Adaptive algorithm; Biology computing; Computer science; Cost function; Delay; Evolutionary computation; Genetic algorithms; Maintenance; NP-hard problem; Particle swarm optimization;
Conference_Titel :
Systems, Man and Cybernetics, 2003. IEEE International Conference on
Print_ISBN :
0-7803-7952-7
DOI :
10.1109/ICSMC.2003.1244698
