An Optimization-Based Facility Network Solver for Well Allocation in Reservoir Simulation

2021 ◽  
Author(s):  
K. Wiegand ◽  
Y. Zaretskiy ◽  
K. Mukundakrishnan ◽  
L. Patacchini

Abstract When coupling reservoir simulators to surface network solvers, an often used strategy is to perform a rule or priority-driven allocation based on individual well and group constraints, augmented by back-pressure constraints computed periodically by the network solver. The allocation algorithm uses an iteration that applies well-established heuristics in a sequential manner until all constraints are met. The rationale for this approach is simply to maximize performance and simulation throughput; one of its drawbacks is that the computed allocation may not be feasible with respect to the overall network balance, especially in cases where not all wells can be choked individually. In the work presented here, the authors integrate the well allocation process into the network flow solver, in the form of an optimization engine, to ensure that the solution conforms to the network rate and pressure balance equations. Results for three stand-alone test cases are discussed.

2017 ◽  
Vol 17 (1) ◽  
pp. 104-112 ◽  
Author(s):  
Zijuan Shi ◽  
Gaofeng Luo

Abstract Auction is often applied in cognitive wireless networks due to its fairness properties and efficiency. To solve the allocation issues of cognitive wireless network inamulti-band spectrum, multi-item auction mechanism and models were discussed in depth. Multi-item highest price sealed auction was designed for cognitive wireless networks’multi-band spectrum allocation algorithm. This algorithm divided the spectrum allocation process into several stages which was along with low complexity. Experiments show that the algorithm improves the utilization of spectrum frequency, because it takes into account the spectrum owner’s economic efficiency and the users’equity.


Author(s):  
Александр Борисович Шабунин ◽  
Андрей Куркенович Такмазьян

Моделируется подбор тяговых ресурсов (локомотивов - в данном случае) для провоза грузовых поездов. В качестве входных данных рассматриваются маршрут поезда, время готовности поезда к отправлению, средняя скорость и вес поезда. Имеется множество локомотивов, обладающих грузоподъемностью и областью разрешенного действия. Цель - оптимально подобрать ресурс для каждого участка маршрута поезда. Решение ищется методом потока ресурсов минимальной суммарной стоимости через специально сконструированную сеть. Сеть построена на основе взвешенного орграфа из ребер графика поездов на линейных участках и ребер альтернативы, в процессе прохода по которым осуществляется “смена деятельности” локомотива (например, отцепление от одного поезда и подцепка к другому). Полученное решение обладает свойством глобальной оптимальности по времени. The selection of traction resources (locomotives) for the transport of freight trains is modelled. The input data are the train route, the readiness time of the train for departure, the average speed and weight of the train. In addition, there are many locomotives with a carrying capacity and an area of permitted action. The research objective is to optimally select a resource for each segment of the train route. The solution is sought by the resource flow method of the minimum total cost through a specially designed network. The network includes edges created from train schedule segments whose filling means locomotive assignment to train at the segment, and special alternative edges, passing through which a locomotive alternates its assignment. The algorithm for finding the optimal solution is the method of pushing through the pre-flow proposed by A. Goldberg and R. Tarjan. This is one of the fastest algorithms converging to a global optimum. Two test cases were investigated: a trivial one, out of six trains and three locomotives, and a more complicated one, which is a model example the size of 10% of the full scale model and consists of 150 trains. Full scale calculations provide planning of the freight transportation on the Eastern Operational domain of the Russian Railways. The model includes 1800 locomotives and about 3000 trains on the time horizon of 48 hours. Solution is found in less than 5 minutes of processor time for a PC powered by Intel(R) Pentium(R) G2010 2.80 GHz processor.


2021 ◽  
Author(s):  
Changdong Yang ◽  
Jincong He ◽  
Song Du ◽  
Zhenzhen Wang ◽  
Tsubasa Onishi ◽  
...  

Abstract Full-physics subsurface simulation models coupled with surface network can be computationally expensive. In this paper, we propose a physics-based subsurface model proxy that significantly reduces the run-time of the coupled model to enable rapid decision-making for reservoir management. In the coupled model the subsurface reservoir simulator generates well inflow performance relationship (IPR) curves which are used by the surface network model to determine well rates that satisfy surface constraints. In the proposed proxy model, the CPU intensive reservoir simulation is replaced with an IPR database constructed from a data pool of one or multiple simulation runs. The IPR database captures well performance that represents subsurface reservoir dynamics. The proxy model can then be used to predict the production performance of new scenarios – for example new drilling sequence – by intelligently looking up the appropriate IPR curves for oil, gas and water phases for each well and solving it with the surface network. All necessary operational events in the surface network and field management logic (such as facility constraints, well conditional shut-in, and group guide rate balancing) for the full-coupled model can be implemented and honored. In the proposed proxy model, while the reservoir simulation component is eliminated for efficiency. The entirety of the surface network model is retained, which offers certain advantages. It is particularly suitable for investigating the impact of different surface operations, such as maintenance schedule and production routing changes, with the aim of minimizing production capacity off-line due to maintenance. Replacing the computationally intensive subsurface simulation with the appropriate IPR significantly improves the run time of the coupled model while preserving the essential physics of the reservoir. The accuracy depends on the difference between the scenarios that the proxy is trained on and the scenarios being evaluated. Initial testing with a complex reservoir with more than 300 wells showed the accuracy of the proxy model to be more than 95%. The computation speedup could be an order of magnitude, depending largely on complexity of the surface network model. Prior work exists in the literature that uses decline curves to replicate subsurface model performance. The use of the multi-phase IPR database and the intelligent lookup mechanism in the proposed method allows it to be more accurate and flexible in handling complexities such as multi-phase flow and interference in the surface network.


