Abstract
A dynamic programming (DP) optimization model is developed for long term planning of multiple-reservoir operations. To overcome the well-known dimensionality problem associated with such a model, a heuristic approach is used to narrow the needed search algorithm within the state space of the DP model. This method can recognize many infeasible transitions from the initial to the final state of the DP stages. By diagnosing these infeasible transitions in advance and removing them from further computations, significant improvement in computational load is achieved so that the computer time for solving the model is reduced more than 50 times for the reservoir system under study. This methodology is applied to a four-reservoir system located in Iran.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
