Improving the performance of Stochastic Dual Dynamic Programming

• Presents two tree traversing strategies for SDDP.
• Presents three cut selection algorithms to improve SDDP performance.
• Considers the whole Brazilian Power System in our computational results.
• Significant reduction in computational time without compromising the policy.

This paper is concerned with tuning the Stochastic Dual Dynamic Programming algorithm to make it more computationally efficient. We report the results of some computational experiments on a large-scale hydrothermal scheduling model developed for Brazil. We find that the best improvements in computation time are obtained from an implementation that increases the number of scenarios in the forward pass with each iteration and selects cuts to be included in the stage problems in each iteration. This gives an order of magnitude decrease in computation time with little change in solution quality.