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
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
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
Artificial Bee Colony (ABC) Optimization Algorithm for Solving Constrained Optimization Problems
Karaboga, D., & Basturk, B. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72950-1_77 · Cited by 1,407
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
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
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
Novel meta-heuristic bald eagle search optimisation algorithm
Alsattar, H. A., Zaidan, A. A., & Zaidan, B. B. (2020) · Artificial Intelligence Review · doi:10.1007/s10462-019-09732-5 · Cited by 681
Push and pull search for solving constrained multi-objective optimization problems
Fan, Z., Li, W., Cai, X., Li, H., Wei, C., Zhang, Q., Deb, K., & Goodman, E. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2018.08.017 · Cited by 594
Artificial bee colony algorithm for large-scale problems and engineering design optimization
Akay, B., & Karaboga, D. (2012) · Journal of Intelligent Manufacturing · doi:10.1007/s10845-010-0393-4 · Cited by 575
Parameter Control in Evolutionary Algorithms: Trends and Challenges
Karafotias, G., Hoogendoorn, M., & Eiben, A. E. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2014.2308294 · Cited by 516
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
A hybrid particle swarm optimization with a feasibility-based rule for constrained optimization
He, Q., & Wang, L. (2007) · Applied Mathematics and Computation · doi:10.1016/j.amc.2006.07.134 · Cited by 468
Chaotic grey wolf optimization algorithm for constrained optimization problems
Kohli, M., & Arora, S. (2018) · Journal of Computational Design and Engineering · doi:10.1016/j.jcde.2017.02.005 · Cited by 431
Takahama, T., & Sakai, S. (2006) · 2006 IEEE International Conference on Evolutionary Computation · doi:10.1109/cec.2006.1688283 · Cited by 430
Constraint Handling in Multiobjective Evolutionary Optimization
Woldesenbet, Y. G., Yen, G. G., & Tessema, B. G. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.2009032 · Cited by 420
Evolutionary computation and structural design: A survey of the state-of-the-art
Kicinger, R., Arciszewski, T., & Jong, K. D. (2005) · Computers & Structures · doi:10.1016/j.compstruc.2005.03.002 · Cited by 402
Self-adaptive fitness formulation for constrained optimization
Farmani, R., & Wright, J. A. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.817236 · Cited by 362
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
Difficulty Adjustable and Scalable Constrained Multiobjective Test Problem Toolkit
Fan, Z., Li, W., Cai, X., Li, H., Wei, C., Zhang, Q., Deb, K., & Goodman, E. (2020) · Evolutionary Computation · doi:10.1162/evco_a_00259 · Cited by 308
A constraint handling approach for the differential evolution algorithm
Lampinen, J. (2003) · Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) · doi:10.1109/cec.2002.1004459 · Cited by 294
Takahama, T., & Sakai, S. (2010) · IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2010.5586484 · Cited by 271
Unified Particle Swarm Optimization for Solving Constrained Engineering Optimization Problems
Parsopoulos, K. E., & Vrahatis, M. N. (2005) · Lecture Notes in Computer Science · doi:10.1007/11539902_71 · Cited by 267
Alnowibet, K. A., Mahdi, S., El-Alem, M., Abdelawwad, M., & Mohamed, A. W. (2022) · Mathematics · doi:10.3390/math10081312 · Cited by 28
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.