The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Incorporating Objective Function Information Into the Feasibility Rule for Constrained Evolutionary Optimization
Abstract
When solving constrained optimization problems by evolutionary algorithms, an important issue is how to balance constraints and objective function. This paper presents a new method to address the above issue. In our method, after generating an offspring for each parent in the population by making use of differential evolution (DE), the well-known feasibility rule is used to compare the offspring and its parent. Since the feasibility rule prefers constraints to objective function, the objective function information has been exploited as follows: if the offspring cannot survive into the next generation and if the objective function value of the offspring is better than that of the parent, then the offspring is stored into a predefined archive. Subsequently, the individuals in the archive are used to replace some individuals in the population according to a replacement mechanism. Moreover, a mutation strategy is proposed to help the population jump out of a local optimum in the infeasible region. Note that, in the replacement mechanism and the mutation strategy, the comparison of individuals is based on objective function. In addition, the information of objective function has also been utilized to generate offspring in DE. By the above processes, this paper achieves an effective balance between constraints and objective function in constrained evolutionary optimization. The performance of our method has been tested on two sets of benchmark test functions, namely, 24 test functions at IEEE CEC2006 and 18 test functions with 10-D and 30-D at IEEE CEC2010. The experimental results have demonstrated that our method shows better or at least competitive performance against other state-of-the-art methods. Furthermore, the advantage of our method increases with the increase of the number of decision variables.
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
Completely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397
Cited by
Liu, Z.-Z., & Wang, Y. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2019.2894743 · Cited by 486
Self-citationA survey on evolutionary computation for complex continuous optimization
Zhan, Z.-H., Shi, L., Tan, K. C., & Zhang, J. (2022) · Artificial Intelligence Review · doi:10.1007/s10462-021-10042-y · Cited by 416
Novel mutation strategy for enhancing SHADE and LSHADE algorithms for global numerical optimization
Mohamed, A. W., Hadi, A. A., & Jambi, K. M. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2018.10.006 · Cited by 266
Handling Constrained Multiobjective Optimization Problems via Bidirectional Coevolution
Liu, Z.-Z., Wang, B.-C., & Tang, K. (2022) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2021.3056176 · Cited by 254
Self-citationSong, 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
- Wang, Y., Wang, B.-C., Li, H.-X., & Yen, G. G.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2016-12
- Volume
- 46
- Issue
- 12
- Pages
- 2938-2952
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W2345178486
- Cited by
- 235
- References
- 2
- FWCI
- 15.33
- 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: Incorporating Objective Function Information Into the Feasibility Rule for Constrained Evolutionary Optimization. https://app.cochat.ai/papers/10.1109/tcyb.2015.2493239
- The paper
- Wang, Y., Wang, B.-C., Li, H.-X., & Yen, G. G. (2016). Incorporating Objective Function Information Into the Feasibility Rule for Constrained Evolutionary Optimization. IEEE Transactions on Cybernetics. https://doi.org/10.1109/tcyb.2015.2493239
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.