Professional Documents
Culture Documents
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
(2007-2014)
3. Troll West oil rim – Initial results
1
Petroleum production -
Decision horizons vary a lot
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
Production optimization -
Stylistic view
Typical optimization problem
Maximize oil production
One of eight Troll C clusters while honoring constraints
Decisions variables
Production valve on each
well
Platform
Gas injection valves
Routing of the reservoir
Sea bed
fluid
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
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
Production
Data
GOR Optimal
Prediction P, inj. rates
Wellbore
Info
Routing
8
New methodological foundation
9
Dynamic piecewise linearization -
principle
Piecewise linearization of 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
10
Dynamic piecewise linearization -
principle
Illustration of a dynamical piecewise
To minimize error due to
linearized well performance curve 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 –
principle
Lagrangian decomposition
(LD) is a method to
decompose an optimization
problem into two or more
disjoint (and hence smaller)
Relax the comman
problems
constraint
LD may be efficient for certain
network-type problems
13
Lagrangian decomposition –
principle
To solve a Lagrangian
decomposed problem is a
iterative procedure
Solve both problem with Relaxed constraint
initial Lagrangian
multipliers Objective function
Check feasibility with
Lagrangian function
respect to relaxed
constraint
Calculate new Lagrangian
multipliers based on
heuristic
Feasible objective
function give lower bound,
Lagrangian function gives
upper bound
14
Lagrangian decomposition –
Troll C
One of eight Troll C clusters
Constraint to relax –
gas processing constraint
GAS
CTOT ≥ q GAS
j
j∈Clusters
15
Complete algorithm combining
Dynamic piecewise linearization and
Lagrangian decomposition
16
Implementation
17
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
18
Collabration with CMU
19
Collabration with CMU
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
21