Unit Commitment Optimal Research Based on the Improved Genetic Algorithm

This paper proposes the unit commitment problems which can be solved by the improved Genetic Algorithm (GA). In this improved GA, the variables of the unit commitment problems are charged into the Genetic operators by binary coding. The best individual reserve is to be proposed and can be used in th...

Full description

Saved in:
Bibliographic Details
Main Authors: Rui Ma, Yingmin Huang, Manhui Li
Format: Conference Proceeding
Language:English
Subjects:
Best Individual Reserve
BinaryCoding
Biological cells
Dynamic programming
Economics
Gallium
Genetic Algorithm
Genetic algorithms
Genetics
Power generation
Unit Commitment
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper proposes the unit commitment problems which can be solved by the improved Genetic Algorithm (GA). In this improved GA, the variables of the unit commitment problems are charged into the Genetic operators by binary coding. The best individual reserve is to be proposed and can be used in the genetic operating. This paper utilizes C++ language compilation to compare the two different 6-unit commitments. One is based on GA with the best individual reserve and the other is base on traditional GA. The results show that the proposed GA with the best individual reserve is an effective method to solve the unit commitment problems and also has important meaning in electricity grid operation, energy conservation and emission reduction.
DOI:10.1109/ICICTA.2011.83