Efficient optimization of reliable two-node connected networks: A biobjective approach

Abdullah Konak, Alice E. Smith

Research output: Contribution to journalArticle

8 Scopus citations

Abstract

This paper presents a biobjective genetic algorithm (GA) to design reliable two-node connected telecommunication networks. Because the exact calculation of the reliability of a network is NP-hard, network designers have been reluctant to use network reliability as a design criterion; however, it is clearly an important aspect. Herein, three methods of reliability assessment are developed: an exact reliability calculation method using factoring, an efficient Monte Carlo estimation procedure using the sequential construction technique and network reductions, and an upper bound for the all-terminal reliability of networks with arbitrary arc reliabilities. These three methods of reliability assessment are used collectively in a biobjective GA with specialized mutation operators that perturb solutions without disturbing two-node connectivity. Computational experiments show that the proposed approach is tractable and significantly improves upon the results found by single-objective heuristics.

Original languageEnglish (US)
Pages (from-to)430-445
Number of pages16
JournalINFORMS Journal on Computing
Volume23
Issue number3
DOIs
StatePublished - Jun 1 2011

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems
  • Computer Science Applications
  • Management Science and Operations Research

Cite this