The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Improved evolutionary optimization from genetically adaptive multimethod search
Open accessAbstract
In the last few decades, evolutionary algorithms have emerged as a revolutionary approach for solving search and optimization problems involving multiple conflicting objectives. Beyond their ability to search intractably large spaces for multiple solutions, these algorithms are able to maintain a diverse population of solutions and exploit similarities of solutions by recombination. However, existing theory and numerical experiments have demonstrated that it is impossible to develop a single algorithm for population evolution that is always efficient for a diverse set of optimization problems. Here we show that significant improvements in the efficiency of evolutionary search can be achieved by running multiple optimization algorithms simultaneously using new concepts of global information sharing and genetically adaptive offspring creation. We call this approach a multialgorithm, genetically adaptive multiobjective, or AMALGAM, method, to evoke the image of a procedure that merges the strengths of different optimization algorithms. Benchmark results using a set of well known multiobjective test problems show that AMALGAM approaches a factor of 10 improvement over current optimization algorithms for the more complex, higher dimensional problems. The AMALGAM method provides new opportunities for solving previously intractable optimization problems.
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
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
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Multi-Objective Optimization Using Evolutionary Algorithms
Deb, K., & Kalyanmoy, D. (2001) · Andalas University Repository (Andalas University) · Cited by 17,326
No 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
Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
Zitzler, E., & Thiele, L. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.797969 · Cited by 8,798
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
Zitzler, E., Deb, K., & Thiele, L. (2000) · Evolutionary Computation · doi:10.1162/106365600568202 · Cited by 5,697
An Adaptive Metropolis Algorithm
Haario, H., Saksman, E., & Tamminen, J. (2001) · Bernoulli · doi:10.2307/3318737 · Cited by 2,631
Evolutionary Dynamics of Biological Games
Nowak, M. A., & Sigmund, K. (2004) · Science · doi:10.1126/science.1093411 · Cited by 1,184
Global Optimization of Clusters, Crystals, and Biomolecules
Wales, D. J., & Scheraga, H. A. (1999) · Science · doi:10.1126/science.285.5432.1368 · Cited by 1,114
Weather Forecasting with Ensemble Methods
Gneiting, T., & Raftery, A. E. (2005) · Science · doi:10.1126/science.1115255 · Cited by 636
Recent Advances in Memetic Algorithms
Hart, W. E., Smith, J. E., & Krasnogor, N. (2005) · Springer eBooks · doi:10.1007/3-540-32363-5 · Cited by 446
Sustainability of irrigated agriculture in the San Joaquin Valley, California
Schoups, G., Hopmans, J. W., Young, C. A., Vrugt, J. A., Wallender, W. W., Tanji, K. K., & Panday, S. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0507723102 · Cited by 293
Self-citationRigorous location of phase transitions in hard optimization problems
Achlioptas, D., Naor, A., & Peres, Y. (2005) · Nature · doi:10.1038/nature03602 · Cited by 279
Lemmon, A. R., & Milinkovitch, M. C. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.162224399 · Cited by 200
New optimization methods from physics and biology
Bounds, D. G. (1987) · Nature · doi:10.1038/329215a0 · Cited by 151
Glick, M., Rayan, A., & Goldblum, A. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.022418199 · Cited by 44
Cited by
Hyper-heuristics: a survey of the state of the art
Burke, E. K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., & Qu, R. (2013) · Journal of the Operational Research Society · doi:10.1057/jors.2013.71 · Cited by 1,263
Vrugt, J. A., ter Braak, C. J. F., Diks, C. G. H., Robinson, B. A., Hyman, J. M., & Higdon, D. (2009) · International Journal of Nonlinear Sciences and Numerical Simulation · doi:10.1515/ijnsns.2009.10.3.273 · Cited by 1,145
Self-citationVrugt, J. A., ter Braak, C. J. F., Clark, M. P., Hyman, J. M., & Robinson, B. A. (2008) · Water Resources Research · doi:10.1029/2007wr006720 · Cited by 891
Self-citationOn the value of soil moisture measurements in vadose zone hydrology: A review
Vereecken, H., Huisman, J. A., Bogena, H., Vanderborght, J., Vrugt, J. A., & Hopmans, J. W. (2008) · Water Resources Research · doi:10.1029/2008wr006829 · Cited by 872
Self-citationVrugt, J. A. (2016) · Environmental Modelling & Software · doi:10.1016/j.envsoft.2015.08.013 · Cited by 851
Self-citation
Metadata
- Authors
- Vrugt, J. A., & Robinson, B. A.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2007-01-16
- Volume
- 104
- Issue
- 3
- Pages
- 708-711
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W2101473977
- Cited by
- 614
- References
- 19
- FWCI
- 25.88
- Type
- journal article
- Language
- en
- Open access
- green
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.