Genetic algorithm for constrained global optimization in continuous variables
We present a stochastic global optimization algorithm, referred to as a Genetic Algorithm (GA), for solving constrained optimization problems over a compact search domain. It is a real-coded GA that converges in probability to the optimal solution. The constraints are treated through a repair operat...
محفوظ في:
| المؤلفون الرئيسيون: | , |
|---|---|
| التنسيق: | مقال |
| اللغة: | English |
| منشور في: |
2014
|
| الوصول للمادة أونلاين: | http://www.scopus.com/inward/record.url?eid=2-s2.0-28544431906&partnerID=40&md5=5ccb67a28e9ba11a4edbd9793b272221 http://cmuir.cmu.ac.th/handle/6653943832/4923 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | We present a stochastic global optimization algorithm, referred to as a Genetic Algorithm (GA), for solving constrained optimization problems over a compact search domain. It is a real-coded GA that converges in probability to the optimal solution. The constraints are treated through a repair operator. A specific repair operator is included for linear inequality constraints. © 2005 Elsevier Inc. All rights reserved. |
|---|