Ho Tat Lam
ABSTRACT
Reliability is one of the important measures of how well a system meets its design objective, and mathematically is the probability that a system will perform satisfactorily for a given period of time. When the system is described by a network of N components (nodes) and L connections (links), the reliability of the system becomes a network design problem that is an NP-hard combinatorial optimization problem. In this paper, genetic algorithm is applied to find the most reliable connected network with the same connectivity, (i.e. with given N and L). The accuracy and efficiency of genetic algorithm in the search of the most reliable network(s) of same connectivity is verified by exhaustive search. Our results not only demonstrate the efficiency of our algorithm for optimization problem for graphs, but also suggest that the most reliable network will have high symmetry.
- Francisco J. Samaniego, System signatures and their applications in engineering reliability, Boston, MA: Springer Science+Business Media, LLC, 2007.Google Scholar
- Kuo, W., Prasad, V. R., Tillman, F. A., Hwang, C.: Optimal Reliability Design, Cambridge University Press, Cambridge, MA (2001).Google Scholar
- Colbourn, C. J.: The Combinatorics of Network Reliability. Oxford University Press, Oxford (1987). Google ScholarDigital Library
- Garey, M. R. and Johnson, D. S. (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Co.. San Francisco, CA. Google ScholarDigital Library
- Aggamal, K. K. and Rai, S. (1981) Reliability evaluation in computer communication networks. IEEE Transactions on Reliability, R-30, 32--35.Google Scholar
Index Terms
- Search for the most reliable network of fixed connectivity using genetic algorithm
Recommendations
Network structure optimization: genetic operators: mutation and crossover
ICUIMC '13: Proceedings of the 7th International Conference on Ubiquitous Information Management and CommunicationGenetic algorithms are applicable solution for network structure optimization. It lets us obtain good results within acceptable periods of time. In this paper we present several ways of using such genetic operators as mutation and crossover for solving ...
An improved genetic algorithm with conditional genetic operators and its application to set-covering problem
The genetic algorithm (GA) is a popular, biologically inspired optimization method. However, in the GA there is no rule of thumb to design the GA operators and select GA parameters. Instead, trial-and-error has to be applied. In this paper we present an ...
Hybrid Taguchi-genetic algorithm for global numerical optimization
In this paper, a hybrid Taguchi-genetic algorithm (HTGA) is proposed to solve global numerical optimization problems with continuous variables. The HTGA combines the traditional genetic algorithm (TGA), which has a powerful global exploration capability,...
Comments