1998
DOI: 10.1016/s0026-2714(98)00028-6
|View full text |Cite
|
Sign up to set email alerts
|

Genetic algorithms for reliability design problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
102
0

Year Published

2000
2000
2016
2016

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 152 publications
(102 citation statements)
references
References 22 publications
0
102
0
Order By: Relevance
“…To the best of the authors' knowledge, MINLP problems are generally solved by heuristic algorithms as an exhaustive search of the optimum solution is usually impractical. One of the most widely used algorithms is the so-called GA (Genetic Algorithm) [11] due to the following advantages: (i) the encoding scheme (binary or decimal encoding) in the GA leads to the flexibility to represent both continuous and discrete design variables; and (ii) the search in the solution space for optimal solutions can be very efficient due to the use of fitness evaluation and genetic operator functions. Although the GA is employed to solve the top-level RAP, the computational cost for function evaluations can be negligible since the system LCC and resilience are computed through the evaluation of analytic models.…”
Section: Genetic Algorithm As the Optimization Solution Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…To the best of the authors' knowledge, MINLP problems are generally solved by heuristic algorithms as an exhaustive search of the optimum solution is usually impractical. One of the most widely used algorithms is the so-called GA (Genetic Algorithm) [11] due to the following advantages: (i) the encoding scheme (binary or decimal encoding) in the GA leads to the flexibility to represent both continuous and discrete design variables; and (ii) the search in the solution space for optimal solutions can be very efficient due to the use of fitness evaluation and genetic operator functions. Although the GA is employed to solve the top-level RAP, the computational cost for function evaluations can be negligible since the system LCC and resilience are computed through the evaluation of analytic models.…”
Section: Genetic Algorithm As the Optimization Solution Methodsmentioning
confidence: 99%
“…This problem is a mixed-integer non-linear programming problem. It can be solved using a genetic algorithm [11], ant colony optimization [12], particle swarm optimization [13], or other optimization techniques. Solving this problem will be computationally economic since the system resilience function Ψ can be analytically expressed in terms of the target component reliability vector r t , the component-PHM efficiency vector λ t and the target component-redundancy vector m. The proposed RAP incorporates the PHM efficiency in design, where the reliability allocation can be considered as one special case in which PHM efficiencies for all components equal zero.…”
Section: Problem Formulationmentioning
confidence: 99%
See 1 more Smart Citation
“…In the local search, a random walk approach is applied for generating a new solution, as shown in formula (5) .…”
Section: Improved Bat Algorithm(iba)mentioning
confidence: 99%
“…A wide variety of meta-heuristic algorithms emerge. 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).…”
Section: Introductionmentioning
confidence: 99%