Advertisement

An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem

  • Ivana LjubiĆ
  • GüntherR. Raidl
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2037)

Abstract

Augmenting an existing network with additional links to achieve higher robustness and survivability plays an important role in network design. We consider the problem of augmenting a network with links of minimum total cost in order to make it edge-biconnected, i.e. the failure of a single link will never disconnect any two nodes. A new evolutionary algorithm is proposed that works directly on the set of additional links of a candidate solution. Problem-specific initialization, recombination, and mutation operators use a stochastic hill-climbing procedure. With low computational effort, only locally optimal, feasible candidate solutions are produced. Experimental results are significantly better than those of a previous genetic algorithm concerning final solutions’ qualities and especially execution times.

Keywords

Evolutionary Algorithm Mutation Operator Minimum Span Tree Memetic Algorithm Hybrid Genetic Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    K.P. Eswaran and R.E. Tarjan. Augmentation problems. SIAM Journal on Computing, 5(4):653–665, 1976.MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Ivana LjubiĆ, Günther R. Raidl, and Jozef Kratica. A hybrid GA for the edge-biconnectivity augmentation problem. In Kalyanmoy Deb, Günther Rudolph, Xin Yao, and Hans-Paul Schwefel, editors, Proceedings of the 2000 Parallel Problem Solving from Nature VI Conference, volume 1917 of LNCS, pages 641–650. Springer, 2000.Google Scholar
  3. 3.
    S. Khuller, B. Raghavachari, and N. Young. Low-degree spanning trees of small weight. SIAM Journal of Computing, 25(2):355–368, 1996.MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    G.N. Frederickson and J. Jájá. Approximation algorithms for several graph augmentation problems. SIAM Journal on Computing, 10(2):270–283, 1981.MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    H.N. Gabow, Z. Galil, T. Spencer, and R.E. Tarjan. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica, 6(2):109–122, 1986.MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    S. Khuller and R. Thurimella. Approximation algorithms for graph augmentation. Journal of Algorithms, 14(2):214–225, 1993.MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    A. Zhu. A uniform framework for approximating weighted connectivity problems. B.Sc. thesis, University of Maryland, MD, May 1999.Google Scholar
  8. 8.
    A. Zhu, S. Khuller, and B. Raghavachari. A uniform framework for approximating weighted connectivity problems. In Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, pages 937–938, 1999.Google Scholar
  9. 9.
    J. Kratica. Improving performances of the genetic algorithm by caching. Computers and Artificial Intelligence, 18(3):271–283, 1999.zbMATHGoogle Scholar
  10. 10.
    W. Mader. Minimale n-fach kantenzusammenhängende Graphen. Math. Ann., 191:21–28, 1971.MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    P. Moscato. Memetic algorithms: A short introduction. In D. Corne et al., editor, New Ideas in Optimization, pages 219–234. McGraw Hill, Berkshire, England, 1999.Google Scholar
  12. 12.
    R.E. Tarjan. Depth first search and linear graph algorithms. SIAM Journal of Computing, 1:146–160, 1972.MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Ivana LjubiĆ
  • GüntherR. Raidl
    • 1
  1. 1.Institute for Computer Graphics and AlgorithmsVienna University of TechnologyViennaAustria

Personalised recommendations