2003 ◽  
Vol 125 (1) ◽  
pp. 25-32 ◽  
Author(s):  
W. Ning ◽  
Y. S. Li ◽  
R. G. Wells

A multistage frequency domain (time-linearized/nonlinear harmonic) Navier-Stokes unsteady flow solver has been developed for predicting unsteady flows induced by bladerow interactions. In this paper, the time-linearized option of the solver has been used to analyze unsteady flows in a subsonic turbine test stage and the DLR transonic counter-rotating shrouded propfan. The numerical accuracy and computational efficiency of the time-linearized viscous methods have been demonstrated by comparing predictions with test data and nonlinear time-marching solutions for these two test cases. It is concluded that the development of efficient frequency domain approaches enables unsteady flow predictions to be used in the design cycles to tackle aeromechanics problems.


2003 ◽  
Author(s):  
Alexandre Kosmala ◽  
Sigurd Ivar Aanonsen ◽  
Allyson Gajraj ◽  
Valerie Biran ◽  
Kari Brusdal ◽  
...  

VLSI Design ◽  
1995 ◽  
Vol 3 (1) ◽  
pp. 93-98 ◽  
Author(s):  
Youssef Saab

Partitioning is an important problem in the design automation of integrated circuits. This problem in many of its formulation is NP-Hard, and several heuristic methods have been proposed for its solution. To evaluate the effectiveness of the various partitioning heuristics, it is desirable to have test cases with known optimal solutions that are as “random looking” as possible. In this paper, we describe several methods for the construction of such test cases. All our methods except one use the theory of network flow. The remaining method uses a relationship between a partitioning problem and the geometric clustering problem. The latter problem can be solved in polynomial time in any fixed dimension.


Author(s):  
Pengcheng Du ◽  
Fangfei Ning

Time periodic unsteady flows are often encountered in turbomachinery. Simulating such flows using conventional time marching approach is very time-consuming and hence expensive. To handle this problem, several Fourier-based reduced order models have been developed recently. Among these, the time-domain harmonic balance method solves the governing equations purely in the time domain and there is also no need for the turbulence model to be linearized, making it easy to be implemented in an existing RANS code. Thus, the time-domain harmonic balance method was chosen and incorporated into an in-house Navier-Stokes flow solver. Several test cases were performed for the validations of the developed code. They cover standard unsteady test cases such as the low speed vortex shedding cylinder flow and the Sajben transonic diffuser under periodically oscillating back pressure. Further, two different practical turbomachinery unsteady flows were considered. One is a transonic fan under circumferential inlet distortion and the other is the rotor-stator interactions in a single stage compressor. The results illustrate the capability of the harmonic balance method in capturing the dominant nonlinear effects. The number of harmonics should be retained in the harmonic balance method is depend on the strength of the nonlinear unsteady effects and differs from case to case. With appropriate number of harmonics retained, it can resolve the unsteady flow field satisfactory, meanwhile, reducing the computational time significantly. In a word, the harmonic balance method promise to be an effective way to simulate time periodic unsteady flows.


Author(s):  
W. Ning ◽  
Y. S. Li ◽  
R. G. Wells

A multistage frequency domain (time-linearized/nonlinear harmonic) Navier-Stokes unsteady flow solver has been developed for predicting unsteady flows induced by bladerow interactions. In this paper, the time-linearized option of the solver has been used to analyze unsteady flows in a subsonic turbine test stage and the DLR transonic counter-rotating shrouded propfan. The numerical accuracy and computational efficiency of the time-linearized viscous methods have been demonstrated by comparing predictions with test data and nonlinear time-marching solutions for these two test cases. It is concluded that the development of efficient frequency domain approaches enables unsteady flow predictions to be used in the design cycles to tackle aeromechanics problems.


2019 ◽  
Vol 9 (10) ◽  
pp. 1986 ◽  
Author(s):  
Fei Yan ◽  
Xiaoping Zhu ◽  
Zhou Zhou ◽  
Jing Chu

A hierarchical mission planning method was proposed to solve a simultaneous attack mission planning problem for multi-unmanned aerial vehicles (UAVs). The method consisted of three phases aiming to decouple and solve the mission planning problem. In the first phase, the Pythagorean hodograph (PH) curve was used in the path estimation process for each UAV, which also served as the input for the task allocation process. In the second phase, a task allocation algorithm based on a negotiation mechanism was proposed to assign the targets. Considering the resource requirement, time-dependent value of targets and resource consumption of UAVs, the proposed task allocation algorithm can generate a feasible allocation strategy and get the maximum system utility. In the last phase, a path planning method was proposed to generate a simultaneous arrival PH path for each UAV considering UAV’s kinematic constraint and collision avoidance with obstacles. The comparison simulations showed that the path estimation process using the PH curve and the proposed task allocation algorithm improved the system utility, and the hierarchical mission planning method has potential in a real mission.


Sign in / Sign up

Export Citation Format

Share Document