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

Abdullah Konak, Alice E. Smith

Research output: Contribution to journalArticle

5 Citations (Scopus)

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

Genetic algorithms
Node
Telecommunication networks
Mathematical operators
Experiments
Genetic algorithm
Factoring
Calculation method
Telecommunication network
NP-hard
Heuristics
Network reliability
Upper bound
Experiment
Mutation
Operator
Connectivity

All Science Journal Classification (ASJC) codes

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

Cite this

@article{f8c65121654e4d179f9b038088f5b206,
title = "Efficient optimization of reliable two-node connected networks: A biobjective approach",
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.",
author = "Abdullah Konak and Smith, {Alice E.}",
year = "2011",
month = "6",
day = "1",
doi = "10.1287/ijoc.1100.0409",
language = "English (US)",
volume = "23",
pages = "430--445",
journal = "ORSA journal on computing",
issn = "1091-9856",
publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",
number = "3",

}

Efficient optimization of reliable two-node connected networks : A biobjective approach. / Konak, Abdullah; Smith, Alice E.

In: INFORMS Journal on Computing, Vol. 23, No. 3, 01.06.2011, p. 430-445.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Efficient optimization of reliable two-node connected networks

T2 - A biobjective approach

AU - Konak, Abdullah

AU - Smith, Alice E.

PY - 2011/6/1

Y1 - 2011/6/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=79961085100&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79961085100&partnerID=8YFLogxK

U2 - 10.1287/ijoc.1100.0409

DO - 10.1287/ijoc.1100.0409

M3 - Article

AN - SCOPUS:79961085100

VL - 23

SP - 430

EP - 445

JO - ORSA journal on computing

JF - ORSA journal on computing

SN - 1091-9856

IS - 3

ER -