.png){kind=icon}
返回
A new multi-objective particle swarm optimization method for solving reliability redundancy allocation problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ress.2012.10.009.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (C) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Multi-objective redundancy allocation problem
Meta-heuristics
Dynamic self-adaptive multi-objective particle swarm optimization
epsilon-constraint method
NSGA-II
期刊
R
IF:
11
论文数:
9.0K
被引数:
4.2W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏An efficient particle swarm approach for mixed-integer programming in reliability-redundancy optimization applications可靠性冗余优化应用中混合整数规划的有效粒子群方法
PREAI
分享收藏
Multi-Objective Particle Swarm Optimization with time variant inertia and acceleration coefficients
PREAI
分享收藏Effective implementation of the ε-constraint method in Multi-Objective Mathematical Programming problems多目标数学规划问题中 ε 约束方法的有效实现
PREAI
分享收藏
查看更多内容