An approximate method of overall reliability by means of subgraph intensive inducted into Graph-Parting performed by Genetic Algorithm

Abstract

The conventional calculation methods of road network reliability using Boolean Algebra are impractical for a large system because the path sets and cut sets include a large number of elements.
In this paper, we propose an approximate calculation method to evaluate overall network reliability, defined as the probability that there exists at least one path between every pair of nodes in road networks.
This method is able to easily evaluate by means of subgraph intensive included into Graph-Parting performed by Genetic Algorithm. This approximate method is applied to some artificial networks in order to compare with the conventional methods.