By Topic

A parallel repair genetic algorithm to solve the unit commitment problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
J. M. Arroyo ; Dept. of Electr. Eng., Univ. de Castilla-La Mancha, La Mancha, Spain ; A. J. Conejo

This paper addresses the unit commitment problem of thermal units. This optimization problem is large-scale, combinatorial, mixed-integer, and nonlinear. Exact solution techniques to solve it are not currently available. This paper proposes a novel repair genetic algorithm conducted through heuristics to achieve a near optimal solution to this problem. This optimization technique is directly parallelizable. Three different parallel approaches have been developed. The modeling framework provided by genetic algorithms is less restrictive than the frameworks provided by other approaches such as dynamic programming or Lagrangian relaxation. A state-of-the-art Lagrangian relaxation algorithm is used to appraise the behavior of the proposed parallel genetic algorithm. The computing time requirement to solve problems of realistic size is moderate. The developed genetic algorithm has been successfully applied to realistic case studies.

Published in:

IEEE Transactions on Power Systems  (Volume:17 ,  Issue: 4 )