A Particle Swarm Optimization Approach Based on Monte Carlo Simulation for Solving the Complex Network Reliability Problem

Reliability optimization has been a popular area of research, and received significant attention due to the critical importance of reliability in various kinds of systems. Most network reliability optimization problems are only focused on solving simple structured networks (e.g., series-parallel net...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on reliability Vol. 59; no. 1; pp. 212 - 221
Main Authors Yeh, Wei-Chang, Lin, Yi-Cheng, Chung, Yuk Ying, Chih, Mingchang
Format Journal Article
LanguageEnglish
Published New York IEEE 01.03.2010
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Reliability optimization has been a popular area of research, and received significant attention due to the critical importance of reliability in various kinds of systems. Most network reliability optimization problems are only focused on solving simple structured networks (e.g., series-parallel networks) of which the reliability function can be easily obtained in advance. However, modern networks are usually very complex, and it is impossible to calculate the exact network reliability function by using traditional analytical methods in limited time. Hence, a new particle swarm optimization (PSO) based on Monte Carlo simulation (MCS), named MCS-PSO, has been proposed to solve complex network reliability optimization problems. The proposed MCS-PSO can minimize cost under reliability constraints. To the best of our knowledge, this is the first attempt to use PSO combined with MCS to solve complex network reliability problems without requiring knowledge of the reliability function in advance. Compared with previous works to solve this problem, the proposed MCS-PSO can have better efficiency by providing a better solution to the complex network reliability optimization problem.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9529
1558-1721
DOI:10.1109/TR.2009.2035796