A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs

Authors:
Ivana Ljubić;Günther R. Raidl
Affiliations:
Institute of Computer Graphics and Algorithms, Vienna University of Technology, Favoritenstraße 9–11/186, 1040 Vienna, Austria. ljubic@ads.tuwien.ac.at;Institute of Computer Graphics and Algorithms, Vienna University of Technology, Favoritenstraße 9–11/186, 1040 Vienna, Austria. raidl@ads.tuwien.ac.at
Venue:
Journal of Heuristics
Year:
2003

Citing 17
Cited 3

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

Combinatorica
Edge-connectivity augmentation problems

Journal of Computer and System Sciences
Approximation algorithms for graph augmentation

Journal of Algorithms
Finding a smallest augmentation to biconnect a graph

SIAM Journal on Computing
Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
Approximation algorithms for finding highly connected subgraphs

Approximation algorithms for NP-hard problems
A new approximation algorithm for the planar augmentation problem

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A uniform framework for approximating weighted connectivity problems

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Memetic algorithms: a short introduction

New ideas in optimization
Fitness landscapes and memetic algorithm design

New ideas in optimization
Approximation algorithms for minimum-cost k-vertex connected subgraphs

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Design of Survivable Networks with Bounded Rings

Design of Survivable Networks with Bounded Rings
Data Structures and Algorithms

Data Structures and Algorithms
An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms

Proceedings of the 6th International Conference on Genetic Algorithms
A Memetic Algorithm for Vertex-Biconnectivity Augmentation

Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Fitness landscape analysis and memetic algorithms for the quadratic assignment problem

IEEE Transactions on Evolutionary Computation

Parameter adjustment for genetic algorithm for two-level hierarchical covering location problem

WSEAS Transactions on Computers
Computing the metric dimension of graphs by genetic algorithms

Computational Optimization and Applications
An ILP formulation and genetic algorithm for the Maximum Degree-Bounded Connected Subgraph problem

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the problem of augmenting a given graph by a cheapest possible set of additional edges in order to make the graph vertex-biconnected. A real-world instance of this problem is the enhancement of an already established computer network to become robust against single node failures. The presented memetic algorithm includes effective preprocessing of problem data and a fast local improvement strategy which is applied before a solution is included into the population. In this way, the memetic algorithm's population consists always of only feasible, locally optimal solution candidates. Empirical results on two sets of test instances indicate the superiority of the new approach over two previous heuristics and an earlier genetic algorithm.