Multi-objective optimization of a series–parallel system using GPSIA

The optimal solution of a multi-objective optimization problem (MOP) corresponds to a Pareto set that is characterized by a tradeoff between objectives. Genetic Pareto Set Identification Algorithm (GPSIA) proposed for reliability-redundant MOPs is a hybrid technique which combines genetic and heuris...

Full description

Saved in:
Bibliographic Details
Published inReliability engineering & system safety Vol. 103; pp. 61 - 71
Main Authors Okafor, Ekene Gabriel, Sun, You-Chao
Format Journal Article
LanguageEnglish
Published Oxford Elsevier Ltd 01.07.2012
Elsevier
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:The optimal solution of a multi-objective optimization problem (MOP) corresponds to a Pareto set that is characterized by a tradeoff between objectives. Genetic Pareto Set Identification Algorithm (GPSIA) proposed for reliability-redundant MOPs is a hybrid technique which combines genetic and heuristic principles to generate non-dominated solutions. Series–parallel system with active redundancy is studied in this paper. Reliability and cost were the research objective functions subject to cost and weight constraints. The results reveal an evenly distributed non-dominated front. The distances between successive Pareto points were used to evaluate the general performance of the method. Plots were also used to show the computational results for the type of system studied and the robustness of the technique is discussed in comparison with NSGA-II and SPEA-2.
ISSN:0951-8320
1879-0836
DOI:10.1016/j.ress.2012.03.014