Method and system for well assignment in a reservoir simulation based on well activity

Patent metadata

Field	Value
Publication number	US-11261707-B2
Application number	US-202016832179-A
Country	US
Kind code	B2
Filing date	Mar 27, 2020
Priority date	Mar 27, 2020
Publication date	Mar 1, 2022
Grant date	Mar 1, 2022

Abstract

A method may include obtaining well activity data regarding various wells in a reservoir region of interest. The method may further include determining a predetermined well assignment for various parallel processing stages using a bin-packing problem algorithm and the well activity data. The predetermined well assignment may assign the wells to the parallel processing stages. A respective parallel processing stage among the parallel processing stages may perform a portion of a reservoir simulation using a respective computer processor and a well among the wells. The method may further include simulating the reservoir region of interest based on the wells being simulated according the predetermined well assignment for the parallel processing stages.

First claim

What is claimed is:

1. A method, comprising:
obtaining, by a computer processor, well activity data regarding a plurality wells in a reservoir region of interest;
determining, by the computer processor, a first predetermined well assignment for a plurality of parallel processing stages using a first bin-packing problem algorithm and the well activity data,
wherein the first predetermined well assignment assigns the plurality of wells to the plurality of parallel processing stages based on the application of the first bin-packing problem algorithm to the well activity data associated with each well, and
wherein a respective parallel processing stage among the plurality of parallel processing stages performs a portion of a reservoir simulation using a respective computer processor and one or more wells among the plurality of wells; and

simulating, by the computer processor, the reservoir region of interest based on the plurality of wells being simulated according the first predetermined well assignment for the plurality of parallel processing stages.

2. The method of claim 1 , further comprising:
performing a coarsened simulation of the reservoir region of interest for the plurality of wells prior to determining the first predetermined well assignment, and
wherein the well activity data for determining the first predetermined well assignment is obtained from the coarsened simulation.

3. The method of claim 1 , wherein the first bin-packing problem algorithm is a First-fit (FF) algorithm, a Next-fit (NF) algorithm, a First-fit Decreasing (FFD) algorithm, a First-fit Increasing (FFI) algorithm, or a Best-fit (BF) algorithm.

4. The method of claim 1 ,
wherein the first bin-packing problem algorithm assigns the plurality of wells to a plurality of bins that minimizes an amount of inactive time within the plurality of bins, and
wherein the amount of inactive time corresponds to time within a parallel processing stage when a parallel process is not simulating production of a well among the plurality of wells.

5. The method of claim 1 , further comprising:
generating a first bin for a first well;
generating a second bin for a second well in response to determining that the second well fails to fit with the first well;
assigning a third well to the first bin in response to determining that the third well fits with the first well inside the first bin;
generating a third bin for a fourth well in response determining that the fourth well fails to fit inside the first bin and the second bin; and
assigning a fifth well to the second bin in response to determining that the fifth well fails to fit inside the first bin with the first well and fits inside the second bin with the second well.

6. The method of claim 5 ,
wherein the first well, the second well, the third well, the fourth well, and the fifth well are respective wells in a predetermined well list for the reservoir simulation.

7. The method of claim 1 , further comprising:
sorting the plurality of wells using the well activity data to produce a sorted well list, the plurality of wells comprising a first well, a second well, a third well, a fourth well, and a fifth well according to respective well activity sizes,
wherein, within the sorted well list, the third well is greater than the fourth well that is greater than the first well that is greater than the second well that is greater than the fifth well;

generating a first bin for the third well in response to the third well being assigned initially from the sorted well list;
generating a second bin for the fourth well in response to determining that the fourth well fails to fit inside the first bin;
assigning the first well to the first bin in response to determining that the first well fits inside the first bin;
generating a third bin for the second well in response determining that the second well fails to fit inside the first bin and the second bin; and
assigning the fifth well to the second bin in response to determining that the fifth well fails to fit inside the first bin and fits inside the second bin with the second well.

8. The method of claim 1 ,
wherein the plurality of wells comprise a plurality of historical wells and a plurality of wells in prediction phases,
wherein the plurality of historical wells are simulated by the reservoir simulation using production data acquired at the plurality of historical wells, and
wherein the plurality of wells in prediction phases are simulated by the reservoir simulation without using production data.

9. The method of claim 8 , further comprising:
generating a coarsened model that simulates the plurality of wells in prediction phases; and
generating a fine-grid model that simulates the plurality of historical wells,
wherein the coarsened model corresponds to a plurality of grid blocks with a first grid resolution that is less than a second grid resolution of the fine-grid model.

10. The method of claim 1 , further comprising:
determining a second predetermined well assignment for the plurality of parallel processing stages using the well activity data and a second bin-packing problem algorithm that is different from the first bin-packing problem; and
comparing a first number of bins that is determined from the first well assignment with a second number of bins that is determined from the second well assignment, and
wherein the plurality of wells are simulated using the first well assignment in response to determining that the first number of bins is less than the second number of bins.

11. The method of claim 1 ,
wherein the plurality of parallel processing stages comprises a first parallel processing stage and a second parallel processing stage,
wherein the first parallel processing stage is a historical period of the reservoir simulation, and
wherein the second parallel processing stage is a prediction period of the reservoir simulation.

12. The method of claim 1 ,
wherein the plurality of wells comprise a first well, a second well, and a third well,
wherein the first well, the second well, and the third well are arranged in a single bin within the predetermined well assignment,
wherein the bin comprises an inactive period between the first well and the second well, and
wherein the bin comprises an overlap region between the second well and the third well.

13. A computer system, comprising:
a processor; and
a memory coupled to the processor, the memory comprising functionality for:
obtaining well activity data regarding a plurality wells in a reservoir region of interest;
determining a predetermined well assignment for a plurality of parallel processing stages using a bin-packing problem algorithm and the well activity data,
wherein the predetermined well assignment assigns the plurality of wells to the plurality of parallel processing stages based on the application of the bin-packing problem algorithm to the well activity data associated with each well, and
wherein a respective parallel processing stage among the plurality of parallel processing stages performs a portion of a reservoir simulation using a respective computer processor and one or more wells among the plurality of wells; and
simulating the reservoir region of interest based on the plurality of wells being simulated according the predetermined well assignment for the plurality of parallel processing stages.

14. The computer system of claim 13 ,
wherein the first bin-packing problem algorithm assigns the plurality of wells to a plurality of bins that minimizes an amount of inactive time within the plurality of bins, and
wherein the amount of inactive time

Assignees

• Saudi Arabian Oil Co

Inventors

• Kayum Suha Naim
• Rogowski Marcin
• Cancelliere Michel

Classifications

• E21B41/00 Primary

  Equipment or details not covered by groups E21B15/00 - E21B40/00 · CPC title

• G06F30/20

  Design optimisation, verification or simulation (optimisation, verification or simulation of circuit designs G06F30/30) · CPC title

• E21B2200/20

  Computer models or simulations, e.g. for reservoirs under production, drill bits · CPC title