By Topic

Generator maintenance scheduling via successive approximations dynamic programming

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)
Zurn, H.H. ; University of Waterloo, Waterloo, Ontario, Canada ; Quintana, V.H.

Host currently used thermal-generator maintenance scheduling methods schedule each unit at a time, leading in many cases to a poor local optimum or to an unfeasible solution. Considering simultaneously all units in the scheduling process, a computationally impractical method results. In this paper a piece-wise compromising method of solution is presented, which conveniently groups generating units and uses successive approximations dynamic programming. The optimal maintenance scheduling problem is formulated by employing a suitable state-space representation; most common constraints used in practice are described and a multiple objective function is presented. The effectiveness of the optimizing method is illustrated by solving a problem with data obtained from a real system. The grouping criterion presented appears to be the cornerstone of the superior performance of the proposed method.

Published in:

Power Apparatus and Systems, IEEE Transactions on  (Volume:94 ,  Issue: 2 )