The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
A Generic Framework for Constrained Optimization Using Genetic Algorithms
Abstract
In this paper, we propose a generic, two-phase framework for solving constrained optimization problems using genetic algorithms. In the first phase of the algorithm, the objective function is completely disregarded and the constrained optimization problem is treated as a constraint satisfaction problem. The genetic search is directed toward minimizing the constraint violation of the solutions and eventually finding a feasible solution. A linear rank-based approach is used to assign fitness values to the individuals. The solution with the least constraint violation is archived as the elite solution in the population. In the second phase, the simultaneous optimization of the objective function and the satisfaction of the constraints are treated as a biobjective optimization problem. We elaborate on how the constrained optimization problem requires a balance of exploration and exploitation under different problem scenarios and come to the conclusion that a nondominated ranking between the individuals will help the algorithm explore further, while the elitist scheme will facilitate in exploitation. We analyze the proposed algorithm under different problem scenarios using Test Case Generator-2 and demonstrate the proposed algorithm's capability to perform well independent of various problem characteristics. In addition, the proposed algorithm performs competitively with the state-of-the-art constraint optimization algorithms on 11 test cases which were widely studied benchmark functions in literature.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
Differential evolution with dynamic stochastic selection for constrained optimization
Zhang, M., Luo, W., & Wang, X. (2008) · Information Sciences · doi:10.1016/j.ins.2008.02.014 · Cited by 503
Takahama, T., & Sakai, S. (2006) · 2006 IEEE International Conference on Evolutionary Computation · doi:10.1109/cec.2006.1688283 · Cited by 430
Constraint Handling in Multiobjective Evolutionary Optimization
Woldesenbet, Y. G., Yen, G. G., & Tessema, B. G. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.2009032 · Cited by 420
Self-citationA 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
An Adaptive Tradeoff Model for Constrained Evolutionary Optimization
Wang, Y., Cai, Z., Zhou, Y., & Zeng, W. (2008) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.902851 · Cited by 302
Metadata
- Authors
- Venkatraman, S., & Yen, G. G.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2005-08
- Volume
- 9
- Issue
- 4
- Pages
- 424-435
- ISSN
- 1089-778X (ISSN-L)
- OpenAlex
- W2170338867
- Cited by
- 341
- References
- 2
- FWCI
- 19.24
- 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
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 Generic Framework for Constrained Optimization Using Genetic Algorithms. https://app.cochat.ai/papers/10.1109/tevc.2005.846817
- The paper
- Venkatraman, S., & Yen, G. G. (2005). A Generic Framework for Constrained Optimization Using Genetic Algorithms. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/tevc.2005.846817
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.