Abstract
In the design of communication networks, robustness against failures in single links or nodes is an important issue. This paper proposes a new approach for the \( \mathcal{N}\mathcal{P} \)-complete edge-biconnectivity augmentation (E2AUG) problem, in which a given graph G 0(V,E 0) needs to be augmented by the cheapest possible set of edges AUG so that a single edge deletion does not disconnect G 0. The new approach is based on a preliminary reduction of the problem and a genetic algorithm (GA) using a binary vector to represent a set of augmenting edges and therefore a candidate solution. Two strategies are proposed to deal with infeasible solutions that do not lead to edge-biconnectivity. In the first, more traditional variant, infeasible solutions are detected and simply discarded. The second method is a hybrid approach that uses an effective heuristic to repair infeasible solutions by adding usually cheap edges to AUG until the graph augmented with AUG becomes edge-biconnected. The two GA-variants are empirically compared to each other and to another iterative heuristic for the E2AUG problem using instances involving up to 1270 edges.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Du X., Hu X., Wong C. K.: On Shortest k-Edge-Connected Steiner Networks in Metric Spaces, Journal of Combinatorial Optimization 4(1), (2000), 99–107
Diestel R.: Graph Theory, 2nd edition, Graduate Texts in Mathematics 173, Springer, New York, (2000)
Eswaran K. P., Tarjan R. E.: Augmentation Problems, SIAM Journal on Computing 5, (1979), 653–665
Frederickson G. N., Jájá J.: Approximation algorithms for several graph augmentation problems, SIAM Journal on Computing 10(2), (1981), 270–283
Garey M. R., Johnson D. S.: Computers and Intractability: A Guide to the Theory of \( \mathcal{N}\mathcal{P} \) Completeness, Freeman, (1979)
Goldberg D. E.: Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, MA, (1989)
Jungnickel D.: Graphs, Networks and Algorithms, Springer, Berlin, (1999)
Kahn V., Crescenzi P.: A compendium of \( \mathcal{N}\mathcal{P} \) optimization problems, http://www.nada.kth.se/theory/problemlist.html, (1999)
Khuller S., Thurimella R.: Approximation Algorithms for Graph Augmentation, Journal of Algorithms 14(2), (1993), 214–225
Khuller S., Vishkin U.: Biconnectivity Approximations and Graph Carvings, Journal of the ACM 41(2), (1994) 214–235
Khuller S.: Approximation Algorithms for Finding Highly Connected Subgraphs, in Approximation Algorithms for \( \mathcal{N}\mathcal{P} \)-hard problems, ed. Hochbaum D., PWS Publishing Company, (1996)
Khuller S., Raghavachari B.: Improved Approximation Algorithms for Uniform Connectivity Problem, Journal of Algorithms 21(2), (1996), 434–450
Kratica J.: Improving Performances of the Genetic Algorithm by Caching, Computers and Artificial Intelligence 18(3), (1999), 271–283
Kratica J.: Parallelization of Genetic Algorithms for Solving Some \( \mathcal{N}\mathcal{P} \)-complete Problems, PhD thesis (in Serbian), Faculty of Mathematics, Belgrade, (2000)
Ljubic I.: Application of Genetic Algorithms in Graph Connectivity Problems, MS thesis (in Serbian), Faculty of Mathematics, Belgrade, (2000)
Ljubic I., Kratica J.: A Genetic Algorithm for the Biconnectivity Augmentation Problem, submitted to the IEEE Congress on Evolutionary Computation, San Diego, CA, (2000)
Syswerda G.: Uniform Crossover in Genetic Algorithms, Proc. of the 3rd Int. Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, Calif., (1989), 2–9
Tarjan R. E.: Depth First Search and Linear Graph Algorithms, SIAM Journal of Computing 1, (1972), 146–160
Tsukiyama S., Kioke K., Shirakawa I.: An Algorithm to Eliminate All Complex Triangles in a Maximal Planar Graph for Use in VLSI Floorplanning, in Algorithmic Aspects of VLSI Layout, ed. Sarrafzadeh M., Lee D. T., World Scientific Publishing, (1993)
Veljan D.: Combinatorics and Graph Theory, Školska knjiga, Zagreb, (1989)
Zhu A., Khuller S., Raghavachari B.: A Uniform Framework for Approximating Weighted Connectivity Problems, Proc. of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, (1999), 937–938
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ljubić, I., Raidl, G.R., Kratica, J. (2000). A Hybrid GA for the Edge-Biconnectivity Augmentation Problem. In: Schoenauer, M., et al. Parallel Problem Solving from Nature PPSN VI. PPSN 2000. Lecture Notes in Computer Science, vol 1917. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45356-3_63
Download citation
DOI: https://doi.org/10.1007/3-540-45356-3_63
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41056-0
Online ISBN: 978-3-540-45356-7
eBook Packages: Springer Book Archive