The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Search Biases in Constrained Evolutionary Optimization
Abstract
A common approach to constraint handling in evolutionary optimization is to apply a penalty function to bias the search toward a feasible solution. It has been proposed that the subjective setting of various penalty parameters can be avoided using a multiobjective formulation. This paper analyzes and explains in depth why and when the multiobjective approach to constraint handling is expected to work or fail. Furthermore, an improved evolutionary algorithm based on evolution strategies and differential variation is proposed. Extensive experimental studies have been carried out. Our results reveal that the unbiased multiobjective approach to constraint handling may not be as effective as one may have assumed.
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
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
A Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905
Multi-Objective Optimization Using Evolutionary Algorithms
Deb, K., & Kalyanmoy, D. (2001) · Andalas University Repository (Andalas University) · Cited by 14,918
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
Completely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397
Evolutionary programming made faster
Yao, X., Liu, Y., & Lin, G. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.771163 · Cited by 3,910
Self-citationCoello Coello, C. A. (2002) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/s0045-7825(01)00323-1 · Cited by 2,343
Schwefel, H. (1995) · Cited by 2,203
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
Self-citationThe Theory of Evolution Strategies
Beyer, H.-G. (2001) · Natural Computing Series · doi:10.1007/978-3-662-04378-3 · Cited by 878
Evolutionary Algorithms, Homomorphous Mappings, and Constrained Parameter Optimization
Koziel, S., & Michalewicz, Z. (1999) · Evolutionary Computation · doi:10.1162/evco.1999.7.1.19 · Cited by 758
Sarker, R. A., Mohammadian, M., & Yao, X. (2002) · International series in management science/operations research/International series in operations research & management science · doi:10.1007/b101816 · Cited by 318
Self-citationTREATING CONSTRAINTS AS OBJECTIVES FOR SINGLE-OBJECTIVE EVOLUTIONARY OPTIMIZATION
Coello, C. A. C. (2000) · Engineering Optimization · doi:10.1080/03052150008941301 · Cited by 294
A Derandomized Approach to Self-Adaptation of Evolution Strategies
Ostermeier, A., Gawelczyk, A., & Hansen, N. (1994) · Evolutionary Computation · doi:10.1162/evco.1994.2.4.369 · Cited by 196
Cited by
Eskandar, H., Sadollah, A., Bahreininejad, A., & Hamdi, M. (2012) · Computers & Structures · doi:10.1016/j.compstruc.2012.07.010 · Cited by 1,660
Constraint-handling in nature-inspired numerical optimization: Past, present and future
Mezura-Montes, E., & Coello Coello, C. A. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.10.001 · Cited by 1,127
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
Ensemble of Constraint Handling Techniques
Mallipeddi, R., & Suganthan, P. N. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2033582 · Cited by 467
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
Metadata
- Authors
- Runarsson, T. P., & Yao, X.
- Venue
- IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews)
- Published
- 2005-05
- Volume
- 35
- Issue
- 2
- Pages
- 233-243
- ISSN
- 1094-6977 (ISSN-L)
- OpenAlex
- W2348980703
- Cited by
- 468
- References
- 14
- FWCI
- 13.74
- 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.