A collection of published works from ACL. (Return to top) Jaipuria, N., Habibi, G., and How, J. P., “Learning in the Curbside Coordinate Frame for a Transferable Pedestrian Trajectory Prediction Model,” IEEE Conference on Intelligent Transportation Systems (ITSC), @inproceedings{Jaipuria18_curb_ITSC, author = {Jaipuria, Nikita and Habibi, Golnaz and How, Our online essay service is the most reliable writing service on the King B M Optimal Mine Scheduling Policies Unpublished Phd Thesis University Of London web. We can handle a wide range of assignments, as we have worked for more than a decade and gained a great experience in the sphere of essay writing/10() computerised maintenance management systems (CMMSs) is. carried out to highlight the need for them in industry and identify. their current deficiencies. A proposed model provides a decision
JMS, Vol. 47, No. 2, (Special Issue)
edu no longer supports Internet Explorer. To browse Academia. edu and the wider internet faster and more securely, please take a few seconds to upgrade your browser. Log In with Facebook Log In with Google Sign Up with Apple. Remember me on this computer. Enter the email address you signed up with and we'll email you a reset link.
Need an account? Click here to sign up. Download Free PDF. Waterflooding Optimization for Improved Reservoir Management.
Masoud Asadollahi. Download PDF Download Full PDF Package This paper. A short summary of this paper. Download PDF. Download Full PDF Package. Translate PDF. Leaving a trace but finishing it! Do not worry about your difficulties in Mathematics. I can assure you mine are still greater!
The thesis is based on the collection of the scientific papers published during the PhD program. Each chapter is an independent article or submitted article and an outline of the coming chapters is described in this section. Chapter 1 is an introductory to provide the basic background and motivation for the thesis. First, the related petroleum terms are defined; e. The important reservoir engineering concepts regarding reservoir waterflooding are addressed and discussed.
Second, the Brugge field is described in detail. Third, the relevant mathematical background, in connection with numerical optimization, is introduced. In the end, a literature and review on production optimization, with a special focus on waterflooding optimization, is accomplished.
Within production optimization, most of the works are focused on optimizing the reservoir performance under waterflooding. Lots of work has been performed on general aspects of the waterflooding optimization problems. In Chapter 2 Asadollahi and Nævdal,the problem is investigated in more details in terms of formulation and initial solution using gradient based methods. The waterflooding optimization studies prior to accomplishment of this PhD thesis are briefly reviewed.
The related mathematical concepts for numerical optimization of oil reservoirs are presented and the practical issues regarding different control king b m 2000 optimal mine scheduling policies unpublished phd thesis university of london, reactive and proactive approaches, are discussed.
The Brugge Field is described and Brugge optimization problem is illustrated and investigated for three different formulations.
A manual procedure, based on the accepted reservoir concepts, is demonstrated and used for the improvement of the starting point for the gradient based optimization; since their performance is dependent to the initial guess.
To examine the robustness of the solutions, the optimal strategies are applied to 10 randomly chosen geological realizations from Lorentzen et al. The optimization results, in terms of NPV value, are compared to a reactive control case introduced by Peters et al. This slows down the optimization process and might increase the chance of obtaining a suboptimal solution.
Some multiscale estimation techniques propose the grouping of the control parameters in the initial iterates of the optimization and gradual refinement of the variables as the process proceeds, with the most refined control vector close to the optimal point.
The use of these techniques can accelerate the large scale reservoir optimization problems. In Chapter 3 Asadollahi and Nævdal,an efficient procedure is employed to handle the high dimensional waterflooding rate optimization problem. The algorithm is applied to the waterflooding optimization task of the Brugge field using adjoint technique.
The novelty of the work is discussed and compared with a previous work Lien et al. The main advantages of the procedure are: first, the strategy decreases the number of the variables tremendously where the large number of optimization variables makes the large-scale optimization algorithms impractical with the current computer resources. Second, larger and faster updates of the rates are made possible as well as achieving higher optimal NPV values for some methods. The optimal solution were compared with a base case, updating the variables every 6 month 3, variablesand a previous work Asadollahi et al.
Due to the large dimensionality of typical rate optimization problems, most approaches for field optimization are local search king b m 2000 optimal mine scheduling policies unpublished phd thesis university of london. Achievable optima by these methods are directly impacted by the choice of the initial guess for the sought optimal profiles.
In Chapter 4 Asadollahi et al. Second, a simple low-cost framework is presented to efficiently initialize local-search optimization algorithms, based on accepted reservoir engineering concepts. The initialization strategy is applied to history matched model of the Brugge field, and evaluated for three different optimization algorithms: pattern search Hooke-Jeeves, reflection simplex Nelder- Mead and sequential quadratic programming.
The results are compared with two earlier works Lorentzen et al. The workflow is in line with the existing optimization approaches and the output from the workflow can be used as an input to other algorithms for further improvement of the results. Simulation of the real reservoir models is computationally expensive.
Therefore computation of the gradients of an objective function with respect to reservoir parameters can be available only at a prohibitive cost. Also automatic differentiation is typically impossible since the objective function is computed using a black-box model. In addition, the finite difference approximation of the gradients might be inappropriate and noisy. Hence, in Chapter 5 Asadollahi et al.
The pattern search Hooke-Jeeves, the reflection simplex Nelder-Mead, a generalized pattern search and a line-search derivative-free method were applied to the optimization problem.
The line-search derivative-free algorithm was developed based on the existing line-search derivative free algorithms in combination with the Hooke-Jeeves pattern search method. The optimization methods were tested on the Brugge optimization problem and the results are presented and discussed in this chapter.
The performance of the derivative-free methods was compared with a gradient based sequential quadratic programming algorithm. The fractional ranking method is used for comparing the performance of the optimization methods. To solve a waterflooding optimization problem, this thesis contributes in the following aspects.
First, king b m 2000 optimal mine scheduling policies unpublished phd thesis university of london, in chapter 2, the importance of proper formulation of a reservoir waterflooding problem is illustrated and the selection of an appropriate initial solution from a reservoir engineering perspective is demonstrated.
Second, in chapter 3, a simple and new approach for multiscale optimization is introduced and tested on the Brugge case. Promising results were achieved using only two coarse timesteps based on the illustrated grouping approach. Third, in chapter 4, an efficient framework is developed, utilizing the knowledge obtained in chapter 2, and presented to maximize the production from a reservoir under waterflooding.
The method was applied to the Brugge case and high objective function value was obtained within a limited number of simulations. Fourth, in chapter 5, a number of derivative free optimization methods were evaluated and compared using the Brugge model. A new derivative optimization method was developed based on the existing efficient optimization algorithms. The new optimization method performed faster than the other derivative free optimization algorithms presented in here.
One of the journal papers Asadollahi et al. Hence, these two papers are presented at once, in Chapter 4, and the earlier publication of this paper is enclosed in the appendix. Asadollahi and G. Waterflooding optimization using gradient based methods. SPE Asadollahi, G, king b m 2000 optimal mine scheduling policies unpublished phd thesis university of london. Nævdal, R. Markovinovic, and A.
A workflow for efficient initialization of local-search iterative methods for waterflooding optimization. IPTC In International Petroleum Technology Conference, Doha, Qatar, December, Selection of decision variables for large-scale production optimization problems applied to Brugge Field.
In SPE Russian Oil and Gas Conference and Exhibition, Moscow, Russia, October, Nævdal, M. Dadashpour, and J. Production optimization using derivative free methods applied to Brugge Field case. Submitted to Optimization and Engineering.
Nævdal, and A. Efficient workflow for optimizing well controls. Journal of Petroleum Science and Engineering, Lien, D. Brouwer, T. Mannseth, and J. Multiscale regularization of flooding optimization for smart field management. SPE Journal, 13 2 Lorentzen, A. Shafieirad, and Geir Nævdal, king b m 2000 optimal mine scheduling policies unpublished phd thesis university of london.
Closed loop reservoir management using the ensemble Kalman filter and sequential quadratic programming.
Scheduling with Uncertain Processing Times
, time: 34:32Saimm jul by SAIMM - Issuu
Google Scholar provides a simple way to broadly search for scholarly literature. Search across a wide variety of disciplines and sources: articles, theses, books, abstracts and court opinions (a) If B is a square matrix satisfying BA = I,then B = A−1. (b) If B is a square matrix satisfying AB = I, then B = A−1. In our later work the following fundamental problem will occur over and over again in various contexts. Let A be fixed m×n matrix. Find all m×1 matrices B such that the computerised maintenance management systems (CMMSs) is. carried out to highlight the need for them in industry and identify. their current deficiencies. A proposed model provides a decision
No comments:
Post a Comment