2010
DOI: 10.1109/tevc.2010.2046666
|View full text |Cite
|
Sign up to set email alerts
|

An Evolutionary Computing Approach to Robust Design in the Presence of Uncertainties

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 24 publications
(11 citation statements)
references
References 21 publications
0
11
0
Order By: Relevance
“…To find the best match, a genetic algorithm [13] with Conjugate Gradient Method [14] was implemented. In the first phase, the algorithm finds a rough estimation of the parameters by modifying the values in P k matrix (within given boundaries), and then solution error is further minimized by Conjugate Gradient Method.…”
Section: Resultsmentioning
confidence: 99%
“…To find the best match, a genetic algorithm [13] with Conjugate Gradient Method [14] was implemented. In the first phase, the algorithm finds a rough estimation of the parameters by modifying the values in P k matrix (within given boundaries), and then solution error is further minimized by Conjugate Gradient Method.…”
Section: Resultsmentioning
confidence: 99%
“…The p ij parameters were grouped as a P i matrix: Pk=[pnormal11pnormal21pnormal31pnormal12pnormal22pnormal32pnormal13pnormal23pnormal33],kN. The best fit was found by minimizing the difference between the real function f r and f p function modifying the P i matrix for given i value and Gaussian/Lorentz functions: mink(x=normal1N[fr(x)fp(x,Pk)]2). Boundary values were defined as for p j 1 , j = 1 ⋯ i parameters; the maximal signal value multiplied by a number of functions was defined for p j 2 , j = 1 ⋯ i parameters, which defines the position of function centers and should not exceed the analyzed interval (−5, 5) and p j 3 , j = 1 ⋯ i parameters to (0, 30) according to Gaussian and Lorentz functions requirements. To find the best match, the genetic algorithm [14] with Conjugate Gradient Method [15] was implemented. In the first phase, the algorithm finds a rough estimation of the parameters by modifying the values in P i matrix within given boundaries and then, for best 10 solutions, the Conjugate Gradient Method is executed to minimize the solution error.…”
Section: Methodsmentioning
confidence: 99%
“…The crossover is performed by a simple averaging of two samples. The probability of moving to the next epoch is based on the fitness function proposed by Chan and Sudhoff [14]. …”
Section: Methodsmentioning
confidence: 99%
“…It is very likely that the data is ill-distributed, imbalanced [57], incomplete [58], [59], and is contaminated by noise [60], [61]. In some cases, search for robust optimal solutions will be of great practical significance [62], [63].…”
Section: Challengesmentioning
confidence: 99%