Dergiler / Mathematical and Computational Applications / 2005 / Cilt: 10 - Sayı: 1

Penalty function methods for constrained optimization with genetic algorithms

Sayfa
45–56
DOI
—
🏛️Bu makalenin bibliyografik verileri ve tam metin bağlantısı DergiPark üzerinden sağlanmıştır.
DergiPark Kaydı ↗
✨

Yapay Zeka Hızlı Bakış & Çıkarımlar

AI Insight
⚡ TL;DR(1 Cümlede Hızlı Çıkarım)

In this paper, we present these penalty-based methods, and discuss their strengths and weaknesses.

📌 3 Maddede Bu Makale

🎯
Amaç & Hipotez:Genetic Algorithms are most directly suited to unconstrained optimization.
📊
Temel Bulgular & Veri:Application of Genetic Algorithms to constrained optimization problems is often a challenging effort.
💡
Sonuç & Katkı:In this paper, we present these penalty-based methods, and discuss their strengths and weaknesses.
🔬Tür:Modelleme & Sayısal Simülasyon
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Alan Parametreleri

Abstract

Genetic Algorithms are most directly suited to unconstrained optimization. Application of Genetic Algorithms to constrained optimization problems is often a challenging effort. Several methods have been proposed for handling constraints. The most common method in Genetic Algorithms to handle constraints is to use penalty functions. In this paper, we present these penalty-based methods, and discuss their strengths and weaknesses.

🔖

Bu Makaleye Atıf Yap

YENİAY, M. Ö. (2005). Penalty function methods for constrained optimization with genetic algorithms. Mathematical and Computational Applications, Cilt: 10 - Sayı: 1, 45–56. https://ajindex.com/articles/280113

📄 Tam Metin PDF Okuyucu

📄

PDF görüntüleyici hazırlanıyor...

Kaynakça (2)

  1. Adeli, H. and Cheng, N.T. Augmented lagrangian genetic algorithm for structural optimization, Journal of Aerospace Engineering, 7, 104-118, 1994. 2.Back, T., Hoffmeister, F. and Schwell, H.P. A Survey of evolution strategies, Proceedings of the Fourth International Conference on Genetic Algorithms, Morgan Kaufmann, 2-9, 1991. 3.Bazaraa, M.S., Sherali H.D. and Shetty, CM. Nonlinear programming: theory and algorithms, John Wily and Sons, 2nd edition, 1993. 4.Belur, S.V. CORE: Constrained optimization by random evolution, Late Breaking Papers at the Genetic Programming Conference, Stanford University, 280-286, 1997. 5.Carlson Skalak, S., Shonkwiler, R., Babar, S., and Aral, M. Annealing a genetic algorithm over constraints, SMC 98 Conference, available from http://www.math.gatech.edu/~shenk/body.html. 6.Coello, C.A.C. A Survey of constraint handling techniques used with evolutionary algorithms, Technical Report, Lania-Rl-99-04,
  2. Laboratorio de Inform atica Avanzada, Veracruz, Mexico, 1999, available from http://www.cs.cinvestav.mx/~constraint/. 7.Coello, C.A.C. Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state of the art, Computer Methods in Applied Mechanics and Engineering, 191, 1245-1287, 2002. 8.Coello, C.A.C. Use of a self-adaptive penalty approach for engineering optimization problems, Computers in Industry, 41, 113-127, 2000. 9.Deb, K. An Efficient constraint handling method for genetic algorithms, Computer Methods in Applied Mechanics and Engineering, 186, 311-338, 2000. 10.Gen, M. and Cheng, R. A Survey of penalty techniques in genetic algorithms, Proceedings of the 1996 International Conference on Evolutionary Computation, IEEE, 804-809, 1996. 11.Goldberg, D.E. Genetic algorithms in search, optimization and machine learning, Addison-Wesley, Reading, MA, 1989. 12.Hadj-Alouane, A.B. and Bean, J.C. A Genetic algorithm for the multiple-choice integer program, Operations Research, 45, 92-101, 1997. 13.Hajela, P. and Lee, J. Constrained genetic search via schema adaptation, An immune network solution, Structural Optimization, 12, 11-15, 1996. 14.Holland, J.H. Adaptation in naturel and artificial systems, MIT Press, Cambridge,1975. 15.Homaifar, A., Lai, S.H.Y. and Qi, X. Constrained optimization via genetic algorithms, Simulation, 62, 242-254, 1994. 16.Joines, J. and Houck, C. On the use of non-stationary penalty functions to solve non-linear constrained optimization problems with GAs, Procee