The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Self-Adaptive Multimethod Search for Global Optimization in Real-Parameter Spaces
Abstract
Many different algorithms have been developed in the last few decades for solving complex real-world search and optimization problems. The main focus in this research has been on the development of a single universal genetic operator for population evolution that is always efficient for a diverse set of optimization problems. In this paper, we argue that significant advances to the field of evolutionary computation can be made if we embrace a concept of self-adaptive multimethod optimization in which multiple different search algorithms are run concurrently, and learn from each other through information exchange using a common population of points. We present an evolutionary algorithm, entitled A Multialgorithm Genetically Adaptive Method for Single Objective Optimization (AMALGAM-SO), that implements this concept of self adaptive multimethod search. This method simultaneously merges the strengths of the covariance matrix adaptation (CMA) evolution strategy, genetic algorithm (GA), and particle swarm optimizer (PSO) for population evolution and implements a self-adaptive learning strategy to automatically tune the number of offspring these three individual algorithms are allowed to contribute during each generation. Benchmark results in 10, 30, and 50 dimensions using synthetic functions from the special session on real-parameter optimization of CEC 2005 show that AMALGAM-SO obtains similar efficiencies as existing algorithms on relatively simple unimodal problems, but is superior for more complex higher dimensional multimodal optimization problems. The new search method scales well with increasing number of dimensions, converges in the close proximity of the global minimum for functions with noise induced multimodality, and is designed to take full advantage of the power of distributed computer networks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
Multi-Objective Optimization Using Evolutionary Algorithms
Deb, K., & Kalyanmoy, D. (2001) · Andalas University Repository (Andalas University) · Cited by 17,326
A new optimizer using particle swarm theory
Eberhart, R., & Kennedy, J. (2002) · MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science · doi:10.1109/mhs.1995.494215 · Cited by 16,067 · cited 2×
“In this context, four different approaches have found widespread use: i) self-adaptive evolution strategies [3], [19], [34]; ii) real-parameter genetic algorithms [10], [11], [24]; iii) differential evolution methods [37]; and iv) particle swarm optimization (PSO) algorithms [13], [26].”
BackgroundMethodNo free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
(2019) · Handbook of Machine Learning · doi:10.1142/9789811205675_0004 · Cited by 6,270
Completely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397
Price, K. V. (2004) · Cited by 3,344
Handbook of Evolutionary Computation
(1997) · Institute of Physics eBooks · doi:10.1887/0750308958 · Cited by 2,990
Cited by
Modeling Soil Processes: Review, Key Challenges, and New Perspectives
Vereecken, H., Schnepf, A., Hopmans, J. W., Javaux, M., Or, D., Roose, T., Vanderborght, J., Young, M. H., Amelung, W., Aitkenhead, M., et al. (2016) · Vadose Zone Journal · doi:10.2136/vzj2015.09.0131 · Cited by 833
Self-citationBorg: An Auto-Adaptive Many-Objective Evolutionary Computing Framework
Hadka, D., & Reed, P. (2013) · Evolutionary Computation · doi:10.1162/evco_a_00075 · Cited by 717
Maier, H. R., Kapelan, Z., Kasprzyk, J., Kollat, J., Matott, L. S., Cunha, M. C., Dandy, G. C., Gibbs, M. S., Keedwell, E., Marchi, A., et al. (2014) · Environmental Modelling & Software · doi:10.1016/j.envsoft.2014.09.013 · Cited by 657
Self-citationBio-inspired computation: Where we stand and what's next
Del Ser, J., Osaba, E., Molina, D., Yang, X.-S., Salcedo-Sanz, S., Camacho, D., Das, S., Suganthan, P. N., Coello Coello, C. A., & Herrera, F. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2019.04.008 · Cited by 593
Evolutionary multiobjective optimization in water resources: The past, present, and future
Reed, P. M., Hadka, D., Herman, J. D., Kasprzyk, J. R., & Kollat, J. B. (2013) · Advances in Water Resources · doi:10.1016/j.advwatres.2012.01.005 · Cited by 541
A social spider algorithm for global optimization
Yu, J. J. Q., & Li, V. O. K. (2015) · Applied Soft Computing · doi:10.1016/j.asoc.2015.02.014 · Cited by 416
Self-adaptive learning based particle swarm optimization
Wang, Y., Li, B., Weise, T., Wang, J., Yuan, B., & Tian, Q. (2011) · Information Sciences · doi:10.1016/j.ins.2010.07.013 · Cited by 347
Ensemble particle swarm optimizer
Lynn, N., & Suganthan, P. N. (2017) · Applied Soft Computing · doi:10.1016/j.asoc.2017.02.007 · Cited by 298
Differential Evolution With Dynamic Parameters Selection for Optimization Problems
Sarker, R. A., Elsayed, S. M., & Ray, T. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2281528 · Cited by 279
Introductory overview: Optimization using evolutionary algorithms and other metaheuristics
Maier, H. R., Razavi, S., Kapelan, Z., Matott, L. S., Kasprzyk, J., & Tolson, B. A. (2019) · Environmental Modelling & Software · doi:10.1016/j.envsoft.2018.11.018 · Cited by 272
Ensemble strategies for population-based optimization algorithms – A survey
Wu, G., Mallipeddi, R., & Suganthan, P. N. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2018.08.015 · Cited by 270
Bibliometric Literature Review of Adaptive Learning Systems
Koutsantonis, D., Koutsantonis, K., Bakas, N. P., Plevris, V., Langousis, A., & Chatzichristofis, S. A. (2022) · Sustainability · doi:10.3390/su141912684 · Cited by 21
Metadata
- Authors
- Vrugt, J. A., Robinson, B. A., & Hyman, J. M.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2009-04
- Volume
- 13
- Issue
- 2
- Pages
- 243-259
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2120138297
- Cited by
- 334
- References
- 37
- FWCI
- 24.91
- Type
- journal article
- 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.