Dynamic dispatch by constructive dynamic programming

Author

Travers, Dean L. ; Kaye, R. John

Author_Institution

Sch. of Electr. Eng., New South Wales Univ., Sydney, NSW, Australia

Volume

13

Issue

1

fYear

1998

fDate

2/1/1998 12:00:00 AM

Firstpage

72

Lastpage

78

Abstract

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

Keywords

boilers; costing; dynamic programming; economics; linear programming; load dispatching; power system planning; steam power stations; steam turbines; turbogenerators; boiler-turbine generators; constructive dynamic programming; convex geometry; dynamic dispatch problem; operating costs; ramp rate constraints; steam power plants; Character generation; Costs; Dynamic programming; Geometry; Lagrangian functions; Linear programming; Power generation economics; Power system dynamics; Power system economics; State-space methods;

fLanguage

English

Journal_Title

Power Systems, IEEE Transactions on

Publisher

ieee

ISSN

0885-8950

Type

jour

DOI

10.1109/59.651616

Filename

651616