Skip to main content
Springer Nature Link
Log in

A Study of an Iterated Local Search on the Reliable Communication Networks Design Problem

  • Conference paper
Applications of Evolutionary Computing (EvoWorkshops 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3449))

Included in the following conference series:

Abstract

The reliability of network topologies is an important key issue for business success. This paper investigates the reliable communication network design problem using an iterated local search (ILS) method. This paper demonstrates how the concepts of local search (LS) and iterated local search can be applied to this design problem. A new neighborhood move that finds cheaper networks without violating the reliability constraint is proposed. Empirical results show that the ILS method is more efficient than a genetic algorithm.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Chen, Y., Li, J., Chen, J.: A new algorithm for network probabilistic connectivity. In: Military Communications Conference Proceedings, vol. 2, pp. 920–923 (1999)

    Google Scholar 

  2. 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)

    MATH  Google Scholar 

  3. Ying, L.: Analysis method of survivability of probabilistic networks. Military Communication Technology Magazine 48 (1993)

    Google Scholar 

  4. Berry, L.T.M., Murtagh, B.A., McMahon, G., Sudgen, S., Welling, L.: An integrated GA-LP approach to communication network design. Telecommunication Systems 12, 265–280 (1999)

    Article  Google Scholar 

  5. Liu, B., Iwamura, K.: Topological optimization model for communication network with multiple reliability goals. Computer and Mathematics with Applications 39, 59–69 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  6. Dengiz, B., Alabap, 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)

    Google Scholar 

  7. Fortz, B., Labbe, M.: A tabu search heuristic for the design of two-connected networks with bounded rings. Working Paper 98/3, Université Catholique de Louvain (2002)

    Google Scholar 

  8. Reichelt, D., Rothlauf, F., Gmilkowsky, P.: Designing reliable communication networks with a genetic algorithm using a repair heuristic. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2004. LNCS, vol. 3004, pp. 177–187. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  9. 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)

    Article  Google Scholar 

  10. Deeter, D., Smith, A.E.: Economic design of reliable networks. IIE Transactions 30, 1161–1174 (1998)

    Google Scholar 

  11. 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)

    Google Scholar 

  12. Duarte, S., Barán, B.: Multiobjective network design optimisation using parallel evolutionary algorithms. In: Proccedings of XXVII Conferencia Latinoamericana de Informática CLEI 2001, Merida, Venezuela (2001)

    Google Scholar 

  13. Aggarwal, K.K., Rai, S.: Reliability evaluation in computer-communication networks. IEEE Transactions on Reliability 30(1), 32–35 (1981)

    Article  MATH  Google Scholar 

  14. Manzi, E., Labbe, M., Latouche, G., Maffioli, F.: Fishman’s sampling plan for computing network reliability. IEEE Transactions on Reliability 50(1), 41–46 (2001)

    Article  Google Scholar 

  15. Konak, A., Smith, A.: An improved general upperbound for all-terminal network reliability (1998)

    Google Scholar 

  16. Lourenço, H.R., Martin, O.C., Stuetzle, T.: Iterated local search. Economics Working Papers 513, Department of Economics and Business, Universitat Pompeu Fabra (November 2000)

    Google Scholar 

  17. Wall, M.: Galib: A c++ library of genetic algorithm components (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Information Systems, Ilmenau Technical University, Helmholtzplatz 3, P.O. Box 100565, 98684, Ilmenau, Germany

    Dirk Reichelt, Peter Gmilkowsky & Sebastian Linser

Authors
  1. Dirk Reichelt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Gmilkowsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sebastian Linser
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Johannes Gutenberg University, Mainz, Germany

    Franz Rothlauf

  2. Institute AIFB, University of Karlsruhe, 76128, Karlsruhe, Germany

    Jürgen Branke

  3. Dipartimento di Ingegneria dell’Informazione, Università di Parma,  

    Stefano Cagnoni

  4. School of Mathematical and Computer Science, Heriot-Watt University, EH14 8AS, Edinburgh, UK

    David Wolfe Corne

  5. Institute of Computer Science, University of Bremen, 28359, Bremen, Germany

    Rolf Drechsler

  6. Honda Research Institute Europe GmbH, Offenbach/Main, Germany

    Yaochu Jin

  7. CISUC, Department of Informatics Engineering, University of Coimbra, Polo II of the University of Coimbra, 3030, Coimbra, Portugal

    Penousal Machado

  8. ICIS, Radboud University Nijmegen, The Netherlands

    Elena Marchiori

  9. Universidade de A Coruña, CP 15071, A Coruña, Spain

    Juan Romero

  10. School of Computing Sciences, University of East Anglia, UEA Norwich, NR4 7TJ, Norwich, UK

    George D. Smith

  11. Dipartimento di Automatica e Informatica, Politecnico di Torino, Italy

    Giovanni Squillero

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reichelt, D., Gmilkowsky, P., Linser, S. (2005). A Study of an Iterated Local Search on the Reliable Communication Networks Design Problem. In: Rothlauf, F., et al. Applications of Evolutionary Computing. EvoWorkshops 2005. Lecture Notes in Computer Science, vol 3449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32003-6_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-32003-6_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25396-9

  • Online ISBN: 978-3-540-32003-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics