A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

Similar documents
An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

Support Vector Machines

LECTURE NOTES Duality Theory, Sensitivity Analysis, and Parametric Programming

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

An Optimal Algorithm for Prufer Codes *

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming

A Binarization Algorithm specialized on Document Images and Photos

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

Repeater Insertion for Two-Terminal Nets in Three-Dimensional Integrated Circuits

AADL : about scheduling analysis

Parallelism for Nested Loops with Non-uniform and Flow Dependences

SPE = 1, then the. Application of this technique to a large number of wells in the Carthage field, Cotton Valley formation is presented.

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

Decision Support for the Dynamic Reconfiguration of Machine Layout and Part Routing in Cellular Manufacturing

Load-Balanced Anycast Routing

Pose, Posture, Formation and Contortion in Kinematic Systems

The Codesign Challenge

Cluster Analysis of Electrical Behavior

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

INTRODUCTION INTRODUCTION. Moisès Graells Semi-continuous processes

An Investigation into Server Parameter Selection for Hierarchical Fixed Priority Pre-emptive Systems

Classifying Acoustic Transient Signals Using Artificial Intelligence

Reducing Frame Rate for Object Tracking

Positive Semi-definite Programming Localization in Wireless Sensor Networks

SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR

Intra-Parametric Analysis of a Fuzzy MOLP

CSCI 104 Sorting Algorithms. Mark Redekopp David Kempe

CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION

Investigations of Topology and Shape of Multi-material Optimum Design of Structures

Meta-heuristics for Multidimensional Knapsack Problems

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

EVALUATION OF THE PERFORMANCES OF ARTIFICIAL BEE COLONY AND INVASIVE WEED OPTIMIZATION ALGORITHMS ON THE MODIFIED BENCHMARK FUNCTIONS

SURFACE PROFILE EVALUATION BY FRACTAL DIMENSION AND STATISTIC TOOLS USING MATLAB

5.0 Quality Assurance

Life Tables (Times) Summary. Sample StatFolio: lifetable times.sgp

A Facet Generation Procedure. for solving 0/1 integer programs

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.

A Hybrid Genetic Algorithm for Routing Optimization in IP Networks Utilizing Bandwidth and Delay Metrics

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT

3. CR parameters and Multi-Objective Fitness Function

EECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science

Electrical analysis of light-weight, triangular weave reflector antennas

Related-Mode Attacks on CTR Encryption Mode

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

Hierarchical clustering for gene expression data analysis

Virtual Machine Migration based on Trust Measurement of Computer Node

MODULE DESIGN BASED ON INTERFACE INTEGRATION TO MAXIMIZE PRODUCT VARIETY AND MINIMIZE FAMILY COST

USING GRAPHING SKILLS

LARRY SNYDER DEPT. OF INDUSTRIAL AND SYSTEMS ENGINEERING CENTER FOR VALUE CHAIN RESEARCH LEHIGH UNIVERSITY

Parallel matrix-vector multiplication

LOOP ANALYSIS. The second systematic technique to determine all currents and voltages in a circuit

UB at GeoCLEF Department of Geography Abstract

OPTIMAL CONFIGURATION FOR NODES IN MIXED CELLULAR AND MOBILE AD HOC NETWORK FOR INET

Voice capacity of IEEE b WLANs

Programming in Fortran 90 : 2017/2018

Needed Information to do Allocation

XV International PhD Workshop OWD 2013, October Machine Learning for the Efficient Control of a Multi-Wheeled Mobile Robot

An Entropy-Based Approach to Integrated Information Needs Assessment

Data Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach

A DATA ANALYSIS CODE FOR MCNP MESH AND STANDARD TALLIES

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task

Sequential Projection Maximin Distance Sampling Method

Channel 0. Channel 1 Channel 2. Channel 3 Channel 4. Channel 5 Channel 6 Channel 7

SOLUTION APPROACHES FOR THE CLUSTER TOOL SCHEDULING PROBLEM IN SEMICONDUCTOR MANUFACTURING

Data Mining For Multi-Criteria Energy Predictions

Delay Variation Optimized Traffic Allocation Based on Network Calculus for Multi-path Routing in Wireless Mesh Networks

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

A Clustering Algorithm for Chinese Adjectives and Nouns 1

Hybrid Heuristics for the Maximum Diversity Problem

LS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract

Optimal Scheduling of Capture Times in a Multiple Capture Imaging System

TPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints

Proceedings of the 2014 Winter Simulation Conference A. Tolk, S. Y. Diallo, I. O. Ryzhov, L. Yilmaz, S. Buckley, and J. A. Miller, eds.

Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments

Optimal planning of selective waste collection

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) ,

Learning to Project in Multi-Objective Binary Linear Programming

Application of Improved Fish Swarm Algorithm in Cloud Computing Resource Scheduling

A Fuzzy Goal Programming Approach for a Single Machine Scheduling Problem

Modelling a Queuing System for a Virtual Agricultural Call Center

SHAPE OPTIMIZATION OF STRUCTURES BY MODIFIED HARMONY SEARCH

MIXED INTEGER-DISCRETE-CONTINUOUS OPTIMIZATION BY DIFFERENTIAL EVOLUTION Part 1: the optimization method

Greedy Technique - Definition

Support Vector Machines

Classifier Selection Based on Data Complexity Measures *

Effective Network Partitioning to Find MIP Solutions to the Train Dispatching Problem

Optimal connection strategies in one- and two-dimensional associative memory models

Analysis of Continuous Beams in General

Support Vector Machines. CS534 - Machine Learning

A New Approach For the Ranking of Fuzzy Sets With Different Heights

Sorting Review. Sorting. Comparison Sorting. CSE 680 Prof. Roger Crawfis. Assumptions

Configuration Management in Multi-Context Reconfigurable Systems for Simultaneous Performance and Power Optimizations*

A Mixed Linear Program for a Multi-Part Cyclic Hoist Scheduling Problem

Transcription:

17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and schedulng of offshore olfelds Rchard J. Barnes and Antons Kokosss Center for Process & Informaton Systems Engneerng School of Engneerng, Unversty of Surrey, Guldford, Surrey, GU2 7XH, U.K. E-mal: a.kokosss@surrey.ac.uk Abstract Ths paper presents a general and systematc approach to address decsons n the desgn and operaton of offshore olfelds. The approach s based on the formulaton of mathematcal models that are formulated to accommodate multple producton profles. The profles can be used to assess ether the best strategy or, nstead, possble mplcatons n changng polces durng the operaton. The work decomposes the problem n two stages: the determnaton of the optmum drllng centre and the determnaton of the optmum drllng schedule to meet a specfed producton profle. The proposed method smultaneously addresses and optmzes the operaton of the man producton faclty and an arbtrary number of satellte felds. Felds and wells are selected to gve the overall lowest CAPEX for the development. The method s an mprovement over prevous work and provdes a full optmsaton of lfe-cycle drllng costs. Keywords: Offshore olfeld; Optmsaton; Drllng; Offshore platform, Producton capacty, Lfe cycle cost, Economc analyss. 1. Introducton and problem descrpton Fgure 1 shows the general schematc of offshore feld comprsed by a man feld, F1 and three satellte felds, S1, S2 and S3. The optmum drllng centre s

2 Rchard J. Barnes et al. defned as the locaton whch has the lowest total cost of drllng suffcent wells that meet a specfed producton capacty. Such a locaton s affected by the layout of the feld, the depth, locaton and the productvty of ndvdual wells. Moreover, there s an optmum, that s lowest CAPEX, development scenaro n whch the felds are brought nto producton n a sequence where maxmum beneft s acheved from each new feld n order that the target producton profle s met at mnmum CAPEX [4]. S1 Producton or Satellte Platform F1 S2 S3 Ol and gas export to trunk The determnaton of the optmum drllng centre and the most economc producton profle for a feld or group of felds s a complex problem that s based on ncomplete and mprecse data. In order to prepare a robust soluton, t s necessary to nvestgate a large number of dfferent optons of locatons, drllng profles and lfe of feld producton profles. Prevous Fgure 1 Schematc of offshore feld work [1, 2] has presented a well optmsaton method to nvestgate parameters affectng the desgn capacty and the locaton of the man capacty. The work used a sngle heurstc profle for the well producton and a yearly schedulng model to determne drllng schedules and the tmng of satellte producton. Ths paper presents a general and systematc approach to address desgn decsons and support schedulng decsons over the entre horzon. The model s formulated to accommodate multple producton profles that can be used to assess ether the best strategy or possble mplcatons n changng polces durng the operaton. The work decomposes the problem n two stages: the determnaton of the optmum drllng centre and the determnaton of the optmum drllng schedule to meet a specfed producton profle. From ths nformaton an economc analyss of the lfe of the development may be made to gude the operator to the most economc method of developng the feld. It s assumed that there s suffcent knowledge of each reservor and that the potental down-hole well locatons can be defned n terms of three dmensonal coordnates and well productvtes. From ths nformaton, the length of a well drlled from a specfed drllng centre can be calculated as a functon of the ts length. For each year target producton rates are specfed as nput data to descrbe the requred producton profle for each partcular case to be examned. The dfferent profles essentally account for dfferent scenaros. The optmal soluton determnes the drllng sequence requred to acheve the most economc

A mathematcal programmng approach to the desgn and schedulng of offshore olfelds. 3 operaton. From the data of well costs, facltes costs and producton profle, an economc analyss can be compared wth other producton profles. In all cases, the models are formulated and solved as MILP problems. 2. Locaton of the drllng centre The mathematcal model s formulated as follows. Gven a set of wells and a set of drllng locatons. For each well locaton (x, y and z coordnates are gven together wth the well productvty) the obectve s dentfy the locaton that corresponds to the mnmum drllng cost. The problem parameters nclude: T = Target feld producton. W, = The cost of drllng well from drllng centre The set of varables consst of: Z = Bnary to select or deselect well. Y = Bnary to select or deselect drllng centre. C, = The actual cost of drllng once and are selected The formulaton of the obectve s then: Cost = C, (1), The obectve functon s to mnmse the cost of drllng suffcent wells from locaton to meet the producton target. Equaton (1) calculates the cost of meetng the producton target from each drllng locaton and determnes the lowest cost locaton. The obectve functon s subect to: C Z + Y 1 * W (2), ( ), Equaton (2) sets the cost of drllng well from locaton to zero, unless both Z and Y are equal to 1. Therefore, only the cost of the wells that are actually drlled from each locaton are totalled n Equaton (1). Z P T (3) Equaton (3) ensures the producton target s met for each drllng locaton. Y = 1 (4) Equaton (4) ensures that there s only one drllng centre. Ths can be relaxed to nvestgate the effect of multple drllng centres. The method descrbed n ths paper was used to determne the optmum drllng centre n two felds of the lterature [1]. The frst feld comprses 29 wells and the second 224 wells. The

4 Rchard J. Barnes et al. optmzaton revealed the optmum solutons n 0.1 and 1.6 CPU sec respectvely. 3. Schedulng multple felds The second stage of the nvestgaton s to determne the optmum development schedule o acheve a specfed feld producton profle. The optmsaton task s to determne the drllng sequence and the feld selecton that mnmses the total drllng cost to meet Producton Rate, BPD 120,000 100,000 80,000 60,000 40,000 20,000 the target producton. The model assumes a man feld and an arbtrary number of satellte felds feedng the man feld facltes. The recoverable reserves, and the locaton and productvty of potental well locatons are fxed parameters whch are used to defne the reservor. These parameters would normally reman constant unless the effect of uncertanty n the reservor were beng nvestgated. The target producton profle descrbes a partcular case beng nvestgated and determnes the speed wth whch the felds are developed. The problem s formulated mathematcally as follows. Gven s a set wells, a set of felds, a set of wells, and a producton tme comprsed by t perods (years). The drllng schedule and annual productons are determned over the feld lfe and over a fxed tme of producton (n years). Problem parameters nclude the: C, = 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 Producton Year Fgure 2 Fgure 2 Producton profle The cost of drllng Well I from the specfed drllng locaton n Feld. T n = Target producton rate for Year n. W n = Potental producton from well n year n. The problem varables nclude: Z t = Bnary varable set to zero except n the year t when a specfc well s drlled. The array descrbes each feld. P,t n, = Actual producton from well n Year n, when drlled n Year t n Feld.

A mathematcal programmng approach to the desgn and schedulng of offshore olfelds. 5 The model mnmses the drllng cost over the lfe of the feld, consder wells drlled from all dfferent platforms. The obectve functon s formulated as: Cost = Z * C (5) t,t,, 120,000 120,000 100,000 100,000 Producton Rate, BPD 80,000 60,000 40,000 Producton Rate, BPD 80,000 60,000 40,000 20,000 20,000 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 Producton Year Producton Year Fgure 3: Accelerated producton Fgure 4: Slow developng producton Equaton (5) sums the costs of drllng the wells for each year and each feld or platform. Ths s the obectve functon that must be mnmsed over the lfe of the proect. The obectve functon n (5) s subect to P Z * W (6),t,n,,t,,n t +1 Equaton (6) sets the producton from each well to zero f t s not n operaton or to the specfed producton rate f the well has been drlled. T (7) n P,t,n, t Equaton (7) ensures that the total producton from each feld meets or exceeds the specfed target producton for that year. R P t, n, n t, (8) Equaton (8) ensures that producton from ndvdual felds does not exceed the recoverable reserves for that feld. Fgure 2 shows a typcal producton profle. Producton bulds up n the frst two years, and then remans constant for the plateau perod. Producton then enters the declne perod, contnung untl the revenue from the ol producton no longer exceeds the cost of operatng the feld. The feld s then no longer economc and s abandoned. Fgure 3 shows an accelerated producton programme n whch wells have been pre-drlled

6 Rchard J. Barnes et al. before nstallaton of the platform. Contnued drllng mantans the plateau for several years. Producton then declnes relatvely slowly by contnued drllng or workover durng part of the declne perod. Fgure 4 s of a producton profle that bulds up relatvely slow to plateau. Producton begns to rapdly declne wth the cessaton of drllng at the end of plateau producton. The grd spacng may be ncreased to dstrbute the wells over a larger area. Smlarly, an addtonal constrant can be added to lmt the well step out: D M (9) Where: D = Horzontal dstance between drllng centre and well. M = Maxmum permtted step out. The new method has been tested aganst models developed earler [2] and has gven comparable results. To date the new model has not been extended to model declne n well productvty durng feld lfe. 4. Conclusons The paper presents general mathematcal models to enable the optmal development of sngle and multple felds. By decomposng the problem nto two parts: selectng an optmum drllng centre and optmsng the well selecton; the problem complexty s sgnfcantly reduced. Although the problem can become qute large when there are several hundred potental well locatons over a feld lfe of 20 years or more, the problem stll remans well wthn the computatonal capacty of the modern personal computer. The model does not perform an economc analyss on the soluton to permt comparson of the case wth other cases wth dfferent producton profles. It also does not nclude a functon to model the declne n well performance wth producton. However, ths feature could be added n a further refnement. References 1. Barnes, R.J., Lnke, P. and Kokosss, A (2002). Optmsaton of olfeld development producton capacty. ESCAPE 12 proceedngs, The Hague (NL), 631-636. 2. Barnes, R.J., Kokosss, A. and Shang, Z. An ntegrated mathematcal programmng approach for the desgn and optmsaton of offshore felds. Computers and Chemcal Engneerng (2006). 3. Iyer, R. R., Grossmann, I. E., Vasantharaan, S., & Cullck, A. S. (1998). Optmal Plannng and Schedulng of Offshore Ol Feld Infrastructure Investment and Operaton. Industral and Engneerng chemstry Research, 37, 1380. 4. Nero SMS, Pnto JM. A general modellng framework for the operatonal plannng of petroleum supply chans. Internatonal Conference on Foundatons of Computer- Aded Process Operatons, 2003, Computers & Chemcal Engneerng 28 (6-7): 871-896, Jun 15 2004.