Abstract
The economic scheduling of power generation is considered, and an improved algorithm based on a combination of mixed integer-linear and dynamic programming presented. Mixed integer-linear programming is used to determine feasible combinations of units at each scheduling point, while a novel dynamic programming approach identifies promising scheduling routes in the time domain. The algorithm obtains the same solutions as mixed integer-linear programming, but with significant savings in the solution times required and the amount of computer memory used.

This publication has 0 references indexed in Scilit: