Non-Linear Threshold Algorithm for the Redundancy Optimization of Multi-State Systems

• Main Authors: Nabil Nahas, Mustapha Nourelfath
• Format: Article
• Language: English
• Published: International Journal of Mathematical, Engineering and Management Sciences 2021-02-01
• Series: International Journal of Mathematical, Engineering and Management Sciences
• Subjects: reliability; redundancy optimization; series-parallel systems; multi-state metaheuristics
• Online Access: https://www.ijmems.in/volumes/volume6/number1/26-IJMEMS-SBS19-31-6-1-416-441-2021.pdf

To improve system performance, redundancy is widely used in different kinds of industrial applications such as power systems, aerospace, electronic, telecommunications and manufacturing systems. Designing high performant systems which meet customer requirements with a minimum cost is a challenging task in these industries. This paper develops an efficient approach for the redundancy optimization problem of series-parallel structures modeled as multi-state systems. To reach the target system availability, redundancies are used for components among a list of products available in the market. Each component is characterized by its own availability, cost and performance. The goal is to minimize the total cost under a system availability constraint. Discrete levels of performance are considered for the system and its components. The extreme values of such performance levels correspond to perfect functioning and complete failure. A piecewise cumulative load curve represents consumer demand. System availability corresponds to the aptitude to fulfill this demand. The multi-state system availability evaluation uses the universal moment generating function technique. The proposed optimization algorithm is based on the non-linear threshold accepting metaheuristic, while using a self-adjusting penalty guided strategy. The obtained results demonstrate the approach efficiency for solving the redundancy optimization problem of multi-state systems. Its effectiveness is also tested using the classical redundancy optimization problem of binary-state systems. The algorithm is evaluated by comparison to the best known methods. For multi-state systems, it is compared to genetic algorithm and tabu search. For binary-state systems, it is compared to genetic algorithm, tabu search, ant colony optimization and harmony search. The obtained results demonstrate that the proposed approach outperforms these state-of-the-art benchmark methods in finding, for all considered instances, a high-quality solution in a minimum computational time.