The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Constrained optimization by the ε constrained differential evolution with an archive and gradient-based mutation
Abstract
The ε constrained method is an algorithm transformation method, which can convert algorithms for unconstrained problems to algorithms for constrained problems using the ε level comparison, which compares search points based on the pair of objective value and constraint violation of them. We have proposed the ε constrained differential evolution (εDE), which is the combination of the ε constrained method and differential evolution (DE). It has been shown that the εDE can run very fast and can find very high quality solutions. Also, we proposed the εDE with gradient-based mutation (εDEg), which utilized gradients of constraints in order to solve problems with difficult constraints. In this study, we propose the ε constrained DE with an archive and gradient-based mutation (εDEag). The εDEag utilizes an archive to maintain the diversity of individuals and adopts a new way of selecting the ε level control parameter in the εDEg. The 18 problems, which are given in special session on “Single Objective Constrained RealParameter Optimization” in CEC2010, are solved by the εDEag and the results are shown in this paper.
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
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
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
JADE: Adaptive Differential Evolution With Optional External Archive
Zhang, J., & Sanderson, A. C. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2014613 · Cited by 3,739
Coello Coello, C. A. (2002) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/s0045-7825(01)00323-1 · Cited by 2,343
Generalized Inverses of Linear Transformations
Campbell, S. L., & Meyer, C. D. (2009) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719048 · Cited by 1,897
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
Use of a self-adaptive penalty approach for engineering optimization problems
Coello Coello, C. A. (2000) · Computers in Industry · doi:10.1016/s0166-3615(99)00046-9 · Cited by 1,316
Constrained Optimization Via Genetic Algorithms
Homaifar, A., Qi, C. X., & Lai, S. H. (1994) · SIMULATION · doi:10.1177/003754979406200405 · Cited by 802
Joines, J. A., & Houck, C. R. (2002) · Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence · doi:10.1109/icec.1994.349995 · Cited by 749
A Survey of Constraint Handling Techniques in Evolutionary Computation Methods
Michalewicz, Z. (1995) · Evolutionary Programming IV · doi:10.7551/mitpress/2887.003.0018 · Cited by 499
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
Takahama, T., & Sakai, S. (2006) · 2006 IEEE International Conference on Evolutionary Computation · doi:10.1109/cec.2006.1688283 · Cited by 430
Self-citationCONSTRAINT-HANDLING USING AN EVOLUTIONARY MULTIOBJECTIVE OPTIMIZATION TECHNIQUE
Coello, C. A. C. (2000) · Civil Engineering and Environmental Systems · doi:10.1080/02630250008970288 · Cited by 367
A Generic Framework for Constrained Optimization Using Genetic Algorithms
Venkatraman, S., & Yen, G. G. (2005) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.846817 · Cited by 341
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
Wang, Y., Cai, Z., Guo, G., & Zhou, Y. (2007) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2006.886164 · Cited by 250
Takahama, T., & Sakai, S. (2005) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.850256 · Cited by 160
Self-citation
Cited by
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: A review of more than two decades of research
Bilal, Pant, M., Zaheer, H., Garcia-Hernandez, L., & Abraham, A. (2020) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2020.103479 · Cited by 1,002
A 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
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
Lee, D., Ooka, R., Ikeda, S., Choi, W., & Kwak, Y. (2020) · Energy and Buildings · doi:10.1016/j.enbuild.2020.110291 · Cited by 72
Metadata
- Authors
- Takahama, T., & Sakai, S.
- Venue
- IEEE Congress on Evolutionary Computation
- Publisher
- IEEE
- Published
- 2010-07
- Pages
- 1-9
- OpenAlex
- W2048810930
- Cited by
- 271
- References
- 17
- FWCI
- 10.66
- Type
- conference paper
- 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.