By Topic

Fast technique for unit commitment by genetic algorithm based on unit clustering

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 $33
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

6 Author(s)
T. Senjyu ; Fac. of Eng., Univ. of the Ryukyus, Okinawa, Japan ; A. Y. Saber ; T. Miyagi ; K. Shimabukuro
more authors

The paper presents a new approach to the large-scale unit-commitment problem. To reduce computation time and to satisfy the minimum up/down-time constraint easily, a group of units having analogous characteristics is clustered. Then, this 'clustered compress' problem is solved by means of a genetic algorithm. Besides, problem-oriented powerful tools such as relaxed-pruned ELD, intelligent mutation, shift operator etc. make the proposed approach more effective with respect to both cost and execution time. The proposed algorithm is tested using the reported problem data set. Simulation results for systems of up to 100-unit are compared with previous reported results. Numerical results show an improvement in the solution cost compared with the results obtained from a genetic algorithm with standard operations.

Published in:

IEE Proceedings - Generation, Transmission and Distribution  (Volume:152 ,  Issue: 5 )