Recognition problems for special classes of polynomials in 0-1 variables
Mathematical Programming: Series A and B
An Approach to the Reliability Optimization of Software with Redundancy
IEEE Transactions on Software Engineering
Optimization Models for Reliability of Modular Software Systems
IEEE Transactions on Software Engineering - Special issue on software reliability
Scatter search and path relinking
New ideas in optimization
Tabu Search
IBM Journal of Research and Development
Generating test data for both paths coverage and faults detection using genetic algorithms
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing Theories and Applications: with aspects of artificial intelligence
A tabu search meta-heuristic approach to the dual response systems problem
Expert Systems with Applications: An International Journal
Generating test data for both path coverage and fault detection using genetic algorithms
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.01 |
This paper presents a new metaheuristic-based algorithm for complex reliability problems. The algorithm effectively uses features of the Tabu Search paradigm, with special emphasis on the exploitation of memory-based mechanisms. It balances intensification with diversification via the use of short-term and long-term memory. The algorithm has been thoroughly tested on benchmark problems from the literature as well as on a pool of random generated instances of very large scale software systems. The proposed algorithm proves to be robust with respect to its parameters and it is especially suited for very large scale instances of the reliability problem, when exact approaches are doomed to fail.