Stochastic Optimization

Slides:



Advertisements
Similar presentations
Dr. Miguel Bagajewicz Sanjay Kumar DuyQuang Nguyen Novel methods for Sensor Network Design.
Advertisements

ECE 8443 – Pattern Recognition LECTURE 05: MAXIMUM LIKELIHOOD ESTIMATION Objectives: Discrete Features Maximum Likelihood Resources: D.H.S: Chapter 3 (Part.
Dynamic Programming In this handout A shortest path example
1 12. Principles of Parameter Estimation The purpose of this lecture is to illustrate the usefulness of the various concepts introduced and studied in.
Capacity of Wireless Channels
In this handout Stochastic Dynamic Programming
Markov processes in a problem of the Caspian sea level forecasting Mikhail V. Bolgov Water Problem Institute of Russian Academy of Sciences.
Optimization Linear Programming and Simplex Method
D Nagesh Kumar, IIScOptimization Methods: M7L1 1 Integer Programming All Integer Linear Programming.
D Nagesh Kumar, IIScOptimization Methods: M3L1 1 Linear Programming Preliminaries.
Review of Reservoir Problem OR753 October 29, 2014 Remote Sensing and GISc, IST.
Linear Programming Applications
D Nagesh Kumar, IIScOptimization Methods: M5L4 1 Dynamic Programming Other Topics.
MNG221- Management Science –
Managerial Economics Managerial Economics = economic theory + mathematical eco + statistical analysis.
Generalized Semi-Markov Processes (GSMP)
D Nagesh Kumar, IIScOptimization Methods: M1L3 1 Introduction and Basic Concepts (iii) Classification of Optimization Problems.
Stochastic Linear Programming by Series of Monte-Carlo Estimators Leonidas SAKALAUSKAS Institute of Mathematics&Informatics Vilnius, Lithuania
Markov Decision Processes1 Definitions; Stationary policies; Value improvement algorithm, Policy improvement algorithm, and linear programming for discounted.
ECES 741: Stochastic Decision & Control Processes – Chapter 1: The DP Algorithm 31 Alternative System Description If all w k are given initially as Then,
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
D Nagesh Kumar, IIScOptimization Methods: M5L2 1 Dynamic Programming Recursive Equations.
D Nagesh Kumar, IIScOptimization Methods: M3L2 1 Linear Programming Graphical method.
PROBABILITY AND STATISTICS FOR ENGINEERING Hossein Sameti Department of Computer Engineering Sharif University of Technology Principles of Parameter Estimation.
Generalized Semi- Markov Processes (GSMP). Summary Some Definitions The Poisson Process Properties of the Poisson Process  Interarrival times  Memoryless.
D Nagesh Kumar, IIScOptimization Methods: M2L4 1 Optimization using Calculus Optimization of Functions of Multiple Variables subject to Equality Constraints.
D Nagesh Kumar, IIScOptimization Methods: M4L4 1 Linear Programming Applications Structural & Water Resources Problems.
D Nagesh Kumar, IIScOptimization Methods: M6L5 1 Dynamic Programming Applications Capacity Expansion.
(iii) Lagrange Multipliers and Kuhn-tucker Conditions D Nagesh Kumar, IISc Introduction to Optimization Water Resources Systems Planning and Management:
Fuzzy Optimization D Nagesh Kumar, IISc Water Resources Planning and Management: M9L1 Advanced Topics.
Multi-objective Optimization
Linear Programming and Applications
Water Resources System Modeling
Stochastic Optimization
D Nagesh Kumar, IIScOptimization Methods: M5L1 1 Dynamic Programming Introduction.
Multi-objective Optimization
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
Introduction to Optimization
Genetic Algorithms D Nagesh Kumar, IISc Water Resources Planning and Management: M9L2 Advanced Topics.
(i) Preliminaries D Nagesh Kumar, IISc Water Resources Planning and Management: M3L1 Linear Programming and Applications.
(iii) Optimization and Simulation Introduction and Basic Components D. Nagesh Kumar, IISc Water Resources Systems Planning and Management: M1L3.
Urban Stormwater Management D Nagesh Kumar, IISc Water Resources Planning and Management: M8L6 Water Resources Systems Modeling.
Introduction and River Basin Simulation D Nagesh Kumar, IISc Water Resources Planning and Management: M7L1 Simulation.
Stochastic Processes and Transition Probabilities D Nagesh Kumar, IISc Water Resources Planning and Management: M6L5 Stochastic Optimization.
Uncertainty and Reliability Analysis D Nagesh Kumar, IISc Water Resources Planning and Management: M6L2 Stochastic Optimization.
Linear Programming and Applications
D Nagesh Kumar, IIScOptimization Methods: M8L6 1 Advanced Topics in Optimization Applications in Civil Engineering.
Groundwater Systems D Nagesh Kumar, IISc Water Resources Planning and Management: M8L3 Water Resources System Modeling.
D Nagesh Kumar, IIScOptimization Methods: M8L1 1 Advanced Topics in Optimization Piecewise Linear Approximation of a Nonlinear Function.
D Nagesh Kumar, IIScOptimization Methods: M6L1 1 Dynamic Programming Applications Design of Continuous Beam.
Introduction and Preliminaries D Nagesh Kumar, IISc Water Resources Planning and Management: M4L1 Dynamic Programming and Applications.
D Nagesh Kumar, IISc Water Resources Systems Planning and Management: M2L2 Introduction to Optimization (ii) Constrained and Unconstrained Optimization.
(iii) Simplex method - I D Nagesh Kumar, IISc Water Resources Planning and Management: M3L3 Linear Programming and Applications.
Reliability Engineering
Dynamic Programming - DP December 18, 2014 Operation Research -RG 753.
Expectations of Random Variables, Functions of Random Variables
Engineering Economics (2+0)
Linear Programming Revised Simplex Method, Duality of LP problems and Sensitivity analysis D Nagesh Kumar, IISc Optimization Methods: M3L5.
12. Principles of Parameter Estimation
Water Resources Planning and Management Daene McKinney
Industrial Engineering Dep
Dynamic Programming Applications
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Dynamic Programming Lecture 13 (5/31/2017).
Dynamic Programming and Applications
Markov Decision Problems
12. Principles of Parameter Estimation
Further Topics on Random Variables: Covariance and Correlation
Further Topics on Random Variables: Covariance and Correlation
Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 3
Presentation transcript:

Stochastic Optimization Stochastic DP Water Resources Planning and Management: M6L6 D Nagesh Kumar, IISc

Objectives To apply stochastic dynamic programming in reservoir operation Water Resources Planning and Management: M6L6 D Nagesh Kumar, IISc

Introduction Application of SDP to reservoir operation problem Inflow to the reservoir is considered as a random variable Reservoir storage at the beginning of period t and release during the period t are treated as state variables All variables involved in the decision process, such as the reservoir storage, inflow, and release are discretized into a finite number of class intervals A class interval for a variable has a representative value, generally taken as its midpoint. Water Resources Planning and Management: M6L6 D Nagesh Kumar, IISc

SDP - Reservoir Operation Notations Q denotes the inflow i and j are the class intervals (also referred to as states) of inflow in period t and period t + 1, respectively The representative values of inflow for the class i in period t and class j in period t+1 are denoted by Qit and Qj,t+1, respectively S denotes the reservoir storage k and l are the storage class intervals in periods t and t +1, respectively The representative values for storage in the class intervals k and l are denoted by Skt, and Sl,t+1, respectively Water Resources Planning and Management: M6L6 D Nagesh Kumar, IISc

SDP - Reservoir Operation… According to the storage continuity, it can be expressed as Rkilt = Skt + Qit – Eklt – Sl,t+1 where Rkilt is the reservoir release corresponding to the initial reservoir storage Skt, the final reservoir storage Sl,t+1, and the evaporation loss Eklt. The loss Eklt, depends on the initial and final reservoir storages, Skt and Sl,t+1 Since the inflow Q is a random variable, the reservoir storage and the release are also random variables The system performance measure depends on the state of the system defined by the storage class intervals k and l, and the inflow class interval i for the period t. System performance measure for a period t is denoted as Bkilt which corresponds to an initial storage state k, inflow state i, and final storage state l in period t. Water Resources Planning and Management: M6L6 D Nagesh Kumar, IISc

SDP - Reservoir Operation… The system performance measures can be: For example: Amount of hydropower generated when a release of Rkilt is made from the reservoir, and the reservoir storages (which determine the head available for power generation) at the beginning and end of the period are respectively Skt and Sl,t+1. Following backward recursion, the computations are assumed to start at the last period T of a distant year in the future and proceed backwards Each time period denotes a stage in the dynamic programming i.e., n = 1 when t=T; n=2 when t = T - 1, etc. The index t takes values from T to 1, and the index n progressively increases with the stages in the SDP. Time periods Stages n = 1 n = 2 n = T-1 n = T n = T+1 n = T+2 t =T t = T-1 t = 2 t = 1 t = T Water Resources Planning and Management: M6L6 D Nagesh Kumar, IISc

Recursive Relationship Let fnt (k, i) denote the maximum expected value of the system performance measure up to the end of the last period T (i.e. for periods t, t + 1, ..., T), when n stages are remaining, and the time period corresponds to t. With only one stage remaining (i.e. n = 1 and t = T), For a given k and i, only those values of l are feasible that result in a non-negative value of release, Rkilt. Since this is the last period in computation, the performance measure Bkilt is determined with certainty for the known values of k, i and l. Water Resources Planning and Management: M6L6 D Nagesh Kumar, IISc

Recursive Relationship… When we move to the next stage, (n = 2, t = T - 1), the maximum value of the expected performance of the system is written as When the computations are carried out for stage 2, period T - 1, the inflow during the period is known. Inflow during the succeeding period T is also needed since we are interested in obtaining the maximum expected system performance up to the end of the last period T. Since this is not known with certainty, the expected value of the system performance is got by using the inflow transition probability PijT-1 for the period T - 1. The term within the summation denotes the maximized expected value of the system performance up to the end of the last period T, when the inflow state during the period T - 1 is i. Water Resources Planning and Management: M6L6 D Nagesh Kumar, IISc

Recursive Relationship… The search for the optimum value of the performance is made over the end-of-the period storage l. Since f1T(k, i) is already determined in stage 1, for all values of k and i, f2T-1(k, i) given by above equation may be determined. The term {feasible l}, indicates that the search is made only over those end-of-the-period storages which result in a non-negative release Rkilt or satisfy any other constraints. The relationship may be generalized for any stage n and period t as Water Resources Planning and Management: M6L6 D Nagesh Kumar, IISc

Recursive Relationship… Solving the equation recursively will yield a steady state policy within a few annual cycles, if the inflow transition probabilities Pijt are assumed to remain the same every year, which implies that the reservoir inflows constitute a stationary stochastic process. In general, the steady state is reached when the expected annual system performance, [f tn+T (k, i) - f tn (k, i)] remains constant for all values of k, i, and t. When the steady state is reached, the optimal end-of-the-period storage class intervals, l, are defined for given k and i for every period t in the year. This defines the optimal steady state policy and is denoted by l*(k, i, t). Water Resources Planning and Management: M6L6 D Nagesh Kumar, IISc

Inflow transition probabilities Example Obtain steady state policy for the following data, when the objective is to minimize the expected value of the sum of the square of deviations of release and storage from their respective targets, over a year with two periods. Neglect evaporation loss. If the release is greater than the release target, the deviation is set to zero. Target Storage, TS=30; Target Release, Tr=30; Bkilt = (Rkilt –Tr)2 + (Skt –Ts)2 For period 1 For period 2 Inflow transition probabilities t = 2 t = 1 j i 1 2 0.5 0.4 0.6 0.3 0.7 0.8 0.2 Inflow and Storage i Qit k Skt 1 15 30 35 20 2 25 40 45 Water Resources Planning and Management: M6L6 D Nagesh Kumar, IISc

Example… Solution: Bkilt values for all k, i, l, and t For period 1 For period 2 k Skt i Qkt l Skt+1 Ekilt Rkilt (Skt- Ts)2 (Rkilt- Tr)2 Bkilt 1 30 15 20 25 2 225 35 40 100 125 45 k Skt i Qkt l Skt+1 Ekilt Rkilt (Skt- Ts)2 (Rkilt- Tr)2 Bkilt 1 20 35 30 25 100 125 2 40 15 225 325 45 Water Resources Planning and Management: M6L6 D Nagesh Kumar, IISc

Example… n=1, t=2 n=2, t=1 k i Bkilt f12 (k,i) l* l =1 l =2 1 125 325 100 25 1, 2 k i Bkilt f21 (k,i) l* l =1 l =2 1 137.5 225 2 107.5 25 212.5 125 207.5 100 Water Resources Planning and Management: M6L6 D Nagesh Kumar, IISc

Example… n=3, t=2 n=4, t=1 n=5, t=2 k i Bkilt f32 (k,i) l* l =1 l =2 1 195 435 2 215 245 70 135 115 120 k i Bkilt f41 (k,i) l* l =1 l =2 1 230 317.5 2 209 126.5 305 217.5 309 201.5 k i Bkilt f52 (k,i) l* l =1 l =2 1 292.9 532.9 2 309.3 339.3 167.9 232.9 209.3 214.3 Water Resources Planning and Management: M6L6 D Nagesh Kumar, IISc

Example… n=6, t=1 n=7, t=2 n=8, t=1 k i Bkilt f61 (k,i) l* l =1 l =2 1 326.1 413.6 2 304.3 221.8 401.1 313.6 404.3 296.8 k i Bkilt f72 (k,i) l* l =1 l =2 1 388.5 628.5 2 405.2 435.2 263.5 328.5 305.2 310.2 k i Bkilt f81 (k,i) l* l =1 l =2 1 421.9 509.4 2 400.2 317.7 49.9 409.4 500.2 392.7 Water Resources Planning and Management: M6L6 D Nagesh Kumar, IISc

Example… The computations are terminated after this stage because it is verified that the annual system performance measure remains constant. f81 (1,1) – f61 (1,1) = 421.9 – 326.1 = 95.8 Steady state policy for period 1 Steady state policy for period 2 k i l* 1 2 Water Resources Planning and Management: M6L6 D Nagesh Kumar, IISc

Bibliography / Further Reading Jain, S.K. and V.P. Singh, Water Resources Systems Planning and Management, Vol. 51, Elsevier Science, 2003. Loucks D.P. and van Beek E., ‘Water Resources Systems Planning and Management’, UNESCO Publishing, The Netherlands, 2005. Loucks, D.P., J.R. Stedinger, and D.A. Haith, Water Resources Systems Planning and Analysis, Prentice-Hall, N.J., 1981. Rao S.S., Engineering Optimization – Theory and Practice, Fourth Edition, John Wiley and Sons, 2009. Vedula S., and P.P. Mujumdar, Water Resources Systems: Modelling Techniques and Analysis, Tata McGraw Hill, New Delhi, 2005. Water Resources Planning and Management: M6L6 D Nagesh Kumar, IISc

Thank You Water Resources Planning and Management: M6L6 D Nagesh Kumar, IISc