End-Point Model for Optimization of Multilateral Well Placement in Hydrocarbon Field Developments

Drilling cost is one of the most critical aspects in the reservoir management plan. Costs may exceed a million dollars; thus, optimal designing of the well trajectory in the reservoir and completion are essential. The implementation of a multilateral well (MLW) in reservoir management has great potential to optimize oil production. The object of this study is to develop an integrated workflow of end-point multilateral well placement optimization integrated with the reservoir simulator supported by artificial intelligence (AI) methods. The paper covers various types of MLW construction, including: horizontal, bi-, tri-, and quad-lateral wells. For quad-lateral wells, the capital expenditure is highest; nevertheless, acceleration of oil production affects the project’s NPV (net present value), indicating the type of well that is most promising to implement in the reservoir. Tri- and quad-lateral wells can operate for 12.1 and 9.8 years with a constant production rate. The decreasing hydrocarbon production rate is affected by reservoir pressure and the reservoir water production rate. Other well design patterns can accelerate water production. The well’s optimal trajectory was evaluated by the genetic algorithm (GA) and particle swarm optimization (PSO). The major difference between the GA and PSO optimization runs is visible with respect to water production and is related to the modification of one well branch trajectory in a reservoir. The proposed methodology has the advantage of easy implementation in a closed-loop optimization system coupled with numerical reservoir simulation. The paper covers the solution background, an implementation example, and the model limitations.


Introduction
We provide a state-of-the-art background and place the proposed approach among other solutions. The Introduction consists of a review of the application of multilateral well system in various production and injection scenarios, a review of previous works related to multilateral well optimization, a brief description of the optimization algorithms that can be employed in the solution with special consideration of the genetic algorithm and particle swarm optimization.

Multilateral Wells as an Asset in Reservoir Management
In recent years, the interest in multilateral wells has increased. The advanced technologies for the completion of productive horizons using multilateral or intelligent wells offer several possibilities to optimize hydrocarbon recovery and economic results [1]. The biggest advantages of multilateral wells are the increased formation drainage area and enhancement of productivity. This technology brings the benefits of reducing water cresting and coning due to complex structured branch wells usually

State-Of-The-Art in Multilateral Well Placement Optimization
Many studies propose different methods for the optimization of multilateral well design, and each of them takes into account different aspects. Lyu et al. presented a semi-analytical method for a multilateral well design, which was based on the drainage area [15]. The objective function was to exploit the entire reservoir as efficiently as possible within a certain time. The proposed algorithm can determine the number of lateral wells, the lateral length, and the spacing of the lateral wells. The advantages of the method are that it is applicable to different types of reservoirs and the computation time is short. However, to represent the heterogeneity of the reservoir, it uses only a 2D model of the geological properties. You et al. proposed a model that enables estimating the water breakthrough time and breakthrough locations in multilateral horizontal wells [2]. The method is mainly applicable to bottom water-drive reservoirs. A properly designed well can substantially delay the water breakthrough time, resulting in extend production time and hydrocarbon recovery. The model proposed by You et al. considered many factors, including the well trajectory (distance between the wellbore and bottom boundary, main wellbore length, each branch's well length), wellbore vertical location, reservoir and fluid properties (oil viscosity and density, formation water density), as well as petrophysical properties (formation isotropic permeability). Lyu et al. proposed the multilateral well trajectory and configuration optimization method for fractured reservoirs based on the connectivity ratio [16]. They employed a fast marching method. The objective function was to maximize the ratio between the total length of effectively connected fractures to the well, granted that greater penetration of the fractures improves the productivity of the well. The proposed method optimizes the well trajectory taking into account the geological properties, but does not consider such factors as the fluid flow in fractures and matrix and stress sensitivity. Only the azimuths of lateral wells are determined without an inclination angle. The proposed model is very fast even for complex reservoirs. Currently, artificial intelligence (AI) with different techniques (such as neural networks, fuzzy logic, the genetic algorithm, particle swarm algorithm, etc.) is used broadly in many disciplines including the oil and gas industry. These methods imitate intelligent human behavior in solving engineering problems related to prediction, drawing conclusions, and actions. In a complex task with multiple variables, it is difficult to find an optimal solution employing analytical methods due to the lack of direct dependency between individual variables, the objective function, and the constraints [1]. AI methods have been worked out in optimization tasks, as well as in predicting various parameters associated with high uncertainties. Buhulaigah et al. [17] in their study compared the analytical model using Borisov's correlation with the artificial neural network (ANN) approach to predict the average oil flow rate of multilateral wells. The obtained results indicated the great accuracy and advantage of AI methods over analytical ones. ANN gave a forecast error of 7.85% against actual rates compared to the 50.4% calculated from Borisov's correlation. Among AI techniques, the expert system plays a crucial role in combining expert knowledge with self-learning algorithms. Garrouch et al. [18] introduced a web-based fuzzy expert system for preliminary planning and completion of a multilateral well.

Genetic Algorithm and Particle Swarm Optimization Procedure
The necessities of the continuity and differentiability of the objective function significantly limit the possibility of using the application of gradient methods in real optimization problems. Therefore, a number of optimization methods were developed and implemented, which were aggregated according to the common name for evolutionary methods, which are inspired by biological analogies, mainly natural evolution. Contrary to gradient methods, they are based on a single solution; evolutionary methods are based on a certain set of solutions (populations of individual solutions). Evolutionary methods assume that the solution population changes to fit the optimization problem, creating a new population. The individual solution is assessed in terms of the quality of the objective function, and on this basis, the probability of the transition to a new population (survival) is given. Solutions with a worse quality are abandoned during the algorithm's operation. Evolutionary methods only require that an objective function value be assigned to each individual solution. This enables the Energies 2020, 13, 3926 4 of 23 use of a reservoir simulator, which can act as a black box, calculating the value of the objective function for a given vector of decision variables. Among evolutionary algorithms, the genetic algorithm (GA) and particle swarm optimization (PSO) techniques have been the most intensively studied during the last few years. In this paper, the genetic algorithm is chosen as an industrial standard procedure for optimization, and PSO is selected as the second algorithm for solution comparison.

Genetic Algorithm
GA is a search-based optimization technique based on the principles of natural selection. It is used to find optimal or near-optimal solutions to difficult problems. The terminology used to describe the genetic algorithm is derived directly from biological nomenclature. Each potential solution to an optimization problem is named as an individual (chromosome). The essential step of each iteration of the algorithm is to calculate the matching of individuals included in the population by calculating the corresponding value of the objective function. Fit is a measure showing the effectiveness of a solution by a given individual. During a GA run, the parental population is selected. Individuals making up this pool are subjected to crossover and mutation, leading to the creation of a descendant population [19]. The selection of the parental population is most often made on the basis of a single tournament method [20,21]. It consists of dividing the population into small subsets, usually composed of several individuals. From each group, a pair of individuals with the highest matching is selected to be the parents of the child solution. The best-matched individual in each iteration can have at most one descendant, which prevents premature convergence of the algorithm. The genetic algorithm is based on characteristic operators. The role of the crossover operator is to exchange information between the parents, with a certain probability of obtaining offspring representing a better quality match. The crossover operator is based on a random selection of the intersection of the chromosome chains. The first offspring is made by copying the first part of the parent's genes to the cut point, and the rest are selected from the second parent, as presented in Figure 1. The second offspring is created in an analogous manner from the rest of the parents' genes. Mutation operators turn a chromosome into a different chromosome. The essence of the crossover operator is the exchange of information between individuals, while the role of mutation is to introduce small random changes in individuals, as presented in Figure 2.

Particle Swarm Optimization
Particle swarm optimization is a stochastic population-based optimization method proposed by Eberhardt and Kennedy [22,23]. The algorithm mimics social swarm behavior where, while gaining experience, particles interact with each other and exchange information, moving to better areas of the solution space, thus striving for the global optimum [24]. In each iteration, each particle representing an individual solution moves in the solution space with a certain speed (speed as a change in the position of the particles in the solution space for a certain number of iterations performed, where the position should be notified as the location of the vector of decision variables in the search space). It follows that the particle representing the vector of decision variables moves in n-dimensional space, as shown in Figure 3. PSO's principles are based on the exchange of information about the location of a better quality area in the solution space between adjacent particles.

The Article's Objective
Multilateral wells are concerned as a requirement in the effective management of hydrocarbon reservoirs, especially in off-shore applications; thus, the optimization of the trajectory planning should be taken into consideration. The paper aims to develop a methodology for a multilateral well pattern for any number of branches' end-point conjunction with a numerical simulator and optimization algorithm to provide the optimal well topology in the reservoir management system.

Methodology
In connection with the growing interest in multilateral wells in oil and gas reservoir management, the enhanced optimization model is presented. The modeling of multilateral wells is based on the division of trajectories into nodal points and segments that are assigned to blocks of the simulation model, as presented in Figure 4.

End-Point Multilateral Well Model
In this section, the details of the optimization workflow will be presented. The end-point model workflow will be introduced, and the implementation example will be demonstrated. The end-point multilateral well optimization model is based on the reservoir numerical simulator. The basic principles require dividing the reservoir into a series of cells. Each cell of the reservoir model has discrete coordinates s related to the block center point, as presented in Figure 5.
where s (x) , s (y) , s (z) are the spatial coordinates of the reservoir model cell in the x, y, z directions, respectively. Thus, the simulation model domain Ω can be expressed as a set of reservoir blocks: where N is the total cell number in the reservoir model. The implementation of the end-point model requires a numerical model with orthogonal cells. The following steps are necessary to obtain the input to the numerical simulation:

1.
Create end-point well set P by picking N g points (where N g ≥ 2) from the reservoir domain Ω, where N g numbers of total end-points are determined ( Figure 6): 2.
Due to the well construction assumption, the total number of lateral wells (branches) is equal to N g − 1, meaning that for a horizontal well (one branch), N g = 2 is required; for a bi-lateral well, N g = 3 is mandatory, etc.; 3.
Individual branch g i,j is represented by the section connected at the junction point: P i → P j ; thus, we elaborate all possible connections between points in the set ( Figure 7 represents the connection possibilities depending on the central point); 4.
The end-point well optimization algorithm focuses on minimizing the total branches' lengths | ∑ In other words, we want to find such a point-to-point connection pattern that minimizes the sum of the branches' lengths. In this manner, the central point has to determineP; 5.
In end-point well set P, get the central point (well trunk)P fulfilling the following assumption of the minimizing total branch length: where the distance between each point in the set is calculated by the following equation: and argmin is a function returning the index of the point: 6. The reservoir simulation used in this study (Schlumberger Eclipse, version: 2019a Manufacturer: Schlumberger) requires discrete approximation of the well trajectory; thus, the trajectory of the well must be approximated to a center point block of the simulation grid. Branch matrix U contains the well trajectory: 7.
The common part of individual trajectories can be written as a set of points with coordinates , which belong to both the side branch U k and branch U l : 8.
The analysis of the mutual part of the lateral well trajectory allows determining which cells should be treated as open (perforated) according to the algorithm, because multiple connections in the same cell are forbidden: 9. Cells marked with the index P f a = 1 are treated as open, while those with index P f a = 0 are closed for the well. The following assumptions allow avoiding sharing the same block by different side wells. 10.
The perforation matrix is translated to the simulator keyword and is included in the simulation run.

Implementation Example
An example implementation of the node searchP is presented in Figures 6-9. It was assumed that the trajectory of the well would run in one plane of the model (s (z) = const.). The construction of the well trajectory will be based on N g = 4 nodal points, which will lead to the creation of a planar tri-lateral well.  The center nodal point (P) search is based on calculating the length of the branches for all possible combinations of point connections, as shown in Figure 7.
Based on the argmin function evaluation, central nodal pointP is set as P 3 . As in the case of vertical wells, the actual trajectory of the well must be approximated to a center point block of the simulation grid. An example of the trajectory approximation on a numerical grid is shown in Figures 8  and 9. As a result of the approximation, we get the U trajectory matrix containing individual branch trajectories, which are described by the points s (x) s (y) s (z) on a discrete reservoir grid. According to Steps 6-9 in the workflow: the final multilateral well trajectory is presented in Figure 10, where the green block represents perforated cells, and the red color is shut for flow.
The results of the implementation in a real case study are presented in Figure 11. (a) Tri-lateral well, N g = 4 (b) Quad-lateral well, N g = 5 Figure 11. Examples of using the developed algorithm for generating multilateral trajectories based on the end-point approach.

Optimization of Multilateral Well Placement
This section provides a background for the optimization procedure. The core algorithms (genetic algorithm and particle swarm optimization) will be introduced. To provide better clarification, a visual connection between optimization modules is provided. An NPV based optimization cost function is introduced and adapted to multilateral well placement problems.

Objective Function
The optimization problem is to find such a vector of decision variables containing end-point position U * that maximize the objective function: where function J has the following form: In the case of the exploitation of a hydrocarbon reservoir, the most common objective functions are: cumulative oil production, NPV, and production plateau time. Almeida et al. [25] incorporated ICV (inflow control valve) optimization in a smart well to establish a configuration that promoted increasing the NPV project value by delaying water breakthrough. They utilized GA as the optimization core. Awotunde et al. [26] developed an optimization workflow to optimal well placement based on a multiobjective cost function combining NPV with the voidage replacement ratio. The authors evaluated two optimization algorithms: the covariance matrix adaptation evolutionary strategy (CMA-ES) and differential evolution (DE). Bellout [27] evaluated the sequential and joint optimization of well the placement-control problem. The solution quality was evaluated based on the project net present value. As a result of the joint optimization procedure, the project NPV could be up to 20% when compared to a sequential approach. The project profitability as an objective indicator can be combined with the recovery ratio. Brouwer [28] used optimal control theory as an optimization algorithm for the valve settings in smart wells. According to the well control procedure, the application of ICV can significantly reduce water production or accelerate oil production, which have a direct impact on economic assets. Doublet et al. [29] utilized smart well technology in an injection-production horizontal well doublet. The proposed solution finds the optimal injection and production rates for every well segment. The optimization was carried out to maximize the project NPV value. The major outcome of the optimization procedure was a meaningful increase in oil production plateau time. NPV was also used in a derivative-free approach. Forouzanfar and Reynolds [30] established a novel well placement algorithm to maximize the life-cycle net present value of the production from a reservoir. Each well was characterized by a six degree of freedom function. That solution provided better feasibility and ensured a smooth response of the objective function, reducing the risk of local extreme aggregation. Besides the direct application of the optimization routine, the response surface can play a significant role in the decision-making process. Gross's [31] solution used simulation input uncertainties directly in the decision algorithms by extending the existing probabilistic reservoir simulation tool. As a target, the increase in production plateau was set. Recently, an effort was made to establish procedures that can hold multiple, possibly conflicting, objectives and evaluate this in terms of project NPV. Isebor et al. [32] introduced the novel approach BiPSOMADS based on particle swarm optimization-mesh adaptive direct search. The procedure was evaluated in terms of generalized field development and well control problems.
In this paper, the NPV function is used to integrate technical and economic production ratios, taking into account the change in the value of money over time and capital cost, which is particularly important in the case of planning long-term investments. The objective function J representing the reservoir response to the control vector (U) corresponds to the cash flows in the assumed time domain. Cash flow in the m th iteration of the optimization run is as follows: where: r − oil and gas price per volume unit ($/m 3 ), Q − total production (m 3 /s), S − production OPEX ($/m 3 ), C w − well drilling cost ($), K p − production CAPEX ($/s), o, g, wp − oil, gas, and water For multilateral well drilling CAPEX, the authors suggest the following algorithm: where: − number of production wells, N (P) = 1

Optimization Algorithm
The optimization algorithm used for multilateral well placement optimization contains several modules, which allow easily enhancing its capability. The algorithm runs in a closed-loop iteration, as presented in Figure 12. The optimization algorithm used for multilateral well placement opti-333 mization contains several modules, which allow to easily enhance capability.

334
Algorithm run in closed-loop iteration presented in Fig.12. As the inputs for the optimization loop, the reservoir model and initial control vector (sets of end-points) are required. In the simulation module, the control vector is translated into simulator keywords and called the external simulator (in this case, we used Schlumberger Eclipse software). The completed simulation returns the production profile including oil, gas, and water production, as well water and gas injection if present for each well in the simulation in the given time domain. The production profile is pushed into the objective function evaluation module where project NPV is determined. The project value (NPV) is passed through the termination criterion (the difference between the iteration or a total number of iterations); if the criterion is not fulfilled, the optimization core algorithm is called. The optimization core (H) involves control vector U m and the objective function value for that control vector J(U m ). In this paper, we introduce GA and PSO as the optimization core algorithm. Thus, updates to the solution of the control vector can be expressed as U m+1 = H (U m , J(P m )). The optimization algorithms used in this work are used for a certain set of solutions, called the population-ū. The population is a set consisting of H solution individuals: To illustrate the population, assume that the population consists of H = 5 individual solutions. In the generation of m (the iteration of the optimization algorithm), individual solutions U h ,h = 1 . . . , H are located in the solution space. Each individual solution represents a certain vector of decision variables. The assessment of the population is based on the value of the objective function J(U h ),h = 1 . . . , H for each vector of decision variables. Then, as a result of the optimization algorithm, a new population of solutions is generated: U m+1 = H (U m , J(P m )). As a result of the optimization algorithm, a population is created in which there is at least one solution satisfying the relationship:

Reservoir Simulation Model
The synthetic reservoir model used in this study is a three-dimensional system and consists of a 94 × 75 × 10 grid cell arrangement (N x , N y , N z ) corresponding to the x, y, z directions, covering Energies 2020, 13, 3926 14 of 23 an area of 17.625 km 2 . The individual cell size is 50 × 50 × 3 m. The spatial distributions of porosity, permeability, NTG (net to gross) , oil saturation, and pressure are presented in Figures 13 and 14. The statistical analysis of the petrophysical properties is presented in Table 1. Fluid-rock interaction is illustrated in Figure 15. Table 1. Statistical analysis of the basic petrophysical parameters in the evaluated reservoir. Source: typical values for reservoirs located in the Carpathian area of Poland, internal AGH UST Drilling, Oil and Gas faculty report. Adapted from Janiga et al. [33].      Figure 15. Fluid-rock interaction function. Source: AGH UST Drilling, Oil and Gas Faculty synthetic benchmark model, based on data from the internal investigation of fluid-rock interaction in the Carpathian fields.

Optimization Assumptions
Referring to the objective function of the optimization case study, several assumptions were made. The optimization time was 20 years, with a 0.5 year simulation time step. The economic parameters used for the optimization are listed in Table 2. The implementation of a multilateral well in reservoir management requires a high capital cost. The cost of drilling the vertical well part was taken as the average in Poland case in the Carpathian area, taking into account the reservoir depth. Branches' drilling cost was adopted from previous field experience due to the lack of Polish MLW applications [34,35]. Hydrocarbon revenue values have a higher value, which ensures meeting the threshold of new technology in the research and development application.
The proposed end-point multilateral well algorithm was implemented in a dynamic simulation model. Each of the individual side wells provides a second layer in the numerical model (s (z) = 2). Multilateral wells are controlled by a bottom pressure of 100 bar with a limit of maximum oil production of a 25 m 3 /d per individual side well depending on the number of side wells. The determined BHP (bottom hole pressure) in the production well forced a single-phase flow in a reservoir (the bubble point pressure is equal to 90 bar). The optimization focused on finding discrete values for the location of end-point wells on the numerical grid represented by block coordinates (s (x) , s (y) ) that maximize the objective function, assuming economic and technological constraints. Optimization was performed using a genetic algorithm and a particle swarm algorithm. In addition, it was assumed that the algorithms used (GA and PSO) operated on populations of H = 10 individuals, which means that during one iteration of the optimization algorithm (generation), 10 numerical simulations of the hydrocarbon reservoir work were performed in accordance with a given vector of decision variables. The termination condition assumed M = 50 iterations of the algorithm's main loop.
The optimization was carried out for the following number of nodal points: • Case A: horizontal well-N g = 2 nodal points, • Case B: bilateral well-N g = 3 nodal points, • Case C: trilateral well-N g = 4 nodal points, • Case D: quad-lateral well-N g = 5 nodal points.

Results and Discussion
According to the workflow procedure and example implementation schemas, the obtained results were gathered and post-processed. Optimization runs were examined in terms of convergence and termination criteria. The reservoir performance for well design patterns was investigated, and a general cause-effect observation was made.

Reservoir Production Performance and Optimization Results
Firstly, the effect of reservoir performance on the objective function trends will be evaluated. According to Figures 16 and 17, a horizontal well maintains the oil production rate control during the whole production period. With the individual control of each side well, it is possible to maintain the production at a constant level for a period of eight to 20 years with the assumed case study. The horizontal well works with constant performance throughout the entire period, regardless of the optimization algorithm chosen. The bilateral well can operate at a constant production rate for over nine years apart from the optimization algorithm. Tri-and quad-lateral wells, due to the high production rate, can operate 12.1 and 9.8 years respectively. Decreasing the hydrocarbon production rate affects the reservoir pressure and reservoir water production rate. The horizontal well pattern has the advantage of delaying reservoir water breakthrough. Reservoir brine is produced from the 10th year of the simulation time. Other well design schema have accelerated water production. The major difference between the GA and PSO optimization run is visible for the water production in Case C and is related to the modification of one well branch trajectory in a reservoir. In terms of total oil production, Cases C and D have similar end values. However, Case D promotes faster oil production, which has a significant impact on project NPV. It can be seen that increasing the number of side wells (from three to four) for both the genetic algorithm and the swarm algorithm does not increase production, but only its acceleration over time. The values of the objective function for selected locations of the end-point node are presented in Table 3.    The genetic algorithm and particle swarm optimization algorithm implement mechanisms to avoid local attraction areas in the objective function; however due to the stochastic realization and population upgrade mechanism, a difference between the algorithms can be noticed. Case B has minor divergence in the GA and PSO realization, but even a small well pattern design can affect the objective function. It also should be noted that for the quad-lateral well, capital expenditure is the highest; nevertheless, the acceleration of oil production affects the project NPV, indicating that type of well as the most promising to implement in the reservoir. The best results were obtained by implement the PSO algorithm for Case D, outperforming the GA run by 3.5 mln $. A major concern in Case D is the relatively high reservoir water production from the beginning of production. The end-point well location can affect the reservoir's performance and project profitability.

Results of Multilateral Well Placement in the 3D Spatial Domain
The optimal solutions for the location of the nodal points of the multilateral wells obtained using optimization algorithms are presented in Tables 4 and 5.  Small changes of the end-point positions can change the project profitability, increase the water production rate, accelerate water breakthrough, and increase the utilization of reservoir energy. The result of the optimization algorithm, multilateral trajectories, was implemented on a numerical grid, which is presented in Figures 18 and 19. The objective function for wells with a complex trajectory takes into account their length; therefore, the results obtained should be treated as optimal in terms of location and length. A list of the lengths of individual well branches is shown in Table 6. Considering the total well length, GA and PSO propose the same length for Case A. PSO promotes a shorter total well length pattern, which can be addressed as drilling risk mitigation.

Optimization Run Convergence
Changes in the average and best population fit for the considered case study of implementation of the multi-bottom well are shown in Figures 20 and 21. For both the genetic algorithm and the particle swarm algorithm, a monotonic increase in the maximum values of the target function was observed during the algorithm operation. The optimization run for each of the multilateral well patterns was terminated in the case of exceeding the number of iterations or the flattening of objection function trends. In all of the cases, the optimization was terminated by the number of iterations. The genetic algorithm has a slower convergence ratio, especially for complex problems (Cases C and D). This is related to the number of decision variables; enhancing the problem search space simultaneously required several iterations to meet the convergence criteria. Both GA and PSO implement a fine-tuning mechanism; however, that part was not evaluated on this paper.

Model Limitation
The proposed model is currently under further improvement; thus, some limitations of application can be listed. The current end-point model development required extensive testing with various reservoir grid sizes and numbers of cells. However, all tests were performed on orthogonal cell distributions along with the numerical model. That assumption is fulfilled by the Schlumberger Petrel (Version: 2019, Manufacturer: Schlumberger) software used in this study, which develops a reservoir numerical model from geological model forcing cell orthogonality. The impact of cell geometry on the multilateral well trajectory is meaningless, due to the fact that the model evaluates true spatial coordinates. Our preliminary investigation shows that the end-point model can be effectively implemented in any numerical model as long as a multilateral well is placed in a global grid or a local grid directly. The mixing of global and local grid placement is currently forbidden. It also should be noted that the increase of the total cell number in the reservoir model can significantly increase the solution search space, which may lead to optimization conversion failure. We recommended performing a coarse optimization run to establish a promising search space and reduce the search space in the case of fine grid optimization.

Conclusions
The assumed goal of the work was achieved, and based on the results obtained, the following conclusions can be made: • It seems necessary to use a minimum of two different optimization methods to validate the quality of the solutions obtained, • The optimization model developed can be used to complement the manual search method, • Multilateral wells will be concerned as a must in the effective management of hydrocarbon reservoirs, especially in an off-shore application; thus, optimization of trajectory planning should be taken into consideration, • The proposed end-point optimization model integrates well trajectory planning with the reservoir model; thus, the obtained results can be used in effective reservoir management in different time domains, • Our end-point algorithm is easily implemented in the reservoir model and, based on the application of the population-type optimization algorithm, is time-efficient, as well as effortlessly scalable among various models.