A Review on Constraint Handling Techniques for Population-based Algorithms: from single-objective to multi-objective optimization
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
Most real-world problems involve some type of optimization problems that are often constrained. Numerous researchers have investigated several techniques to deal with constrained single-objective and multi-objective evolutionary optimization in many fields, including theory and application. This presented study provides a novel analysis of scholarly literature on constraint-handling techniques for single-objective and multi-objective population-based algorithms according to the most relevant journals and articles. As a contribution to this study, the paper reviews the main ideas of the most state-of-the-art constraint handling techniques in population-based optimization, and then the study addresses the bibliometric analysis, with a focus on multi-objective, in the field. The extracted papers include research articles, reviews, book/book chapters, and conference papers published between 2000 and 2021 for analysis. The results indicate that the constraint-handling techniques for multi-objective optimization have received much less attention compared with single-objective optimization. The most promising algorithms for such optimization were determined to be genetic algorithms, differential evolutionary algorithms, and particle swarm intelligence. Additionally, “Engineering,” “Computer Science,” and “ Mathematics” were identified as the top three research fields in which future research work is anticipated to increase.
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
Software survey: VOSviewer, a computer program for bibliometric mapping
van Eck, N. J., & Waltman, L. (2010) · Scientometrics · doi:10.1007/s11192-009-0146-3 · Cited by 21,484 · cited 1×
“In stage 4, a social network analysis was performed to provide a scientometric analysis of the documents using VOSviewer [46], [47] and RStudio, which have been identified as powerful tools for scientometric analysis.”
MethodNo 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 · cited 1×
“The previous work also addressed some state-of-the-art constrained handling techniques, including feasibility rules based on GA [17], epsilon-constrained method [36], penalty functions [37, 38], and ensemble of constraint-handling methods [39, 40].”
BackgroundMuiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms
Srinivas, N., & Deb, K. (1994) · Evolutionary Computation · doi:10.1162/evco.1994.2.3.221 · Cited by 6,935 · cited 1×
“Whenever the multi-objective function and constraint violation for each constraint are assessed, the sum of violations is added to each objective function value considering the multiplication of the penalty parameter [128, 129].”
BackgroundDifferential 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
Cited by
Zhao, R., Tao, S., & Li, P. (2025) · Robotics and Computer-Integrated Manufacturing · doi:10.1016/j.rcim.2024.102942 · Cited by 22
Metadata
- Authors
- Rahimi, I., Gandomi, A. H., Chen, F., & Mezura-Montes, E.
- Venue
- Archives of Computational Methods in Engineering
- Published
- 2022-12-09
- Volume
- 30
- Issue
- 3
- Pages
- 2181-2209
- ISSN
- 1134-3060 (ISSN-L)
- 1886-1784
- OpenAlex
- W4312000417
- Cited by
- 218
- References
- 5
- FWCI
- 12.12
- Type
- journal article
- Language
- en
- Open access
- hybrid
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Review on Constraint Handling Techniques for Population-based Algorithms: from single-objective to multi-objective optimization. https://app.cochat.ai/papers/10.1007/s11831-022-09859-9
- The paper
- Rahimi, I., Gandomi, A. H., Chen, F., & Mezura-Montes, E. (2023). A Review on Constraint Handling Techniques for Population-based Algorithms: from single-objective to multi-objective optimization. Archives of Computational Methods in Engineering. https://doi.org/10.1007/s11831-022-09859-9
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.