This is the authors' abstract. We don't add key points for this paper.
A heuristic improvement of the truncated window dynamic programming has been studied for the unit commitment application. The proposed method employs a variable window size according to load demand increments, and corresponding experimental results indicate a substantial saving in the computation time without sacrificing the quality of the solution. An iterative process for the number of strategies saved in every stage is incorporated to fine tune the optimal solution.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
No takes yet. Share an insight, caveat, or question.
Ouyang et al. (1991) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: