2007
DOI: 10.1109/ijcnn.2007.4371107
|View full text |Cite
|
Sign up to set email alerts
|

Automatic Calibration of Numerical Models using Fast Optimisation by Fitness Approximation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2009
2009
2019
2019

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(5 citation statements)
references
References 3 publications
0
5
0
Order By: Relevance
“…Additionally, a surrogate modeling approach [59] is applied in the GA tool to reduce the number of fitness/function evaluations during model implementation, decreasing the computational cost [60]. The surrogate approach uses a k-nearest neighbors (KNN) classifier [61] to approximate the fitness scores of some individual chromosomes based on their distance to the remaining chromosomes whose fitness scores are exactly evaluated by executing the fitness function.…”
Section: Calibration Of the Ca Parameters Using A Genetic Algorithmmentioning
confidence: 99%
“…Additionally, a surrogate modeling approach [59] is applied in the GA tool to reduce the number of fitness/function evaluations during model implementation, decreasing the computational cost [60]. The surrogate approach uses a k-nearest neighbors (KNN) classifier [61] to approximate the fitness scores of some individual chromosomes based on their distance to the remaining chromosomes whose fitness scores are exactly evaluated by executing the fitness function.…”
Section: Calibration Of the Ca Parameters Using A Genetic Algorithmmentioning
confidence: 99%
“…However, the evolutionary (genetic) algorithms are efficient enough to perform a robust solution search [15] in a complex parameter space with a lack of historical data for quality assessment [21]. The applicability of evolutionary algorithms for SWAN wave model calibration is demonstrated in [13].…”
Section: Related Workmentioning
confidence: 99%
“…The particle swarm optimisation and differential evolution are two efficient stochastic optimisation methods minimizing an objective function that can model the problem's objectives while incorporating constraints, and have three main advantages: global search regardless of the initial parameter values, fast convergence and a few control parameters. Both techniques have shown great promise in several real-world applications (Deb, 2001;Liu & Khu, 2007;Liu, 2009;Liu & Sun, 2011;Liu and Pender, 2012;Liu and Pender, 2013). Facts have proved that population based optimisations like GA, PSO and DE are suitable to handle complicated constrained optimisation problems (Coello Coello, 2002;Wang and Cai, 2012).…”
Section: Introductionmentioning
confidence: 99%