2004
DOI: 10.1016/j.engappai.2004.04.007
|View full text |Cite
|
Sign up to set email alerts
|

Optimization and defect identification using distributed evolutionary algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
21
0

Year Published

2006
2006
2018
2018

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 46 publications
(21 citation statements)
references
References 6 publications
0
21
0
Order By: Relevance
“…. ., is followed arbitrarily closely by the trajectory of the SGA population, in the sense of inequality (11). Moreover, we may conclude that the trajectory of heuristic iterations represents the maximum search ability performed by the infinite µ → +∞ population among all SGA searches represented by the same heuristic H. Further, if the heuristic H is focusing (see Definition 3), then we may infer that its fixed points represent the limit search possibility of the aforementioned class of search algorithms.…”
Section: Definition 3 Heuristic H Is Focusing Ifmentioning
confidence: 99%
See 1 more Smart Citation
“…. ., is followed arbitrarily closely by the trajectory of the SGA population, in the sense of inequality (11). Moreover, we may conclude that the trajectory of heuristic iterations represents the maximum search ability performed by the infinite µ → +∞ population among all SGA searches represented by the same heuristic H. Further, if the heuristic H is focusing (see Definition 3), then we may infer that its fixed points represent the limit search possibility of the aforementioned class of search algorithms.…”
Section: Definition 3 Heuristic H Is Focusing Ifmentioning
confidence: 99%
“…One possibility is to use stochastic metaheuristics, which are solution methods that orchestrate an interaction between local improvement procedures and higher-level strategies to create a process capable of escaping from local optima and performing a robust search of a solution space [25,37,39]. Among metaheuristic search strategies, we highlight evolutionary algorithms (EAs; we point the reader to the works of Burczyński and Beluch [10], Burczyński et al [11], and Meruane and Heylen [36] for some examples of using EAs to solve inverse problems). Our particular interest is devoted to EAs that can handle misfit multimodality, such as niching and sequential niching strategies (see, e.g., the work of Mahfoud [35]), Hierarchic Genetic Strategy HGS [5,7,24,29,30,62], and adaptive, stochastic multi-start method (see, e.g., the work of Telega et al [76]).…”
Section: Introductionmentioning
confidence: 99%
“…In [12,13,75], the population is divided into several subpopulations, which run on different master processors and communicate in some specific time. For each subpopulation, the master sends the individual evaluation tasks to its own slave processors so as to further improve parallelization grain.…”
Section: Hierarchical Modelmentioning
confidence: 99%
“…acoustic emission (Rogers, 2005), X-rays (Shinoba et al, 2004), eddy current (Gros, 1995), ultrasonography (Zhang et al, 2004), magnetic field (Lee et al, 2004) or soft computing methods such as artificial neural networks (Waszczyszyn and Ziemiań-ski, 2001) and evolutionary algorithms (Burczyński et al, 2004). The traditional approach, based on the analysis of natural frequencies (Dems and Mróz, 2001) and modal shapes of structure vibrations (Ostachowicz and Kaczmarczyk, 2001), is still used and further developed.…”
Section: Introductionmentioning
confidence: 99%