2012
DOI: 10.1016/j.asoc.2012.07.020
|View full text |Cite
|
Sign up to set email alerts
|

Annealing-based particle swarm optimization to solve the redundant reliability problem with multiple component choices

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
13
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 27 publications
(13 citation statements)
references
References 24 publications
0
13
0
Order By: Relevance
“…(w 1 (t); w 2 (t)) = (j sin(2t=R)j; 1 w 1 (t)); (10) where t is tth sub-population (t = 1; 2; ; Ns) and R = 200. MOOPs are usually solved by scalarization (it means converting the problem with multiple objectives into a single objective or a family of single objective optimization problems).…”
Section: Evaluation Of the Combined Objectivementioning
confidence: 99%
See 1 more Smart Citation
“…(w 1 (t); w 2 (t)) = (j sin(2t=R)j; 1 w 1 (t)); (10) where t is tth sub-population (t = 1; 2; ; Ns) and R = 200. MOOPs are usually solved by scalarization (it means converting the problem with multiple objectives into a single objective or a family of single objective optimization problems).…”
Section: Evaluation Of the Combined Objectivementioning
confidence: 99%
“…After the rst article by Fy e et al [5], in which they studied the redundancy allocation problem in seriesparallel systems, a great number of researchers have tried to develop this knowledge. The investigations of Coelho [6], Zou et al [7], Ramirez-Marquez and Coit [8], Nahas et al [9], Safaei et al [10], Liang and Chen [11], Ha and Kuo [12], Soltani et al [13], Liang et al [14], Juang et al [15], Zhang et al [16], and Chambari et al [17] are of those investigations into the redundancy allocation problem in series-parallel systems. For more information about the redundancy allocation problems, readers are referred to a work by Soltani [18].…”
Section: Introductionmentioning
confidence: 99%
“…At present, the main metaheuristic algorithms for this problem are: genetic algorithm(GA) [2,3,4,5] immune algorithm(IA) [6,29], variable neighborhood search(VNS) [8], particle swarm optimization(PSO) [9,10,11,19], harmony search(HS) [12,13], ant colony optimization(ACO) [14], Tabu Search(TS) [15], imperialist competitive algorithm(ICA) [16],improved cuckoo search(ICS) algorithm [18] et al Recently, some researchers have proposed hybrid meta-heuristic algorithms by combining with two kinds of meta-heuristic methods to solve the reliability-redundancy allocation problem. Safaei et al [17] proposed particle swarm optimization algorithm based on simulated annealing (APSO). Wang & Li [31] proposed coevolution method based on differential evolution and harmony search(CDEHS).…”
Section: Introductionmentioning
confidence: 99%
“…Many researcher [2][3][4][5][6][7] use some algorithms to solve the problem of the reliability design of the series-parallel, complex (bridge) and overspeed protection system. Lately some mixed meta-heuristic method are put forward to solve the RRAP [8][9][10].…”
Section: Introductionmentioning
confidence: 99%