Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Dynamic dispatch by constructive 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
$31 $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)
Travers, D.L. ; Sch. of Electr. Eng., New South Wales Univ., Sydney, NSW, Australia ; Kaye, R.

This paper describes a new method of solving the dynamic dispatch problem. Boiler-turbine generators are characterised by variable operating costs and ramp rate constraints and costs. All system costs are piecewise linear. The method employs concepts from dynamic programming and linear programming. Dispatch decisions that minimise system variable cost and marginal costs are determined. Generator outputs are not discretised. Efficiency gains over dynamic programming are achieved by exploiting the underlying convex geometry of the problem and avoiding discretisation of the state space

Published in:

Power Systems, IEEE Transactions on  (Volume:13 ,  Issue: 1 )