Skip to main content
SpringerLink
Log in

Survivable Network Design with an Evolution Strategy

  • Chapter
Success in Evolutionary Computation

Part of the book series: Studies in Computational Intelligence ((SCI,volume 92))

In this chapter, a novel evolutionary approach to survivable network design is presented when considering both economics and reliability. It is based on a combinatorial variant of the evolution strategy and clearly outperforms existing benchmark results by genetic algorithms. The integration of domain-specific knowledge in the mutation operator and a repair heuristic raises the performance of an otherwise broadly applicable but less effective metaheuristic. Moreover, the results underline the important but so far often neglected potential of evolution strategies in combinatorial optimization.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aboelfotoh HMF, Al-Sumait LS (2001) IEEE Trans Reliab 50(4):397–405

    Article  Google Scholar 

  2. Aggarwal KK, Rai S (1981) IEEE Trans Reliab 30(1):32–35

    Article  MATH  Google Scholar 

  3. Altiparmak F, Dengiz B, Smith A (2003) J Heuristics 9(6):471–487

    Article  Google Scholar 

  4. Arabas J, Kozdrowski S (2001) IEEE Trans Evol Comput 5(4):309–322

    Article  Google Scholar 

  5. Atiqullah MM, Rao SS (1993) Microelectron Reliab 33(9):1303–1319

    Article  Google Scholar 

  6. Bäck T (1996) Evolutionary algorithms in theory and practice. Oxford University Press, New York

    MATH  Google Scholar 

  7. Bäck T (2002) (ed) Handbook of evolutionary computation. Institute of Physics Publishing, Bristol

    Google Scholar 

  8. Bäck T, Fogel D, Michalewicz Z (2000) (eds) Evolutionary computation, Vols 1 and 2. Institute of Physics Publishing, Bristol

    Google Scholar 

  9. Beyer H-G, Schwefel H-P (2002) Nat Comput 1:3–52

    Article  MATH  MathSciNet  Google Scholar 

  10. Cancela H, Urquhart M (1995) Simulated annealing for communication network reliability improvement. In: Proceedings of the XXI Latin American conference on informatics (PANEL ’95). ACM Press, New York, pp 1413–1424

    Google Scholar 

  11. Chen Y, Li J, Chen J (1999) A new algorithm for network probabilistic connectivity. In: Proceedings of military communications conference (MILCOM ’99) Vol 2. Atlantic City, pp 920–923

    Google Scholar 

  12. Colbourn, CJ (1987) The combinatorics of network reliability. Oxford University Press, Oxford

    Google Scholar 

  13. Cortes P, Munuzuri J, Onieva L, Larraneta J, Vozmediano JM, Alarcon JC (2006) Interfaces 36(2):105–117

    Article  Google Scholar 

  14. Deeter D, Smith AE (1998) IIE Trans 30:1161–1174

    Google Scholar 

  15. Dengiz B, Altiparmak F, Smith AE (1997) IEEE Trans Reliab 46:18–26

    Article  Google Scholar 

  16. Dengiz B, Alabap C (2001) A simulated annealing algorithm for design of computer communication networks. In: Callaos N (ed): Proceedings of world multiconference on systemics, cybernetics and informatics, SCI 2001. IIIS, Orlando, pp 188–193

    Google Scholar 

  17. Erl T (2006) Service-oriented architecture: concepts, technology and design. 5. print. Prentice-Hall, Uppder Saddle River, NJ

    Google Scholar 

  18. Fard N, Lee T-H (2001) Comput Commun 24:1348–1353

    Article  Google Scholar 

  19. Flores SD, Cegla BB, Caceres DB (2003) Telecommunication network design with parallel multi-objective evolutionary algorithms. In: IFIP/ACM Latin America networking conference. ACM Press, New York, pp 1–11

    Chapter  Google Scholar 

  20. Fowler M (2006) Patterns of enterprise application architecture. 10. print. Addison-Wesley, Boston

    Google Scholar 

  21. Glover F, Lee M, Ryan J (1991) Ann Oper Res 33:351–362

    Article  MATH  Google Scholar 

  22. Ghosh L, Mukherjee A, Saha D (2002) Design of 1-FT communication network under budget constraint. In: IWDC ’02 Proceedings of the 4th international workshop on distributed computing, mobile and wireless computing. London, UK. Springer, Berlin Heidelberg New York, pp 300–311

    Google Scholar 

  23. Grötschel M, Monma CL, Stoer M (1995) Design of survivable networks. In: Ball, MO (ed) Network models. Elsevier, Amsterdam, pp 617–672

    Chapter  Google Scholar 

  24. Herdy M (1990) Application of the ‘evolutionsstrategie’ to discrete optimization problems. In: Schwefel H-P, Männer R (eds) Parallel problem solving from nature. Springer, Berlin Heidelberg New York, pp 188–192

    Google Scholar 

  25. Holland JH (1992) Adaptation in natural and artificial systems. 2. print. MIT, Cambridge/MA

    Google Scholar 

  26. Horowitz E, Sahni S (1983) Fundamentals of data structures. Computer Science Press, New York

    Google Scholar 

  27. Jan R-H (1993) Comput Oper Res 20(1):25–34

    Article  MATH  MathSciNet  Google Scholar 

  28. Jan R-H, Hwang F-J, Chen S-T (1993) IEEE Trans Reliab 42(1):63–70

    Article  MATH  Google Scholar 

  29. Kumar A, Pthak RM, Gupta YP, Parsaei HR (1995) Comput Ind Eng 28(3):659–670

    Article  Google Scholar 

  30. Li R, Emmerich MTM, Bovenkamp EGP, Eggermont J, Bäck T, Dijkstra J, Reiber JHC (2006) Mixed integer evolution strategies and their application to intravascular ultrasound image analysis. In: Rothlauf F (ed) Applications of evolutionary computation (LNCS 3907). Springer, Berlin Heidelberg New York, pp 415–426

    Chapter  Google Scholar 

  31. Liu B, Iwamura K (2000) Comput Math Appl 39:59–69

    Article  MATH  MathSciNet  Google Scholar 

  32. Michalewicz, Z (1999) Genetic algorithms + data structures = evolution programs. 3., corrected print. Springer, Berlin Heidelberg New York

    Google Scholar 

  33. Nissen V (1994) Solving the quadratic assignment problem with clues from nature. IEEE Trans Neural Netw 5(1):66–72

    Article  Google Scholar 

  34. Nissen V, Krause M (1994) Constrained combinatorial optimization with an evolution strategy. In: Reusch B (ed) Fuzzy Logik. Theorie und Praxis. Springer, Berlin Heidelberg New York, pp 33–40

    Google Scholar 

  35. Pierre S, Hyppolite M-A, Bourjolly J-M, Dioume O (1995) Topological design of computer communication networks using simulated annealing. Eng Appl Artif Intell 8(1):61–69

    Article  Google Scholar 

  36. Rechenberg I (1994) Evolutionsstrategie ’94. Frommann-Holzboog, Stuttgart

    Google Scholar 

  37. Reichelt D, Rothlauf F (2004) CURE: Eine Reparaturheuristik für die Planung ökonomischer und zuverlässiger Kommunikationsnetzwerke mit Hilfe von heuristischen Optimierungsverfahren. Working Paper 10/2004 (in German), University of Mannheim, Department of Business Administration and Information Systems

    Google Scholar 

  38. Reichelt D, Rothlauf F (2005) Int J Comput Intell Appl 5(2):251–266

    Article  MATH  Google Scholar 

  39. Reichelt D (2006) Kommunikationsnetzwerkplanung unter Kosten- und Zuverlässigkeitsgesichtspunkten mit Hilfe von evolutionären Algorithmen. (PhD-Diss.) http://www.db-thueringen.de/servlets/DocumentServlet?id=5635 (in German). Technical University of Ilmenau

  40. Rudolph G (1994) An Evolutionary algorithm for integer programming. In: Davidor Y, Schwefel H-P, Männer R (eds): Parallel problem solving from nature - PPSN III (LNCS 866). Springer, Berlin Heidelberg New York, pp 139–148

    Google Scholar 

  41. Schindler B, Rothlauf F, Pesch E (2002) Evolution strategies, network random keys, and the One-Max Tree problem. In: Applications of Evolutionary Computing: EvoWorkshops 2002 (LNCS 2279). Springer, Berlin Heidelberg New York, pp 29–40

    Google Scholar 

  42. Schwefel H-P (1995) Evolution and optimum seeking. Wiley, New York

    Google Scholar 

  43. Smith AE, Dengiz B (2000) Evolutionary methods for the design of reliable networks. In: Corne DW (ed): Telecommunications optimization: heuristic and adaptive techniques. Wiley, Chichester, pp 17–34

    Chapter  Google Scholar 

  44. Soni S, Narasimhan S, LeBlanc LJ (2004) Telecommunication access network design with reliability constraints. IEEE Trans Reliab 53(4):532–541

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Information Systems in Services, Technical University of Ilmenau, D-98684, Ilmenau, Germany

    Volker Nissen & Stefan Gold

Authors
  1. Volker Nissen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefan Gold
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CSIRO Land and Water, Clunies Ross Street, ACT 2901, Canberra, Australia

    Ang Yang

  2. Medicare Australia, ACT 2901, Canberra, Australia

    Yin Shan

  3. University of New South Wales, Northcott Drive, ACT 2600, Canberra, Australia

    Lam Thu Bui

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Nissen, V., Gold, S. (2008). Survivable Network Design with an Evolution Strategy. In: Yang, A., Shan, Y., Bui, L.T. (eds) Success in Evolutionary Computation. Studies in Computational Intelligence, vol 92. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76286-7_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-76286-7_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-76285-0

  • Online ISBN: 978-3-540-76286-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation