Find in Library

We improved the serial recursion calculation process of dynamic programming and introduced parallel dynamic programming based on stage reconstruction. Through the proposed algorithm a multistage decision problem can be repeatedly reconstructed and gradually transferred to a single stage issue. This algorithm was applied to solve the optimized operation of cascade reservoirs in the lower reach of Yalong River in China. Results indicate that the calculating efficiency, compared with serial dynamic programming, can be significantly improved without sacrificing accuracy.