PardeepKumar
The system capacity of a flow network is the maximum flow from source to destination and is deterministic. If all the arcs and nodes of any network have a number of possible capacities and may fail then the probability that the maximum flow of a commodity is either greater or equal to a given demand is an important performance measure of the quality of such networks. The paper presents a continuous genetic algorithm to evaluate the reliability of such a multicommodity stochastic-flow network under budget constraints. The algorithm is based on generating all minimal capacity vectors satisfying the given demand and budget constraints, the system reliability is determined in terms of the minimal capacity vectors. The proposed algorithm can be easily applied to larger networks due to its better temporal efficiency.
English 
Spanish 
Chinese 
Russian 
German 
French 
Japanese 
Portuguese 
Hindi