An improved integer coded genetic algorithm for security constrained unit commitment problem
This paper presents a novel approach to solve the security constrained unit commitment problem using decomposition technique. The method applies an improved integer coded genetic algorithm (ICGA) to schedule the commitment states of units. ICGA technique reduces the size of chromosomes and computati...
Saved in:
| Published in: | 2008 IEEE 2nd International Power and Energy Conference pp. 1251 - 1255 |
|---|---|
| Main Authors: | , , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
IEEE
01.12.2008
|
| Subjects: | |
| ISBN: | 1424424046, 9781424424047 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This paper presents a novel approach to solve the security constrained unit commitment problem using decomposition technique. The method applies an improved integer coded genetic algorithm (ICGA) to schedule the commitment states of units. ICGA technique reduces the size of chromosomes and computation time significantly. Here, the proposed ICGA has been enhanced by using perturbation operator. Simulation results for six-bus test system exhibit the effectiveness of the proposed approach. |
|---|---|
| ISBN: | 1424424046 9781424424047 |
| DOI: | 10.1109/PECON.2008.4762668 |

