2021
DOI: 10.1016/j.swevo.2021.100875
|View full text |Cite
|
Sign up to set email alerts
|

Error analysis of elitist randomized search heuristics

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3
1

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(6 citation statements)
references
References 42 publications
0
6
0
Order By: Relevance
“…Dongwen Li et al [44] proposed a combined model based on RSM-XGBoost and KF algorithm to study the remaining life prediction problem of an aircraft engine, and solved the noise influence problem by adding a Carr filter to achieve higher life prediction accuracy. Cong Wang et al [45] worked on analyzing the elite RSH by estimating the desired approximation error. Based on the distribution of non-zero elements in the Markov chain transfer matrix, the search process of the elite RSH was classified into three categories, and a general framework for estimating the approximation error, called error analysis, was proposed.…”
Section: Diagnostic Methods Accuracymentioning
confidence: 99%
“…Dongwen Li et al [44] proposed a combined model based on RSM-XGBoost and KF algorithm to study the remaining life prediction problem of an aircraft engine, and solved the noise influence problem by adding a Carr filter to achieve higher life prediction accuracy. Cong Wang et al [45] worked on analyzing the elite RSH by estimating the desired approximation error. Based on the distribution of non-zero elements in the Markov chain transfer matrix, the search process of the elite RSH was classified into three categories, and a general framework for estimating the approximation error, called error analysis, was proposed.…”
Section: Diagnostic Methods Accuracymentioning
confidence: 99%
“…Nallaperuma et al [42] considered the well-known traveling salesperson problem (TSP) and derived the lower bounds of the expected fitness gain for a specified number of generations. Based on the Markov chain model of RSHs, Wang et al [29] constructed a general framework of FBA, by which they found the analytic expression of approximation error instead of asymptotic results of expected fitness values. Doerr et al [43] built a bridge between runtime analysis and FBA, by which a huge body of work and a large collection of tools for the analysis of the expected optimization time could meet the new challenges introduced by the new fixed-budget perspective.…”
Section: Fixed-budget Analysis and Approximation Errormentioning
confidence: 99%
“…Due to this reason, optimization time is seldom used in computer simulation for evaluating the performance of EAs, and their performance is evaluated after running finite generations by solution quality such as the mean and median of the fitness value or approximation error [26]. In theory, solution quality can be measured for a given iteration budget by the expected fitness value [27] or approximation error [28,29], which contributes to the analysis framework named fixed-budget analysis (FBA). An FBA on immune-inspired hypermutations led to theoretical results that are very different from those of runtime analysis but consistent with the empirical results, which demonstrates that the perspective of fixed-budget computations provides valuable information and additional insights for the performance of randomized search heuristics [30].…”
Section: Introductionmentioning
confidence: 99%
“…One can get full information of RSHs from the transition Matrix R, however, it does not display performances of RSHs in an intuitive way. Thus, we take the expected approximation error (EAE) and the tail probability (TP) as the evaluate metrics for performance comparison of RSHs [21], [22].…”
Section: Performance Metricsmentioning
confidence: 99%
“…For the OneMax problem,outperformance of the (1 + 1)EA C over the (1 + 1)EA and (1 + 1)EA CM is based on the following lemma [22].…”
Section: Influence Of the Binomial Crossover On Performances On The O...mentioning
confidence: 99%