Serviceeinschränkungen vom 12.-22.02.2026 - weitere Infos auf der UB-Homepage

Treffer: An iterative aggregation/disaggregation approach for the solution of a mixed-integer nonlinear oilfield infrastructure planning model

Title:
An iterative aggregation/disaggregation approach for the solution of a mixed-integer nonlinear oilfield infrastructure planning model
Source:
Industrial & engineering chemistry research. 39(6):1955-1971
Publisher Information:
Washington, DC: American Chemical Society, 2000.
Publication Year:
2000
Physical Description:
print, 29 ref
Original Material:
INIST-CNRS
Document Type:
Fachzeitschrift Article
File Description:
text
Language:
English
Author Affiliations:
Department of Chemical Engineering, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213, United States
ISSN:
0888-5885
Rights:
Copyright 2000 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Energy
Accession Number:
edscal.1396511
Database:
PASCAL Archive

Weitere Informationen

A multiperiod mixed-integer nonlinear programming model for offshore oilfield infrastructure planning is presented where nonlinear reservoir behavior is incorporated directly into the formulation. Discrete decisions include the selection of production platforms, well platforms and wells to be installed/drilled, and the drilling schedule for the wells over the planning horizon. Continuous decisions include the capacities of the platforms and the production profile for each well in each time period. For the solution of this model, an iterative aggregation/disaggregation algorithm is proposed in which logic-based methods, a bilevel decomposition technique, the use of convex envelopes, and aggregation of time periods are integrated. Furthermore, a novel dynamic programming subproblem is proposed to improve the aggregation scheme at each iteration in order to obtain an aggregate problem that resembles the disaggregate problem more closely. A number of examples are presented to illustrate the performance of the proposed method.