
-
Books
-
Education
-
eBooks
-
Audio Books
-
Film & TV
-
Calendars, Diaries & Stationery
-
Giftshop
Reservoir operation is a multi-objective optimization problem, and is traditionally solved with dynamic programming (DP) and stochastic dynamic programming (SDP) algorithms. The thesis presents novel algorithms for optimal reservoir operation, named nested DP (nDP), nested SDP (nSDP), nested… more
Reservoir operation is a multi-objective optimization problem, and is traditionally solved with dynamic programming (DP) and stochastic dynamic programming (SDP) algorithms. The thesis presents novel algorithms for optimal reservoir operation, named nested DP (nDP), nested SDP (nSDP), nested reinforcement learning (nRL) and their multi-objective (MO) variants, correspondingly MOnDP, MOnSDP and MOnRL.
The idea is to include a nested optimization algorithm into each state transition, which reduces the initial problem dimension and alleviates the curse of dimensionality. These algorithms can solve multi-objective optimization problems, without significantly increasing the algorithm complexity or the computational expenses. It can additionally handle dense and irregular variable discretization. All algorithms are coded in Java and were tested on the case study of the Knezevo reservoir in the Republic of Macedonia.
Nested optimization algorithms are embedded in a cloud application platform for water resources modeling and optimization. The platform is available 24/7, accessible from everywhere, scalable, distributed, interoperable, and it creates a real-time multiuser collaboration platform.
This thesis contributes with new and more powerful algorithms for an optimal reservoir operation and cloud application platform. All source codes are available for public use and can be used by researchers and practitioners to further advance the mentioned areas.
This item is delivered digitally
Thanks for reviewing Nested algorithms for optimal reservoir operation and their embedding in a decision support platform. We will process your review. Accepted reviews will be posted within 3-7 business days.
Be the first to know, stay up to date with what's trending and get staff picks in your inbox with our newsletter
Public: Allow anyone to view or shop your List
Private: No one can view or shop your List
We have kept your A&R details for your new Angus & Robertson account
We also noticed that you have previously shopped at Bookworld. Would you like us to keep your Bookworld order history?
We also noticed that you have an account on Bookworld. Would you like us to keep your Bookworld details, including delivery addresses, order history and citizenship information?
Share This eBook