The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Stochastic ranking for constrained evolutionary optimization
Open accessAbstract
Penalty functions are often used in constrained optimization. However, it is very difficult to strike the right balance between objective and penalty functions. This paper introduces a novel approach to balance objective and penalty functions stochastically, i.e., stochastic ranking, and presents a new view on penalty function methods in terms of the dominance of penalty and objective functions. Some of the pitfalls of naive penalty methods are discussed in these terms. The new ranking method is tested using a (/spl mu/, /spl lambda/) evolution strategy on 13 benchmark problems. Our results show that suitable ranking alone (i.e., selection), without the introduction of complicated and specialized variation operators, is capable of improving the search performance significantly.
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
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
Bäck, T. (1996) · Oxford University Press eBooks · doi:10.1093/oso/9780195099713.001.0001 · Cited by 5,113
Markov Chains and Stochastic Stability
Meyn, S. P., & Tweedie, R. L. (1993) · Springer eBooks · doi:10.1007/978-1-4471-3267-7 · Cited by 5,041
Completely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397
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
Himmelblau, D. M. (1972) · Cited by 2,532
Genetic Algorithms and Engineering Design
Gen, M., & Cheng, R. (1996) · Wiley eBooks · doi:10.1002/9780470172254 · Cited by 2,460
Nonlinear Programming: Sequential Unconstrained Minimization Techniques
Fiacco, A. V., & McCormick, G. P. (1968) · Defense Technical Information Center (DTIC) · Cited by 2,262
Schwefel, H. (1995) · Cited by 2,203
Evolutionary Algorithms for Constrained Parameter Optimization Problems
Michalewicz, Z., & Schoenauer, M. (1996) · Evolutionary Computation · doi:10.1162/evco.1996.4.1.1 · Cited by 1,718
More Test Examples for Nonlinear Programming Codes
Schittkowski, K. (1987) · Lecture notes in economics and mathematical systems · doi:10.1007/978-3-642-61582-5 · Cited by 1,163
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
Constrained Optimization Via Genetic Algorithms
Homaifar, A., Qi, C. X., & Lai, S. H. (1994) · SIMULATION · doi:10.1177/003754979406200405 · Cited by 802
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
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
Test Examples for Nonlinear Programming Codes
Hock, W., & Schittkowski, K. (1981) · Lecture notes in economics and mathematical systems · doi:10.1007/978-3-642-48320-2 · Cited by 645
Hansen, N., Niederberger, A. S. P., Guzzella, L., & Koumoutsakos, P. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.924423 · Cited by 323
Noisy Optimization With Evolution Strategies
Arnold, D. V. (2002) · Genetic Algorithms and Evolutionary Computation · doi:10.1007/978-1-4615-1105-2 · Cited by 162
Kazarlis, S., & Petridis, V. (1998) · Lecture notes in computer science · doi:10.1007/bfb0056864 · Cited by 97
A Note on Usefulness of Geometrical Crossover for Numerical Optimization Problems.
Michalewicz, Z., Nazhiyath, G., & Michalewicz, M. (1996) · Evolutionary Programming · Cited by 81
Performance Analysis of Evolutionary Optimization With Cumulative Step Length Adaptation
Arnold, D. V., & Beyer, H.-G. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.825637 · Cited by 59
Cumulative Step-Size Adaptation on Linear Functions
Chotard, A., Auger, A., & Hansen, N. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32937-1_8 · Cited by 27
Cited by
COPASI—a COmplex PAthway SImulator
Hoops, S., Sahle, S., Gauges, R., Lee, C., Pahle, J., Simus, N., Singhal, M., Xu, L., Mendes, P., & Kummer, U. (2006) · Bioinformatics · doi:10.1093/bioinformatics/btl485 · Cited by 2,618
Coello Coello, C. A. (2002) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/s0045-7825(01)00323-1 · Cited by 2,343
Bat algorithm: a novel approach for global engineering optimization
Yang, X., & Hossein Gandomi, A. (2012) · Engineering Computations · doi:10.1108/02644401211235834 · Cited by 1,751
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
Metadata
- Authors
- Runarsson, T. P., & Yao, X.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2000
- Volume
- 4
- Issue
- 3
- Pages
- 284-294
- ISSN
- 1089-778X (ISSN-L)
- OpenAlex
- W2151339633
- Cited by
- 1,807
- References
- 22
- FWCI
- 12.91
- Type
- journal article
- Language
- en
- Open access
- green
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.