By Topic

Applications of dynamic programming to energy planning and scheduling problems

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

1 Author(s)
Robert E. Larson ; Systems Control, Inc., Palo Alto, California

Dynamic programming has long been recognized as a very powerful approach to optimization problems. However, its applicability has been somewhat limited because of the high computational requirements of the standard computational procedure. Fortunately, in recent years a number of new computational techniques have been developed for reducing the computational burden while retaining most of the desirable properties of the basic method. Many of these advanced techniques have been developed for solving problems in the area of energy system planning and scheduling. The purpose of the paper is to review a number of specific problems where dynamic programming has been successfully applied. These problems include national energy planning, utility expansion planning, generation scheduling, unit commitment, and automatic generation control. In all cases the problem formulation is given, effective dynamic programming solution algorithms are presented and experience in applying the algorithms to specific problems is cited.

Published in:

Decision and Control including the 16th Symposium on Adaptive Processes and A Special Symposium on Fuzzy Set Theory and Applications, 1977 IEEE Conference on

Date of Conference:

7-9 Dec. 1977