On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GA's
The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
We discuss the use of non-stationary penalty functions to solve general nonlinear programming problems (NP) using real-valued GAs. The non-stationary penalty is a function of the generation number; as the number of generations increases so does the penalty. Therefore, as the penalty increases it puts more and more selective pressure on the GA to find a feasible solution. The ideas presented in this paper come from two basic areas: calculus-based nonlinear programming and simulated annealing. The non-stationary penalty methods are tested on four NP test cases and the effectiveness of these methods are reported.>
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
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1992) · Artificial Intelligence · doi:10.1007/978-3-662-02830-8 · Cited by 11,553
Nonlinear programming: theory and algorithms
(1993) · Computers & Operations Research · doi:10.1016/0305-0548(93)90042-h · Cited by 5,779
Nonlinear Programming: Analysis and Methods
Avriel, M. (1976) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,339
Nonlinear Programming Analysis and Methods
Rodin, E. Y. (1977) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(77)90071-2 · Cited by 1,278
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,203
Cited by
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
Coello Coello, C. A. (2002) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/s0045-7825(01)00323-1 · Cited by 2,343
Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems
Gandomi, A. H., Yang, X.-S., & Alavi, A. H. (2013) · Engineering with Computers · doi:10.1007/s00366-011-0241-y · Cited by 2,257
Parameter control in evolutionary algorithms
Eiben, A. E., Hinterding, R., & Michalewicz, Z. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.771166 · Cited by 1,980
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
Metadata
- Authors
- Joines, J. A., & Houck, C. R.
- Venue
- Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence
- Publisher
- IEEE
- Published
- 2002-12-17
- Pages
- 579-584
- OpenAlex
- W2104324382
- Cited by
- 749
- References
- 5
- FWCI
- 30.45
- 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.