The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Performance Evaluation of an Advanced Local Search Evolutionary Algorithm
Abstract
One natural question when testing performance of global optimization algorithm is: how performances compare to a restart local search algorithm. One purpose of this paper is to provide results for such comparisons. To this end, the performances of a restart (advanced) local-search strategy, the CMA-ES with small initial step-size, are investigated on the 25 functions of the CEC 2005 real-parameter optimization test suit. The second aim is to clarify the theoretical background of the performance criterion proposed to quantitatively compare the search algorithms. The theoretical analysis allows us to generalize the criterion proposed and to define a new criterion that can be applied more appropriate in a different context.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Completely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397
Self-citation(2005) · Cited by 2,565
Hansen, N., & Ostermeier, A. (2002) · Proceedings of IEEE International Conference on Evolutionary Computation · doi:10.1109/icec.1996.542381 · Cited by 1,106
Self-citationA Restart CMA Evolution Strategy With Increasing Population Size
Auger, A., & Hansen, N. (2005) · 2005 IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2005.1554902 · Cited by 952
Self-citationEvaluating the CMA Evolution Strategy on Multimodal Test Functions
Hansen, N., & Kern, S. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30217-9_29 · Cited by 758
Self-citationInvariance, Self-Adaptation and Correlated Mutations in Evolution Strategies
Hansen, N. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45356-3_35 · Cited by 61
Self-citationQualms Regarding the Optimality of Cumulative Path Length Control in CSA/CMA-Evolution Strategies
Beyer, H.-G., & Arnold, D. V. (2003) · Evolutionary Computation · doi:10.1162/106365603321828989 · Cited by 41
Cited by
García, S., Molina, D., Lozano, M., & Herrera, F. (2009) · Journal of Heuristics · doi:10.1007/s10732-008-9080-4 · Cited by 1,719
A Restart CMA Evolution Strategy With Increasing Population Size
Auger, A., & Hansen, N. (2005) · 2005 IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2005.1554902 · Cited by 952
Self-citationOrthogonal Learning Particle Swarm Optimization
Zhan, Z.-H., Zhang, J., Li, Y., & Shi, Y.-H. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2052054 · Cited by 725
COCO: a platform for comparing continuous optimizers in a black-box setting
Hansen, N., Auger, A., Ros, R., Mersmann, O., Tušar, T., & Brockhoff, D. (2021) · Optimization Methods and Software · doi:10.1080/10556788.2020.1808977 · Cited by 408
Self-citationSeeking Multiple Solutions: An Updated Survey on Niching Methods and Their Applications
Li, X., Epitropakis, M. G., Deb, K., & Engelbrecht, A. (2017) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2638437 · Cited by 339
Metadata
- Authors
- Auger, A., & Hansen, N.
- Venue
- 2005 IEEE Congress on Evolutionary Computation
- Publisher
- IEEE
- Published
- 2005-12-13
- Volume
- 2
- Pages
- 1777-1784
- OpenAlex
- W2099087967
- Cited by
- 284
- References
- 7
- FWCI
- 5.96
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.