The DOI matches its Crossref record; 114 of the 114 references it cites were found in a registry or an index.
Constraint-handling in nature-inspired numerical optimization: Past, present and future
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
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
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1992) · Artificial Intelligence · doi:10.1007/978-3-662-02830-8 · Cited by 11,553
Karaboga, D., & Basturk, B. (2007) · Journal of Global Optimization · doi:10.1007/s10898-007-9149-x · Cited by 7,651
Lecture Notes in Artificial Intelligence
Brézillon, P., & Bouquet, P. (1999) · Cited by 7,473
Bäck, T. (1996) · Oxford University Press eBooks · doi:10.1093/oso/9780195099713.001.0001 · Cited by 5,113
Introduction to Evolutionary Computing
Eiben, A. E., & Smith, J. E. (2003) · Natural Computing Series · doi:10.1007/978-3-662-05094-1 · Cited by 4,176
An efficient constraint handling method for genetic algorithms
Deb, K. (2000) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/s0045-7825(99)00389-8 · Cited by 3,892
Biomimicry of bacterial foraging for distributed optimization and control
(2002) · IEEE Control Systems · doi:10.1109/mcs.2002.1004010 · Cited by 3,069
Pólya, G. (1945) · Cited by 3,006
Cited by
Stochastic ranking for constrained evolutionary optimization
Runarsson, T. P., & Yao, X. (2000) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.873238 · Cited by 1,807
Nature-Inspired Optimization Algorithms
(2021) · Elsevier eBooks · doi:10.1016/c2019-0-03762-4 · Cited by 755
A New Dominance Relation-Based Evolutionary Algorithm for Many-Objective Optimization
Yuan, Y., Xu, H., Wang, B., & Yao, X. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2420112 · Cited by 752
Push and pull search for solving constrained multi-objective optimization problems
Fan, Z., Li, W., Cai, X., Li, H., Wei, C., Zhang, Q., Deb, K., & Goodman, E. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2018.08.017 · Cited by 594
Differential evolution with multi-population based ensemble of mutation strategies
Wu, G., Mallipeddi, R., Suganthan, P. N., Wang, R., & Chen, H. (2016) · Information Sciences · doi:10.1016/j.ins.2015.09.009 · Cited by 569
Ma, Z., & Wang, Y. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2019.2896967 · Cited by 458
An improved epsilon constraint-handling method in MOEA/D for CMOPs with large infeasible regions
Fan, Z., Li, W., Cai, X., Huang, H., Fang, Y., You, Y., Mo, J., Wei, C., & Goodman, E. (2019) · Soft Computing · doi:10.1007/s00500-019-03794-x · Cited by 450
Markov Chain Analysis of Cumulative Step-size Adaptation on a Linear Constrained Problem
Chotard, A., Auger, A., & Nikolaus Hansen, C. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1510.04409 · Cited by 389
Improved grasshopper optimization algorithm using opposition-based learning
Ewees, A. A., Abd Elaziz, M., & Houssein, E. H. (2018) · Expert Systems with Applications · doi:10.1016/j.eswa.2018.06.023 · Cited by 346
Whale Optimization Algorithm With Applications to Resource Allocation in Wireless Networks
Pham, Q.-V., Mirjalili, S., Kumar, N., Alazab, M., & Hwang, W.-J. (2020) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2020.2973294 · Cited by 345
An easy-to-use real-world multi-objective optimization problem suite
Tanabe, R., & Ishibuchi, H. (2020) · Applied Soft Computing · doi:10.1016/j.asoc.2020.106078 · Cited by 324
Kumar, A., Wu, G., Ali, M. Z., Luo, Q., Mallipeddi, R., Suganthan, P. N., & Das, S. (2021) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2021.100961 · Cited by 309
Difficulty Adjustable and Scalable Constrained Multiobjective Test Problem Toolkit
Fan, Z., Li, W., Cai, X., Li, H., Wei, C., Zhang, Q., Deb, K., & Goodman, E. (2020) · Evolutionary Computation · doi:10.1162/evco_a_00259 · Cited by 308
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
Regis, R. G. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2262111 · Cited by 268
A Dual-Population-Based Evolutionary Algorithm for Constrained Multiobjective Optimization
Ming, M., Trivedi, A., Wang, R., Srinivasan, D., & Zhang, T. (2021) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2021.3066301 · Cited by 258
Song, Z., Wang, H., & Jin, Y. (2023) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2023.3281822 · Cited by 38
Metadata
- Authors
- Mezura-Montes, E., & Coello Coello, C. A.
- Venue
- Swarm and Evolutionary Computation
- Publisher
- Elsevier BV
- Published
- 2011-12
- Volume
- 1
- Issue
- 4
- Pages
- 173-194
- ISSN
- 2210-6502 (ISSN-L)
- OpenAlex
- W2110368321
- Cited by
- 1,127
- References
- 114
- FWCI
- 35.78
- 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.