Abstract
This paper investigates GA approaches for solving the reliable communication network design problem. For solving this problem a network with minimum cost must be found that satisfies a given network reliability constraint. To consider the additional reliability constraint different approaches are possible. We show that existing approaches using penalty functions can result in invalid solutions and are therefore not appropriate for solving this problem. To overcome these problems we present a repair heuristic, which is based on the number of spanning trees in a network. This heuristic always generates a valid solution, which when compared to a greedy cheapest repair heuristic shows that the new approach finds better solutions with less computational effort.
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
Chen, Y., Li, J., Chen, J.: A new algorithm for network probabilistic connectivity. In: Proceedings of the IEEE military communication conference, IEEE Service Center, Piscataway (1999)
Boorstyn, R.R., Frank, H.: Large-scale network topological optimization. IEEE Transactions on Reliability 25, 29–37 (1977)
Garey, M.R., Johnson, D.S.: Computers and Intractibility: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Fransisco (1979)
Ying, L.: Analysis method of survivability of probabilistic networks. Military Communication Technology Magazine, 48 (1993)
Dengiz, B., Altiparmak, F., Smith, A.E.: Local search genetic algorithm for optimal design of reliable networks. IEEE Trans. on Evolutionary Computation 1(3), 179–188 (1997)
Cheng, S.-T.: Topological optimization of a reliable communication network. IEEE Transactions on Reliability 47(3), 225–233 (1998)
Liu, B., Iwamura, K.: Topological optimization model for communication network with multiple reliability goals. Computer and Mathematics with Applications 39, 59–69 (2000)
Fard, N., Lee, T.-H.: Spanning tree approach in all-terminal network reliability expansion. computer communications 24, 1348–1353 (2001)
Jan, R.-H., Hwang, F.-J., Chen, S.-T.: Topological optimization of a communication network subject to a reliability constraint. IEEE Transactions on Reliability 42(1), 63–70 (1993)
Dengiz, B., Alabas, C.: A simulated annealing algorithm for design of computer communication networks. In: Proceedings of World Multiconference on Systemics, Cybernetics and Informatics, SCI 2001, vol. 5 (2001)
Baran, B., Laufer, F.: Topological optimization of reliable networks using a-teams. In: Proceedings of World Multiconference on Systemics, Cybernetics and Informatics - SCI 1999 and ISAS 1999, vol. 5 (1999)
Liu, B., Iwamura, K.: Topological optimization models for communication network with multiple reliability goals. Computers and Mathematics with Applications 39, 59–69 (2000)
Aggarwal, K.K., Rai, S.: Reliability evaluation in computer-communication networks. IEEE Transactions on Reliability 30(1), 32–35 (1981)
Manzi, E., Labbe, E.M., Latouche, G., Maffioli, F.: Fishman’s sampling plan for computing network reliability. IEEE Transactions on Reliability 50(1), 41–46 (2001)
Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, 3rd edn. Springer, Berlin (1996)
Craenen, B.G.W., Eiben, A.E., Marchiori, E.: How to handle constraints with evolutionary algortihms. In: Chambers, L. (ed.) Practical Handbook Of Genetic Algorithms: Applications, pp. 341–361. Chapman & Hall/CRC (2000)
Davis, L., Orvosh, D., Cox, A., Qiu, Y.: A genetic algorithm for survivable network design. In: Forrest, S. (ed.) Proceedings of the Fifth International Conference on Genetic Algorithms, San Mateo, CA, pp. 408–415. Morgan Kaufmann, San Francisco (1993)
Kimbrough, S.O., Lu, M., Wood, D.H., Wu, D.J.: Exploring a two-population genetic algorithm. In: Cantu-Paz, E., et al. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference 2003, pp. 1148–1159. Springer, Berlin (2003)
Goldberg, D.E.: Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading (1989)
Gottlieb, J.: Evolutionary Algorithms for Constrained Optimization Problems. PhD thesis, Technische Universität Clausthal, Institut für Informatik, Clausthal, Germany (1999)
Prüfer, H.: Neuer Beweis eines Satzes über Permutationen. Archiv für Mathematik und Physik 27, 742–744 (1918)
Raidl, G.R., Julstrom, B.A.: Edge-sets: An effective evolutionary coding of spanning trees. IEEE Transactions on Evolutionary Computation 7(3), 225–239 (2003)
Konak, A., Smith, A.: An improved general upperbound for all-terminal network reliability. Technical report, University of Pittsburgh (1998)
Colbourn, C.J.: The Combinatorics of Network Reliability. Oxford University Press, Oxford (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Reichelt, D., Rothlauf, F., Gmilkowsky, P. (2004). Designing Reliable Communication Networks with a Genetic Algorithm Using a Repair Heuristic. In: Gottlieb, J., Raidl, G.R. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2004. Lecture Notes in Computer Science, vol 3004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24652-7_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-24652-7_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21367-3
Online ISBN: 978-3-540-24652-7
eBook Packages: Springer Book Archive