An improved multi-area unit commitment and economic dispatch algorithm is proposed. The approach supplements the traditional dynamic programming unit commitment with heuristic adjustments to refine the commitment schedule in each area. A global economic dispatch scheme coordinates the transactions between areas. A new tie-line constraint checking is included which is simple and effective. The overall algorithm can be implemented on an IBM-PC, which can process a fairly large system in a reasonable period of time. Experimental results show the application potential of this method to general multi-area power generation scheduling problems.
No takes yet. Share an insight, caveat, or question.
Ouyang et al. (1991) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: