Real time production optimization in upstream petroleum production - Applied to the Troll West oil rim

Similar documents
Column Generation and its applications

Available online at ScienceDirect. IFAC-PapersOnLine 48-6 (2015)

Improving Dual Bound for Stochastic MILP Models Using Sensitivity Analysis

Surrogate Gradient Algorithm for Lagrangian Relaxation 1,2

15.082J and 6.855J. Lagrangian Relaxation 2 Algorithms Application to LPs

Use of Time-Varying Oil Price in Short-term Production Optimization for a Reservoir

Polyhedral Compilation Foundations

Convex Optimization and Machine Learning

ASHORT product design cycle is critical for manufacturers

ROBUST TUNING TO IMPROVE SPEED AND MAINTAIN ACCURACY OF FLOW SIMULATION. OPM summit October, Bergen Rohith Nair

Lagrangean Methods bounding through penalty adjustment

Optimal Network Flow Allocation. EE 384Y Almir Mutapcic and Primoz Skraba 27/05/2004

Integral equation method for anisotropic inversion of towed streamer EM data: theory and application for the TWOP survey

A set-based approach to robust control and verification of piecewise affine systems subject to safety specifications

Batch Scheduling of MultiProduct Pipeline Networks

NOTATION AND TERMINOLOGY

MINLP applications, part II: Water Network Design and some applications of black-box optimization

Solving a Network Flow Decision Problem with Sampled Nonlinearities

Object Oriented Simulation of Multiphase Flow

S0432 NEW IDEAS FOR MASSIVELY PARALLEL PRECONDITIONERS

ME 555: Distributed Optimization

Lagrangean relaxation - exercises

Parallel Branch & Bound

SPE Distinguished Lecturer Program

Outline. Column Generation: Cutting Stock A very applied method. Introduction to Column Generation. Given an LP problem

Column Generation: Cutting Stock

Lecture 4 Duality and Decomposition Techniques

DISTRIBUTED NETWORK RESOURCE ALLOCATION WITH INTEGER CONSTRAINTS. Yujiao Cheng, Houfeng Huang, Gang Wu, Qing Ling

Introduction to Mathematical Programming IE406. Lecture 20. Dr. Ted Ralphs

Programming, numerics and optimization

The Size Robust Multiple Knapsack Problem

Module 1 Lecture Notes 2. Optimization Problem and Model Formulation

Mathematical and Algorithmic Foundations Linear Programming and Matchings

SMART WELL MODELLING. Design, Scenarios and Optimisation

and 6.855J Lagrangian Relaxation I never missed the opportunity to remove obstacles in the way of unity. Mohandas Gandhi

Fast Method for Maximum-Flow Problem with Minimum-Lot Sizes

Robust validation of network designs under uncertain demands and failures

An Introduction to Dual Ascent Heuristics

Fundamentals of Integer Programming

Ali Abur Northeastern University Department of Electrical and Computer Engineering Boston, MA 02115

Rate-Distortion Optimized Streaming of. Mohamed Hefeeda & ChengHsin Hsu

Mixed Integer Non-linear Optimization for Crude Oil Scheduling

A robust optimization based approach to the general solution of mp-milp problems

Abstract The generation of a reservoir development plan with well locations, given a reservoir property map and a set of infrastructure constraints, r

Recursive column generation for the Tactical Berth Allocation Problem

Dynamic Content Allocation for Cloudassisted Service of Periodic Workloads

The Alternating Direction Method of Multipliers

NUMERICAL INVESTIGATION OF THE FLOW BEHAVIOR INTO THE INLET GUIDE VANE SYSTEM (IGV)

EAS Resources User Guide. November 2015

CHAPTER 8 DISCUSSIONS

Short-term Production Optimization of Offshore Oil and Gas Production Using Nonlinear Model Predictive Control

A new hybrid slurry CFD model compared with experimental results

Analysis and optimization methods of graph based meta-models for data flow simulation

/ Approximation Algorithms Lecturer: Michael Dinitz Topic: Linear Programming Date: 2/24/15 Scribe: Runze Tang

Today. Golden section, discussion of error Newton s method. Newton s method, steepest descent, conjugate gradient

Two-stage column generation

Using SAS/OR to Optimize Scheduling and Routing of Service Vehicles

Th Volume Based Modeling - Automated Construction of Complex Structural Models

Crash-Starting the Simplex Method

B553 Lecture 12: Global Optimization

3 INTEGER LINEAR PROGRAMMING

Predicting Tumour Location by Modelling the Deformation of the Breast using Nonlinear Elasticity

EFFICIENT PRODUCTION OPTIMIZATION USING FLOW NETWORK MODELS. A Thesis PONGSATHORN LERLERTPAKDEE

Selected Topics in Column Generation

Computational Complexity CSC Professor: Tom Altman. Capacitated Problem

AM 221: Advanced Optimization Spring 2016

OPTIMIZATION FOR AUTOMATIC HISTORY MATCHING

Lagrangian Relaxation: An overview

Mathematical Methods in Fluid Dynamics and Simulation of Giant Oil and Gas Reservoirs. 3-5 September 2012 Swissotel The Bosphorus, Istanbul, Turkey

Erosion modeling to improve asset life prediction

PhD Student. Associate Professor, Co-Director, Center for Computational Earth and Environmental Science. Abdulrahman Manea.

Optimization. Using Analytic Solver Platform REVIEW BASED ON MANAGEMENT SCIENCE

6 Randomized rounding of semidefinite programs

Some Open Problems in Graph Theory and Computational Geometry

56:272 Integer Programming & Network Flows Final Exam -- December 16, 1997

Solving lexicographic multiobjective MIPs with Branch-Cut-Price

Bilinear Programming

Closing the Loop via Scenario Modeling in a Time-Lapse Study of an EOR Target in Oman

SPEED-UP GEARBOX SIMULATIONS BY INTEGRATING SCORG. Dr. Christine Klier, Sahand Saheb-Jahromi, Ludwig Berger*

Advanced Operations Research Techniques IE316. Quiz 2 Review. Dr. Ted Ralphs

Nonlinear output constraints handling for production optimization of oil reservoirs

T6: Position-Based Simulation Methods in Computer Graphics. Jan Bender Miles Macklin Matthias Müller

OPTIMIZATION METHODS

Contents. Preface CHAPTER III

IMPROVING THE NUMERICAL ACCURACY OF HYDROTHERMAL RESERVOIR SIMULATIONS USING THE CIP SCHEME WITH THIRD-ORDER ACCURACY

Integration of Geostatistical Modeling with History Matching: Global and Regional Perturbation

Network Flows. 7. Multicommodity Flows Problems. Fall 2010 Instructor: Dr. Masoud Yaghini

TELCOM2125: Network Science and Analysis

Stochastic Separable Mixed-Integer Nonlinear Programming via Nonconvex Generalized Benders Decomposition

MAR 572 Geophysical Simulation

Outline. Robust MPC and multiparametric convex programming. A. Bemporad C. Filippi. Motivation: Robust MPC. Multiparametric convex programming

An MILP Model for Short Term Scheduling. of a Special Class of Multipurpose Batch Plants

The University of Jordan Department of Mathematics. Branch and Cut

CS 372: Computational Geometry Lecture 10 Linear Programming in Fixed Dimension

ISE203 Optimization 1 Linear Models. Dr. Arslan Örnek Chapter 4 Solving LP problems: The Simplex Method SIMPLEX

Abstract. 1 Introduction

A hybrid slurry CFD model: Euler-Euler to Euler-Lagrange

From final point cuts to!-polyhedral cuts

CS 534: Computer Vision Segmentation and Perceptual Grouping

Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Transcription:

Real time production optimization in upstream petroleum production - Applied to the Troll West oil rim Vidar Gunnerud, Bjarne Foss Norwegian University of Science and Technology - NTNU Trondheim, Norway (2007-2014) Outline 1. Problem formulation and today's solution methods and work process at Troll C 2. New Solution method: Dynamic piecewise linearization and Lagrangian decomposition 3. Troll West oil rim Initial results 1

Petroleum production - Decision horizons vary a lot Focus in this work Oilfield Review 2006 2

Production optimization - Optimizing on a day-week horizon Typical optimization problem Maximize oil production while honoring constraints related to the underground hydrocarbon reservoir wells pipelines downstream processing equipment (separators, compressors,...) Decisions variables Production valve on each well (often between 10 and 100 wells) Gas injection valves (on some wells) Routing of the reservoir fluid (often a well may be routed to two different production lines) 3

Platform Sea bed Production optimization - Stylistic view Typical optimization problem One of eight Troll C clusters Maximize oil production while honoring constraints Decisions variables Production valve on each well Gas injection valves Routing of the reservoir fluid Under ground reservoir Typical system boundaries Upstream: Underground hydrocarbon reservoir Downstream: Inlet separator on downstream processing equipment 4

