Efficient optimization of all-terminal reliable networks, using an evolutionary approach

Creative Commons License

Dengiz B., Altiparmak F., Smith A.

IEEE TRANSACTIONS ON RELIABILITY, vol.46, no.1, pp.18-26, 1997 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 46 Issue: 1
  • Publication Date: 1997
  • Doi Number: 10.1109/24.589921
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.18-26
  • Keywords: network reliability, heuristic optimization, genetic algorithm, combinatorial optimization, communication network, Monte Carlo simulation, TOPOLOGICAL OPTIMIZATION, COMMUNICATION-NETWORKS, RELIABILITY EVALUATION, GENETIC ALGORITHMS, SYSTEM, DESIGN, SUBJECT
  • Gazi University Affiliated: Yes


The use of computer communication networks has been rapidly increasing in order to: 1) share expensive hardware & software resources, and 2) provide access to main systems from distant locations. The reliability & cost of these systems are important and are largely determined by network topology. Network topology consists of nodes and the links between nodes. The selection of optimal network topology is an NP-hard combinatorial problem so that the classical enumeration-based methods grow exponentially with network size. In this study, a heuristic search algorithm inspired by evolutionary methods is presented to solve the all-terminal network design problem when considering cost & reliability. The genetic algorithm heuristic is considerably enhanced over conventional implementations to improve effectiveness & efficiency. This general optimization approach is computationally efficient and highly effective on a large suite of test problems with search spaces up to 2.10(90).