Logo image
Monte Carlo Simulation and Particle Swarm Optimization for Evaluating Binary State Network Reliability
Thesis

Monte Carlo Simulation and Particle Swarm Optimization for Evaluating Binary State Network Reliability

Lin Yi-Cheng
Masters, 國立清華大學, 工業工程與工程管理學系
2007

Abstract

網路可靠度 蒙地卡羅模擬法 最小路徑 最小切割 粒子群演算法 Network reliability Monte-Carlo Simulation Minimal Path Minimal Cut Particle swarm optimization
Network reliability is very important for the decision support information. Monte Carlo Simulation (MCS) is one of the optimal algorithms to estimate the network reliability for different kinds of network configuration. This thesis has compared and analyzed three Monte Carlo simulation (MCS) methods for estimating the two-terminal network reliability of a binary-state network: (1) MCS1 simulates the network reliability in terms of known MPs, (2) MCS2 estimates the network reliability in terms of known MCs; and (3) MCS3 estimates the network reliability directly without knowing any information of MPs or MCs. Our simulation results show that the direct estimation without knowing any information of MPs or MCs can speedup about 195 times when compared with other traditional approaches which require MPs or MCs information. In addition, we also combine particle swarm optimization (PSO) and MCS to solve cost minimization problem under reliability constraints. Compared with previous works to solve this problem, the result of PSO combine with MCS can get the better solution.

Metrics

1 Record Views

Details

Logo image