In this work,we provide a more consistent alternative for performing value of information(VOI)analyses to address sequential decision problems in reservoir management and generate insights on the process of reservoir ...In this work,we provide a more consistent alternative for performing value of information(VOI)analyses to address sequential decision problems in reservoir management and generate insights on the process of reservoir decision-making.These sequential decision problems are often solved and modeled as stochastic dynamic programs,but once the state space becomes large and complex,traditional techniques,such as policy iteration and backward induction,quickly become computationally demanding and intractable.To resolve these issues and utilize fewer computational resources,we instead make use of a viable alternative called approximate dynamic programming(ADP),which is a powerful solution technique that can handle complex,large-scale problems and discover a near-optimal solution for intractable sequential decision making.We compare and test the performance of several machine learning techniques that lie within the domain of ADP to determine the optimal time for beginning a polymer flooding process within a reservoir development plan.The approximate dynamic approach utilized here takes into account both the effect of the information obtained before a decision is made and the effect of the information that might be obtained to support future decisions while significantly improving both the timing and the value of the decision,thereby leading to a significant increase in economic performance.展开更多
基金The authors acknowledge financial support from the Research Council of Norway through the Petromaks-2 project DIGIRES(RCN no.280473)the industrial partners AkerBP,Wintershall DEA,ENI,Petrobras,Equinor,Lundin,and Neptune Energy.
文摘In this work,we provide a more consistent alternative for performing value of information(VOI)analyses to address sequential decision problems in reservoir management and generate insights on the process of reservoir decision-making.These sequential decision problems are often solved and modeled as stochastic dynamic programs,but once the state space becomes large and complex,traditional techniques,such as policy iteration and backward induction,quickly become computationally demanding and intractable.To resolve these issues and utilize fewer computational resources,we instead make use of a viable alternative called approximate dynamic programming(ADP),which is a powerful solution technique that can handle complex,large-scale problems and discover a near-optimal solution for intractable sequential decision making.We compare and test the performance of several machine learning techniques that lie within the domain of ADP to determine the optimal time for beginning a polymer flooding process within a reservoir development plan.The approximate dynamic approach utilized here takes into account both the effect of the information obtained before a decision is made and the effect of the information that might be obtained to support future decisions while significantly improving both the timing and the value of the decision,thereby leading to a significant increase in economic performance.