Production optimization - Challenges The optimization problem is a (large) nonlinear programming problem with integer variables Well models can be highly nonlinear Pressure drop models for pipelines are nonlinear Present optimization technology is a constraining factor for real-time production optimization 5

Today s solution methods GORM (Gas-Oil Ratio Model In-House model Simplified reservoir model Models gas coning Adjusted to each well Troll: 100 GORM models GAP (General allocation program) Commercial software Models the flow condition in the network and operational constraints Does not have an appropriate gas coning model Troll: 17 GAP models (clusters) 6 Ref. Duenas, 2007

Todays solution methods Production Data Wellbore Info GOR Prediction Optimal P, inj. rates Routing 7 Ref. Duenas, 2007

8 Today s solution methods The integrated tools

New methodological foundation Methodological foundation for our work Dynamic piecewise linearization To linearize the problem Lagrangian decomposition To split the problem 9

Piecewise linearization of Dynamic piecewise linearization - principle f ( x) = x 2 By a modal formulation a nonlinear function is transformed into a piecewise linear function At most two adjacent s can be non-zero Converts a NP problem to a MILP problem For Troll this means piecewise linear well performance curves piecewise linear pressure drop models 10

Dynamic piecewise linearization - principle Illustration of a dynamical piecewise linearized well performance curve To minimize error due to piecewise linearization, good accuracy and small intervals between interpolation coordinates are needed This again results in a large number of variables and will hence be computationally expensive To handle this, it is possible to dynamically insert interpolation coordinates in demanding areas 11

Dynamic piecewise linearization - principle Solves the problem only containing a small set of interpolation coordinates (coarse resolution) Locates the solution Inserts more interpolation coordinates in that area Re-optimizes Converges when acceptable accuracy close to the solution is achieved 12

Lagrangian decomposition (LD) is a method to decompose an optimization problem into two or more disjoint (and hence smaller) problems LD may be efficient for certain network-type problems Lagrangian decomposition principle Relax the comman constraint The LP problem can be decomposed provided the Lagrangian multiplier for the common constraint is known 13

To solve a Lagrangian decomposed problem is a iterative procedure Solve both problem with initial Lagrangian multipliers Check feasibility with respect to relaxed constraint Calculate new Lagrangian multipliers based on heuristic Feasible objective function give lower bound, Lagrangian function gives upper bound Lagrangian decomposition principle Relaxed constraint Objective function Lagrangian function 14

Constraint to relax gas processing constraint C GAS TOT Lagrangian decomposition Troll C j Clusters q GAS j One of eight Troll C clusters Lagrangian function augmenting the objective function with the common gas processing constraint OIL GAS GAS GAS Max _ Z = q λ ( C q ) j Clusters j TOT j j Clusters Objective for each cluster Max _ Z = q λ q OIL GAS GAS j j j Note: The overall optimization problem can be split into 8 (much) smaller problems! 15

Complete algorithm combining Dynamic piecewise linearization and Lagrangian decomposition Solves the problem for each cluster Calculates the total gas production Compare gas production with total gas capacity constraint Re-optimizes Converges when maximum oil production is found, while honoring the gas capacity constraint 16

17 Implementation

Troll C case and results Tested on two clusters (11 wells) plus pipeline system Results compared with results using GAP (commercial) software Results are promising Challenges numerical instability robustness Problem size are highly scalable (constraints 200-1000, variables 50 000 2 mill) Solution time, highly dependent of problem and problem size (5 min 10 hours) 18

Collabration with CMU Professor Erik Ydstie s group PhD student - Michael Wartmann They have developed an network based analysis of decision making in complex organizations Based on thermodynamics Basic conservation laws for assets and liabilities 19

Collabration with CMU This network based Methodological foundation will be apply to optimization in upstream petroleum production Troll C will be used as test case I will visit CMU Michael Wartmann has/will visit NTNU Professor Ydstie will visit NTNU on regular basis 20

Conclusions and further work New algorithm for production optimization has been developed Algorithm is based on a combination of Lagrangian decomposition and dynamic piecewise linearization of nonlinear models Preliminary test results are promising Focus will lie on further development of Dynamic piecewise linearization Different Lagranigan decomposition methods will be tested Troll C will be used as test case Consider dynamic well models Work will be continued in my PhD thesis project in cooperation with: Hydro (Marta D. Diez) Carnegie Mellon University (Professor Erik Ydstie), Industrial Economy and Technology Management NTNU (Bjørn Nygreen) And others (Dept. of Petroleum Engineering and Applied Geophysics) 21