A new multi‐objective particle swarm optimization method for solving reliability redundancy allocation problems

In this paper, a new dynamic self‐adaptive multi‐objective particle swarm optimization (DSAMOPSO) method is proposed to solve binary‐state multi‐objective reliability redundancy allocation problems (MORAPs). A combination of penalty function and modification strategies is used to handle the constraints in the MORAPs. A dynamic self‐adaptive penalty function strategy is utilized to handle the constraints. A heuristic cost‐benefit ratio is also supplied to modify the structure of violated swarms. An adaptive survey is conducted using several test problems to illustrate the performance of the proposed DSAMOPSO method. An efficient version of the epsilon‐constraint (AUGMECON) method, a modified non‐dominated sorting genetic algorithm (NSGA‐II) method, and a customized time‐variant multi‐objective particle swarm optimization (cTV‐MOPSO) method are used to generate non‐dominated solutions for the test problems. Several properties of the DSAMOPSO method, such as fast‐ranking, evolutionary‐based operators, elitism, crowding distance, dynamic parameter tuning, and tournament global best selection, improved the best known solutions of the benchmark cases of the MORAP. Moreover, different accuracy and diversity metrics illustrated the relative preference of the DSAMOPSO method over the competing approaches in the literature.