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

被引：85

作者：

Dengiz, B ^{[1
]}

Altiparmak, F ^{[1
]}

Smith, AE ^{[1
]}

机构：

[1] UNIV PITTSBURGH,DEPT IND ENGN,PITTSBURGH,PA 15261

来源：

IEEE TRANSACTIONS ON RELIABILITY | 1997年 / 46卷 / 01期

基金：

美国国家科学基金会;

关键词：

network reliability; heuristic optimization; genetic algorithm; combinatorial optimization; communication network; Monte Carlo simulation;

D O I：

10.1109/24.589921

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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

引用

页码：18 / 26

页数：9

共 31 条

[1] RELIABILITY EVALUATION BY NETWORK DECOMPOSITION [J].