The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
A Computationally Efficient Evolutionary Algorithm for Real-Parameter Optimization
Abstract
Due to increasing interest in solving real-world optimization problems using evolutionary algorithms (EAs), researchers have recently developed a number of real-parameter genetic algorithms (GAs). In these studies, the main research effort is spent on developing an efficient recombination operator. Such recombination operators use probability distributions around the parent solutions to create an offspring. Some operators emphasize solutions at the center of mass of parents and some around the parents. In this paper, we propose a generic parent-centric recombination operator (PCX) and a steady-state, elite-preserving, scalable, and computationally fast population-alteration model (we call the G3 model). The performance of the G3 model with the PCX operator is investigated on three commonly used test problems and is compared with a number of evolutionary and classical optimization algorithms including other real-parameter GAs with the unimodal normal distribution crossover (UNDX) and the simplex crossover (SPX) operators, the correlated self-adaptive evolution strategy, the covariance matrix adaptation evolution strategy (CMA-ES), the differential evolution technique, and the quasi-Newton method. The proposed approach is found to consistently and reliably perform better than all other methods used in the study. A scale-up study with problem sizes up to 500 variables shows a polynomial computational complexity of the proposed approach. This extensive study clearly demonstrates the power of the proposed technique in tackling real-parameter 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
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,328
Self-citationCompletely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397
Simulated Binary Crossover for Continuous Search Space.
Deb, K., & Agrawal, R. B. (1995) · Complex Systems · Cited by 2,976
Self-citationEvolutionsstrategie : Optimierung technischer Systeme nach Prinzipien der biologischen Evolution
Rechenberg, I. (1973) · Frommann-Holzboog eBooks · Cited by 2,440
Hansen, N., & Ostermeier, A. (2002) · Proceedings of IEEE International Conference on Evolutionary Computation · doi:10.1109/icec.1996.542381 · Cited by 1,106
Engineering optimization: Methods and applications
Reklaitis, G. V. (1984) · Advances in Engineering Software (1978) · doi:10.1016/0141-1195(84)90019-6 · Cited by 1,079
The Theory of Evolution Strategies
Beyer, H.-G. (2001) · Natural Computing Series · doi:10.1007/978-3-662-04378-3 · Cited by 878
Optimization toolbox : for use with MATLAB
Coleman, T. F., Branch, M. A., & Grace, A. (1999) · Cited by 817
Optimization Methods for Engineering Design
Fox, R. L., & Mote, C. D. (1972) · Journal of Dynamic Systems, Measurement, and Control · doi:10.1115/1.3426572 · Cited by 606
Genetic algorithms, noise, and the sizing of populations
Goldberg, D. E., Deb, K., & Clark, J. H. (1991) · Cited by 584
Self-citationSelf-Adaptive Genetic Algorithms with Simulated Binary Crossover
Deb, K., & Beyer, H.-G. (2001) · Evolutionary Computation · doi:10.1162/106365601750190406 · Cited by 437
Self-citationOno, I., & Kobayashi, S. (1997) · Medical Entomology and Zoology · Cited by 369
Multi-parent recombination with simplex crossover in real coded genetic algorithms
Tsutsui, S., Yamamura, M., & Higuchi, T. (1999) · Tokyo Tech Research Repository (Tokyo Institute of Technology) · Cited by 319
On self-adaptive features in real-parameter evolutionary algorithms
Beyer, H.-G., & Deb, K. (2001) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.930314 · Cited by 264
Self-citationEmpirical Investigation of Multiparent Recombination Operators in Evolution Strategies
Eiben, A. E., & Bäck, T. (1997) · Evolutionary Computation · doi:10.1162/evco.1997.5.3.347 · Cited by 122
Kita, H., Ono, I., & Kobayashi, S. (2003) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.1999.782672 · Cited by 122
Fuzzy Recombination for the Breeder Genetic Algorithm
Voigt, H.-M., Mühlenbein, H., & Cvetković, D. (1995) · Cited by 114
A Comparison Study of Self-Adaptation in Evolution Strategies and Real-Coded Genetic Algorithms
Kita, H. (2001) · Evolutionary Computation · doi:10.1162/106365601750190415 · Cited by 95
The deterministic genetic algorithm: implementation details and some results
Salomon, R. (2003) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.1999.782001 · Cited by 7
Cited by
Differential Evolution: A Survey of the State-of-the-Art
Das, S., & Suganthan, P. N. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2059031 · Cited by 5,307
Completely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397
Ant colony optimization for continuous domains
Socha, K., & Dorigo, M. (2008) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.06.046 · Cited by 1,414
Differential Evolution Using a Neighborhood-Based Mutation Operator
Das, S., Abraham, A., Chakraborty, U. K., & Konar, A. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.2009457 · Cited by 1,165
Multi-objective Optimisation Using Evolutionary Algorithms: An Introduction
Deb, K. (2011) · Multi-objective Evolutionary Optimisation for Product Design and Manufacturing · doi:10.1007/978-0-85729-652-8_1 · Cited by 995
Self-citation
Metadata
- Authors
- Deb, K., Anand, A., & Joshi, D.
- Venue
- Evolutionary Computation
- Publisher
- MIT Press - Journals
- Published
- 2002-12
- Volume
- 10
- Issue
- 4
- Pages
- 371-395
- ISSN
- 1063-6560 (ISSN-L)
- 1530-9304
- OpenAlex
- W2072782187
- Cited by
- 614
- References
- 20
- FWCI
- 11.38
- 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.