Modified imperialist competitive algorithm based on attraction and repulsion concepts for reliability-redundancy optimization

摘要

System reliability analysis and optimization are important to efficiently utilize available resources and to develop an optimal system design architecture. System reliability optimization has been solved by using optimization techniques including meta-heuristics. Meanwhile, the development of meta-heuristics has been an active research field of the reliability optimization wherein the redundancy, the component reliability, or both are to be determined. In recent years, a broad class of stochastic meta-heuristics, such as simulated annealing, genetic algorithm, tabu search, ant colony, and particle swarm optimization paradigms, has been developed for reliability-redundancy optimization of systems. Recently, a new kind of evolutionary algorithm called Imperialist Competitive Algorithm (ICA) was proposed. The ICA is based on imperialistic competition where the populations are represented by countries, which are classified as imperialists or colonies. However, the trade-off between the exploration (i.e. the global search) and the exploitation (i.e. the local search) of the search space is critical to the success of the classical ICA approach. An improvement in the ICA by implementing an attraction and repulsion concept during the search for better solutions, the AR-ICA approach, is proposed in this paper. Simulations results demonstrates the AR-ICA is an efficient optimization technique, since it obtained promising solutions for the reliability redundancy allocation problem when compared with the previously best-known results of four different benchmarks for the reliability-redundancy allocation problem presented in the literature.