A practical approach for solving multi-objective reliability redundancy allocation problems using extended bare-bones particle swarm optimization

Enze Zhang

doi:10.1016/j.ress.2014.03.006

2014-07-01

PRE

Enze Zhang

Yifei Wu *

Qingwei Chen

DOI：10.1016/j.ress.2014.03.006

原文链接

原文求助

摘要

En 中文

This paper proposes a practical approach, combining bare-bones particle swarm optimization and sensitivity-based clustering for solving multi-objective reliability redundancy allocation problems (RAPs). A two-stage process is performed to identify promising solutions. Specifically, a new bare-bones multi-objective particle swarm optimization algorithm (BBMOPSO) is developed and applied in the first stage to identify a Pareto-optimal set. This algorithm mainly differs from other multi-objective particle swarm optimization algorithms in the parameter-free particle updating strategy, which is especially suitable for handling the complexity and nonlinearity of RAPs. Moreover, by utilizing an approach based on the adaptive grid to update the global particle leaders, a mutation operator to improve the exploration ability and an effective constraint handling strategy, the integrated BBMOPSO algorithm can generate excellent approximation of the true Pareto-optimal front for RAPs. This is followed by a data clustering technique based on difference sensitivity in the second stage to prune the obtained Pareto-optimal set and obtain a small, workable sized set of promising solutions for system implementation. Two illustrative examples are presented to show the feasibility and effectiveness of the proposed approach. (C) 2014 Elsevier Ltd. All rights reserved.

Keyword:

Reliability optimization

Multi-objective optimization

Particle swarm

Clustering analysis