Robust Redundancy Allocation by the Min-max Regret Framework and Sequential Two-stage Approach

To effectively and quickly solve the robust redundancy allocation problem under the Min-Max regret framework, a sequential two-stage approach is proposed. The proposed metaheuristic approach includes two stages: the first stage is to solve an optimization problem with regard to various scenarios, and the second stage is to search for the optimal solution of decision variables. These two stages are executed sequentially and iteratively until the preset termination condition is satisfied. The listed example demonstrates the performance of the proposed approach.