TY - JOUR
T1 - An efficient unit commitment schedule by combining of continuous relaxation method and genetic algorithm
AU - Tokoro, Ken Ichi
AU - Masuda, Yasushi
AU - Nishino, Hisakazu
PY - 2007/1/1
Y1 - 2007/1/1
N2 - This paper proposes a genetic algorithm for solving a unit commitment schedule problem of electric generators, which formally is a mixed integer nonlinear programming problem. A chromosome represents a partial solution of binary variables. The fitness of an individual is evaluated based upon a solution of the problem where all free variables in the chromosome are relaxed to be continuous. Numerical experiments show that the proposed algorithm outperforms Lagrangian relaxation based methods developed so far.
AB - This paper proposes a genetic algorithm for solving a unit commitment schedule problem of electric generators, which formally is a mixed integer nonlinear programming problem. A chromosome represents a partial solution of binary variables. The fitness of an individual is evaluated based upon a solution of the problem where all free variables in the chromosome are relaxed to be continuous. Numerical experiments show that the proposed algorithm outperforms Lagrangian relaxation based methods developed so far.
KW - Genetic algorithm mixed integer nonlinear optimization
KW - Optimization
KW - Unit commitment problem
UR - http://www.scopus.com/inward/record.url?scp=34548859263&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34548859263&partnerID=8YFLogxK
U2 - 10.1541/ieejeiss.127.1452
DO - 10.1541/ieejeiss.127.1452
M3 - Article
AN - SCOPUS:34548859263
SN - 0385-4221
VL - 127
SP - 1452-1459+22
JO - IEEJ Transactions on Electronics, Information and Systems
JF - IEEJ Transactions on Electronics, Information and Systems
IS - 9
ER -