OASIS Basics Computer Aided Negotiations of Water Resources Disputes.

Slides:



Advertisements
Similar presentations
Network Models Robert Zimmer Room 6, 25 St James.
Advertisements

Network Models Robert Zimmer Room 6, 25 St James.
Network Models Robert Zimmer Room 6, 25 St James.
1 Alberto Montanari University of Bologna Basic Principles of Water Resources Management.
Introduction to Mathematical Programming
Introduction to Mathematical Programming Matthew J. Liberatore John F. Connelly Chair in Management Professor, Decision and Information Technologies.
Linear Programming. Introduction: Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’,
Linear Programming Problem
Basics of Reservoir Operations Computer Aided Negotiations Fall 2008 Megan Wiley Rivera.
©GoldSim Technology Group LLC., 2012 Network Flows and Linear Programming The Mathematical Madness behind the Magic GoldSim Technology Group.
Introduction to Operations Research
Computational Methods for Management and Economics Carla Gomes Module 8b The transportation simplex method.
Water Resources Planning and Management Daene C. McKinney Optimization.
CVEN 5838 Aug 28, 2008 Lecture 2 Reservoir Capacity Yield Analysis (how to size a reservoir and measure its performance)
Example 14.3 Football Production at the Pigskin Company
Long Term Storage Long term storage means to store water during high inflows years for the benefit of low inflows years. Long term storage means to store.
L12. Network optimization problems D. Moltchanov, TUT, Spring 2008 D. Moltchanov, TUT, Spring 2014.
Pipe Networks Pipeline systems Pumps pipe networks measurements
Computational Methods for Management and Economics Carla Gomes Module 4 Displaying and Solving LP Models on a Spreadsheet.
Chapter 14 The Production Cycle.
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
Strategic Capacity Planning for Products and Services Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without.
Chapter 19 Linear Programming McGraw-Hill/Irwin
Chapter 12 Inventory Models
Klamath Basin Water Distribution Model Workshop. OUTLINE Brief Description of Water Distribution Models Model Setups Examples of networks and inputs Demand.
Modeling.
The Supply Chain Customer Supplier Manufacturer Distributor
Optimization Models Mathematical optimization models usually contain an objective (what to do) constraints (the rules that must be followed). Also referred.
Chapter 7 Transportation, Assignment & Transshipment Problems
Introduction A GENERAL MODEL OF SYSTEM OPTIMIZATION.
Researchers: Preet Bola Mike Earnest Kevin Varela-O’Hara Han Zou Advisor: Walter Rusin Data Storage Networks.
. 1 Transportation and Assignment Problems. . 2 Applications Physical analog of nodes Physical analog of arcs Flow Communication systems phone exchanges,
Network Optimization Problems
Chapter 24 – Multicriteria Capital Budgeting and Linear Programming u Linear programming is a mathematical procedure, usually carried out by computer software,
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
© 2007 Pearson Education Decision Making Supplement A.
1 Network Models Transportation Problem (TP) Distributing any commodity from any group of supply centers, called sources, to any group of receiving.
© 2005 Prentice Hall, Decision Support Systems and Intelligent Systems, 7th Edition, Turban, Aronson, and Liang 4-1 Chapter 4 Modeling and Analysis Turban,
Lecture 5 – Integration of Network Flow Programming Models Topics Min-cost flow problem (general model) Mathematical formulation and problem characteristics.
What is OASIS? Water resources simulation/optimization model
Location Planning and Analysis Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent.
PCWA MFP Operations Model All Models are Wrong But Some Models are Useful.
Reservoir Operation Simulation D Nagesh Kumar, IISc Water Resources Planning and Management: M7L2 Simulation.
MGMT Materials Management Systems Materials Requirements Planning Chapter 4.
IT Applications for Decision Making. Operations Research Initiated in England during the world war II Make scientifically based decisions regarding the.
Water Resources System Modeling
Stochastic Optimization
1 Optimization Techniques Constrained Optimization by Linear Programming updated NTU SY-521-N SMU EMIS 5300/7300 Systems Analysis Methods Dr.
CADSWES Engineering Enhancements New Methods and Improved Functionality Steve Setzer.
Introduction to Linear Programming and Formulation Meeting 2 Course: D Deterministic Optimization Year: 2009.
Monroe L. Weber-Shirk S chool of Civil and Environmental Engineering Pipe Networks 
Water Resources Planning and Management Daene C. McKinney System Performance Indicators.
Linear Programming and Applications
Modeling with WEAP University of Utah Hydroinformatics - Fall 2015.
The analytics of constrained optimal decisions microeco nomics spring 2016 the monopoly model (I): standard pricing ………….1optimal production ………….2 optimal.
AAT Level 3 Limiting Factors. Objectives 1. Explain what production decisions are required when resources are scarce 2. State the steps to calculate limiting.
River Basin Simulation with WEAP Water Evaluation and Planning System David Rosenberg NRM + IWRM.
River Basin Simulation with WEAP Water Evaluation and Planning System David Rosenberg CEE 5460 – Water Resources Engineering.
Steven Burian and Erfan Goharian Hydroinformatics Fall 2013
CE 3372 Water Systems design
A Multiperiod Production Problem
CANAL NETWORK CONTROL AJAY K BASU
River Basin Simulation with WEAP Water Evaluation and Planning System
Pipe Networks Pipeline systems You are here Transmission lines
Chapter 6 Network Flow Models.
L13. Capacitated and uncapacitated network design problems
Pipe Networks Pipeline systems You are here Transmission lines
Transportation and Assignment Problems
Lecture 12 Network Models.
Presentation transcript:

