A new genetic algorithm approach for unit commitment
This paper presents a new genetic algorithm approach to solve the unit commitment problem in electric power systems. In the proposed algorithm, coding the solution of the unit commitment problem is based on mixing binary and decimal representations. A fitness function is constructed from the total o...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | , , |
| التنسيق: | article |
| منشور في: |
1997
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://eprints.kfupm.edu.sa/id/eprint/14247/1/14247_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14247/2/14247_2.doc |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | This paper presents a new genetic algorithm approach to solve the unit commitment problem in electric power systems. In the proposed algorithm, coding the solution of the unit commitment problem is based on mixing binary and decimal representations. A fitness function is constructed from the total operating cost of the generating units without penalty terms. Genetic operators are implemented to enhance the search speed and to save memory space. The problem under consideration includes two linked subproblems: a combinatorial optimization problem and a nonlinear programming problem. The former is solved using the proposed genetic algorithm while the latter problem is solved via a quadratic programming routine. Numerical results showed an improvement in the solutions costs compared to the results reported in the literature |
|---|