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,326
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
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-citationRM-MEDA: A Regularity Model-Based Multiobjective Estimation of Distribution Algorithm
Zhang, Q., Zhou, A., & Jin, Y. (2008) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.894202 · Cited by 827
Orthogonal 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
State of the Art for Genetic Algorithms and Beyond in Water Resources Planning and Management
Nicklow, J., Reed, P., Savic, D., Dessalegne, T., Harrell, L., Chan-Hilton, A., Karamouz, M., Minsker, B., Ostfeld, A., Singh, A., et al. (2010) · Journal of Water Resources Planning and Management · doi:10.1061/(asce)wr.1943-5452.0000053 · Cited by 624
Accelerating Differential Evolution Using an Adaptive Local Search
Noman, N., & Iba, H. (2008) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.895272 · Cited by 610
Self-Adaptive Genetic Algorithms with Simulated Binary Crossover
Deb, K., & Beyer, H.-G. (2001) · Evolutionary Computation · doi:10.1162/106365601750190406 · Cited by 437
Self-citationMultifactorial Evolutionary Algorithm With Online Transfer Parameter Estimation: MFEA-II
Bali, K. K., Ong, Y.-S., Gupta, A., & Tan, P. S. (2020) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2019.2906927 · Cited by 437
Novel composition test functions for numerical global optimization
Liang, J. J., Suganthan, P. N., & Deb, K. (2005) · Proceedings 2005 IEEE Swarm Intelligence Symposium, 2005. SIS 2005. · doi:10.1109/sis.2005.1501604 · Cited by 432
Self-citationA new crossover operator for real coded genetic algorithms
Deep, K., & Thakur, M. (2007) · Applied Mathematics and Computation · doi:10.1016/j.amc.2006.10.047 · Cited by 419
A Multiobjective Optimization-Based Evolutionary Algorithm for Constrained Optimization
Cai, Z., & Wang, Y. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2006.872344 · Cited by 400
Omni-optimizer: A generic evolutionary algorithm for single and multi-objective optimization
Deb, K., & Tiwari, S. (2008) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.06.042 · Cited by 399
Self-citationA new mutation operator for real coded genetic algorithms
Deep, K., & Thakur, M. (2007) · Applied Mathematics and Computation · doi:10.1016/j.amc.2007.03.046 · Cited by 389
Self-adaptive simulated binary crossover for real-parameter optimization
Deb, K., Sindhya, K., & Okabe, T. (2007) · Proceedings of the 9th annual conference on Genetic and evolutionary computation · doi:10.1145/1276958.1277190 · Cited by 338
Self-citationSelf-Adaptive Multimethod Search for Global Optimization in Real-Parameter Spaces
Vrugt, J. A., Robinson, B. A., & Hyman, J. M. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.924428 · Cited by 334
Antigen receptor repertoire profiling from RNA-seq data
Bolotin, D. A., Poslavsky, S., Davydov, A. N., Frenkel, F. E., Fanchi, L., Zolotareva, O. I., Hemmers, S., Putintseva, E. V., Obraztsova, A. S., Shugay, M., et al. (2017) · Nature Biotechnology · doi:10.1038/nbt.3979 · Cited by 333
A Note on the Extended Rosenbrock Function
Shang, Y.-W., & Qiu, Y.-H. (2006) · Evolutionary Computation · doi:10.1162/106365606776022733 · Cited by 321
Enhancing Differential Evolution Utilizing Proximity-Based Mutation Operators
Epitropakis, M. G., Tasoulis, D. K., Pavlidis, N. G., Plagianakos, V. P., & Vrahatis, M. N. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2083670 · Cited by 316
Social group optimization (SGO): a new population evolutionary optimization technique
Satapathy, S., & Naik, A. (2016) · Complex & Intelligent Systems · doi:10.1007/s40747-016-0022-8 · Cited by 297
Quantum-inspired evolutionary algorithms: a survey and empirical study
Zhang, G. (2011) · Journal of Heuristics · doi:10.1007/s10732-010-9136-0 · Cited by 295
Global and local real-coded genetic algorithms based on parent-centric crossover operators
García-Martínez, C., Lozano, M., Herrera, F., Molina, D., & Sánchez, A. M. (2008) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.06.043 · Cited by 268
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.