A study of an iterated local search on the reliable communication networks design problem

Lecture Notes in Computer Science

Volumn 3449, Issue , 2005, Pages 156-165

  Reichelt, Dirk ^a   Gmilkowsky, Peter ^a   Linser, Sebastian ^a  

^a ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; GENETIC ALGORITHMS; ITERATIVE METHODS; PROBLEM SOLVING; RELIABILITY THEORY; SEARCH ENGINES;

ITERATED LOCAL SEARCH (ILS); LOCAL SEARCH (LS); NETWORK DESIGN PROBLEM; RELIABILITY CONSTRAINT;

TELECOMMUNICATION NETWORKS;

EID: 24644466093     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-32003-6_16     Document Type: Conference Paper

References (17)

1. Yunbin Chen, Jiandong Li, and Jiamo Chen. A new algorithm for network probabilistic connectivity. In Military Communications Conference Proceedings, volume 2, pages 920-923, 1999.
2. M. R. Garey and D. S. Johnson. Computers and Intractibility: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Fransisco, 1979.
3. Li Ying. Analysis method of survivability of probabilistic networks. Military Communication Technology Magazine, 48, 1993.
4. L.T.M. Berry, B.A. Murtagh, G. McMahon, S. Sudgen, and L. Welling. An integrated GA-LP approach to communication network design. Telecommunication Systems, 12:265-280, 1999.
5. Baoding Liu and K. Iwamura. Topological optimization model for communication network with multiple reliability goals. Computer and Mathematics with Applications, 39:59-69, 2000.
6. B. Dengiz and C. Alabap. A simulated annealing algorithm for design of computer communication networks. In Proceedings of World Multiconference on Systemics, Cybernetics and Informatics, SCI 2001, volume 5, 2001.
7. B. Fortz and M. Labbe. A tabu search heuristic for the design of two-connected networks with bounded rings. Working Paper 98/3, Universit Catholique de Louvain, 2002.
8. Dirk Reichelt, Franz Rothlauf, and Peter Gmilkowsky. Designing reliable communication networks with a genetic algorithm using a repair heuristic. In Proceedings 4th European Conference, EvoCOP 2004, pages 177-187. Springer, 2004.
9. B. Dengiz, F. Altiparmak, and A. E. Smith. Local search genetic algorithm for optimal design of reliable networks. IEEE Trans. on Evolutionary Computation, 1(3):179-188, 1997.
10. Darren Deeter and Alice E. Smith. Economic design of reliable networks. IIE Transactions, 30:1161-1174, 1998.
11. Benjamin Baran and Fabian Laufer. Topological optimization of reliable networks using a-teams. In Proceedings of World Multiconference on Systemics, Cybernetics and Informatics - SCI '99 and ISAS '99, volume 5, 1999.
12. S. Duarte and B. Barn. Multiobjective network design optimisation using parallel evolutionary algorithms. In Proceedings of XXVII Conferencia Latinoamericana de Informtica CLEI'2001, Merida, Venezuela, 2001.
13. K.K. Aggarwal and Suresh Rai. Reliability evaluation in computer-communication networks. IEEE Transactions on Reliability, 30(1):32-35, 1981.
14. E. Manzi, M. Labbe, G. Latouche, and F. Maffioli. Fishman's sampling plan for computing network reliability. IEEE Transactions on Reliability, 50(1):41-46, 2001.
15. A. Konak and A. Smith. An improved general upperbound for all-terminal network reliability, 1998.
16. Helena R. Loureno, Olivier C. Martin, and Thomas Stuetzle. Iterated local search. Economics Working Papers 513, Department of Economics and Business, Universitat Pompeu Fabra, November 2000.
17. M. Wall. Galib: A c++ library of genetic algorithm components, 1998.