DocumentCode :
3157369
Title :
Using an enhanced genetic algorithm to solve the unit commitment problem
Author :
Mingyu, Zhu ; Wenhui, Cen ; Mingyou, Wang ; Peichao, Zhang
Author_Institution :
Dept. of Electr. Power Eng., Shanghai Jiaotong Univ., China
Volume :
1
fYear :
1997
fDate :
28-31 Oct 1997
Firstpage :
611
Abstract :
The genetic algorithm (GA) is a general purpose optimization technique based on mechanisms inspired from natural genetics and natural selection. It is very suitable for solving nonlinear, multi-constraint, combinatorial optimization problems which are tough for conventional methods, However, the simple genetic algorithm (SGA) may have a slow convergence or even cannot reach the global optimum. Therefore, an enhanced GA is proposed in this paper to solve the unit commitment problem in power systems. The new features of the enhanced GA include chromosome mapping, problem specific operators and local search technique. As expected, it has a significantly improved performance of finding the optimum solution to the unit commitment problem
Keywords :
convergence; genetic algorithms; load distribution; power engineering computing; problem solving; scheduling; search problems; chromosome mapping; combinatorial optimization problems; convergence; enhanced genetic algorithm; general purpose optimization technique; global optimum; local search technique; multiconstraint problem; natural genetics; natural selection; nonlinear problem; performance; power systems; problem specific operators; unit commitment; Biological cells; Chromosome mapping; Convergence; Cost function; Genetic algorithms; Load forecasting; Optimization methods; Production; Scheduling; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Processing Systems, 1997. ICIPS '97. 1997 IEEE International Conference on
Conference_Location :
Beijing
Print_ISBN :
0-7803-4253-4
Type :
conf
DOI :
10.1109/ICIPS.1997.672857
Filename :
672857
Link To Document :
بازگشت