OASIS Basics Computer Aided Negotiations of Water Resources Disputes

2 What is OASIS ? Operational Analysis and Simulation of Integrated Systems Program for modeling the operations of water resources systems

3 What does OASIS do ? …….. and How? Simulates the routing of water through a system represented by: Nodes (points of interest) Demand Junction Reservoirs Arcs (convey water from node to node) Inflows (positive or negative, fixed by the user) Routing accounts for human control and physical constraints Terminal Reservoir Junction Arc Inflow 135 Demand Reservoir

4 Examples of Human Control Water is moved from node to node according to “operating criteria”. Water is allocated to demand nodes based on pre-established criteria Examples of Physical Constraints Storage Area Elevation (SAE) tables: Storage volume available at each water level in a reservoir Maximum flow: restriction on the arc flow imposed by a maximum gate opening Head - Flow relationships to describe the hydraulics of a canal or canal capacity Evapotranspiration: “Demand” applied to each node to account for evapotranspiration losses in a reservoir MASS BALANCE : Main constraint that is accounted for during each time step of the routing

5 What does OASIS do ? …….. and How? Water is routed (moved) through the system by calculating: Flow through arcs (arcflows), Volume stored in each node and Volume allocated to each demand node these calculations are made for every time step during a pre-established period of simulation, using a Linear Programming solver which is called every time step

6 Use of Linear Programming in OASIS OASIS automatically constructs the LP each time step, solves it, and then turns that mathematical solution into a simulated record of flows and storages The LP is internal – hidden, unless you request it Every time step, flow, storage and delivery are decision variables whose values are solved by LP.

7 Routing with a linear program You specify what to do but do not have to tell OASIS how to do it Constraints: rules that OASIS must obey Goal: rule that OASIS tries to meet Written to an objective function which the solver optimizes – determines the solution which best meets the goals within the constraints Think of the solver as a “smart operator” who obeys the laws of physics (and other specified constraints)

8 Decision Variables and State Variables Decision variable: A variable whose value is decided by the LP solver. OCL Rules are written with the values of the decision variables unknown. State variable: Any variable whose value is known. Some state variables represent decision variables from previous time steps that the LP solver has already solved. Other state variables represent external conditions (e.g. inflow, rainfall, date, time-step number)

9 Goals Goal: a rule that OASIS tries to satisfy In any time step, OASIS might not be able to satisfy all or any of a given operating goal By their nature, operating goals are in competition with each other OASIS chooses between competing goals by weights that you assign Example: “Try to deliver 45 mgd to demand node 472”.

10 Balancing Goals The modeler assigns a weight value to every operating goal in the model to construct the objective function The LP solution scores points by multiplying the weight value by the value of the associated decision variable In every time step, OASIS determines the values of the decision variables by solving the LP The solution obeys every constraint The solution is the set of decision variable values that gets the maximum number of points from the set of goals

11 Weights Every goal should be assigned a weight value Positive weights encourage actions while negative weights (penalties) discourage them. Zero weight is the same as if the goal did not exist.

12 More About Weights Assigning weights is usually simple—assign lowest to highest in hierarchical order Weights do not represent a quantity that you can measure in the real-world system Weights do represent the relative importance of the different priorities of the operators of the real-world system It gets easier with experience

13 An analogy to money Water is like money Weights are your spending/saving priorities The lp will allocate your money based on your spending/saving priorities When money is scarce, which bills do you pay first (should you satisfy a minimum flow requirement or keep water in a lake)? When money is plentiful, where should you put the extra (should you put it on the floodplain or in a lake)?

14 Example of Using Weights - 1 No benefit for moving water downstream; storage remains in node 100 and node 130 wt = 100 wt = 0 terminal wt = wt =

15 Example of Using Weights - 2 No benefit for moving water between reservoirs, but weight on terminal arc pulls from node 130 until it empties. wt = 100 wt = 0wt = 150wt = 0 terminal wt = wt =

16 Example of Using Weights - 3 No benefit for moving water between reservoirs, but weight on terminal arc pulls from node 130 until it empties, then pulls from node 100. wt = 100 wt = 0wt = 250wt = 0 terminal wt = wt =

17 Example of Using Weights - 4 Water released from node 100 gets 300 weight points, plus 100 points for being stored in node 130, so water is transferred from node 100 to node 130. wt = 100 wt = 0wt = 100 terminal wt = wt =

18 Example of Using Weights - 5 Weight on terminal arc causes the system to be drained. Moral: use weights on arcs only where necessary. wt = 100 wt = 250wt = 100 terminal wt = wt =

19 Example of Using Weights - 6 OASIS gets the same number of points whether it keeps water in the upstream reservoir or sends it to the downstream reservoir This is called alternate optima, and it should be avoided wt = 200 wt = 0 terminal wt = wt =

20 Building an OASIS model Basedata: timeseries data GUI: much of what you need to specify can be done here OCL (Operations Control Language): provides flexibility “set” the value of a variable Define new constraints and goals for the lp Create new variables, enter new data, exchange information with other programs Output: Quickview, Onevar, output.dss