# Application Research of Petroleum Basic Data Mining System Based on Intelligent Computing and Decision Tree Algorithm

Authors: Xiaoyan Wang; Jinjin Liang; Xiaoming He; Hua Yang
Journal: Wireless Communications and Mobile Computing
 (2022)

---

## Abstract

Recent improvements in data mining technologies, besides the IoT, enable the implementation of a strategy for boosting oil output from oil wells. As a regularly employed improved oil recovery technology, steam flood injection takes use of thermodynamic and gravitational capabilities to deploy and neutralize oil on-site to raise oil output. Instead of relying on conventional physics to model steam floods, this research proposes using a combination of a chimp optimization algorithm (ChOA) and a decision tree to better represent steam flood performance. We present a method for dealing with a particular type of petroleum time series data using ChOA in conjunction with decision trees and IoT. It is shown that the method is useful in predicting oil production in steam floods. Even more impressive is the 4.02 percent increase in oil output that may be achieved via the use of a new optimization system that offers the best possible steam allocation plan. Our objective has been to develop a cloud-based minimum viable product capable of data collection and storage and also training and deployment of a cloud ChOA model. Predictive maintenance, for example, might benefit from this workflow’s ability to analyze time series data.


---

## Body

## 1. Introduction

IoT and intelligent systems both have a solid track record in a variety of sectors. The petroleum industry has recently begun to pay greater attention to them. Traditional petroleum industry difficulties can be solved using an intelligent system. The applications of computer science in geoscience were outlined in reference [1]. Using computer vision, petrophysics has made significant progress over the last few years.Real-time data collection and model generation can be performed through the establishment of IoT networks or a cloud hosting. The petroleum industry exploration and production use it extensively, notably in the upstream sector. It has a wide range of uses. This IoT-based architecture is described in detail in reference [2], which both provide an overview of recent advancements in sensor networks for the petroleum industry as well as open problems that have to be addressed. In order to forecast a possible three percent increase under oil production, an intelligent system and the Internet of Things were used to establish an effective method for predicting oil production in steam flood situations and an optimization system for steam assignment.Research into ways to increase oil output in order to fulfill rising global energy needs is a hot topic. One of the most often utilized techniques for increasing postnatural oil extraction oil output is enhanced oil recovery. Due to low well pressure, the natural pumping step often results in 70% residual crude oil. There are three basic ways of increased oil recovery: heat injection, gas injection, and chemical injection. When heavy oil is mobilized and diluted utilizing steam and gravity potential, production wells may readily recover oil from reservoirs by injecting steam into infill wells.For decades, experts have been trying to predict how much oil steam flood fields will produce. Steam flood performance and oil output may be predicted using traditional analytical models, which were created utilizing physics concepts as well as reservoir parameters. Contrary to expectations, real oil output was far lower than predicted. Steam flood injection intelligent system research is few and far between. A novel steam flood screening criterion was developed in reference [3], using the clustering technique, an intelligent system approach, in order to assist in the selection of the improved oil recovery method to be used for various reservoir circumstances. However, it does not include projections for oil output.It has been claimed in recent years that heavy oil wells can be improved by using a decision tree model [4]. However, decision trees need knowledge of the properties of the optimization issue and some information about the gradient. In recent years, the use of metaheuristic algorithms (MAs) in optimization problems has grown in popularity [5, 6].According to [7–9], metaheuristics can be divided into two main classes: single-solution-based and population-based. In the former class (simulated annealing for instance), the search process starts with one candidate solution. This single candidate solution is then improved over the course of iterations. Population-based metaheuristics, however, perform the optimization using a set of solutions (population). In this case, the search process starts with a random initial population (multiple solutions), and this population is enhanced over the course of iterations. Population-based metaheuristics have some advantages compared to single-solution-based algorithms:
(i)
Multiple candidate solutions share information about the search space which results in sudden jumps toward the promising part of search space(ii)
Multiple candidate solutions assist each other to avoid locally optimal solutions(iii)
Population-based metaheuristics generally have greater exploration compared to single-solution-based algorithmsOne of the interesting branches of the population-based metaheuristics is swarm intelligence algorithm (SIA).However, in this paper, we try to divide the metaheuristic algorithm by their nature-inspiring origin, as previous authoritative references have made these categories in other ways [10–13, 16]. In this kind of categorization, there are both single-vector and swarm methods in each category. For example, in the physic-based category, there is GA (population-based) and SA (single-solution-based).NFL theorem [14] states that there is no MA that can effectively address all optimization issues as the best approach. This has resulted in the creation of novel MAs capable of addressing a range of optimization problems. The ChOA is a new tool for collective hunting that mimics the expertise and sexual encouragement of agents. According to [15], this algorithm has the potential to outperform other MAs in terms of performance. Researchers have used the ChOA algorithm in three different types of studies since it was first introduced in 2020.In general, the following are some advantages that ChOA has over other MOAs:(i)
Especially for situations involving larger dimensions, the division of chimps into autonomous groups ensures that the search space will be thoroughly explored(ii)
ChOA exploitability is highlighted by the hypothesized semideterministic feature in chaotic maps(iii)
Chaotic maps aid the ChOA method in resolving local stagnations of optimas(iv)
As a result of the ChOA algorithm’s use of four different populations of search agents, local optima avoiding is extremely high(v)
As the number of iterations rises, special forms of certain f parameters encourage exploitation and convergence(vi)
Chimps learn about the search space with each iteration(vii)
In order to preserve the greatest answer so far, ChOA nearly relies on its own memory(viii)
ChOA contains a few settings that can be adjusted(ix)
The suggested approach is simple to implement due to the parallel nature of independent (unrelated) groups and the flexibility of ChOA(x)
Chimpanzees have a wide range of abilities and knowledge, but they all work together as part of a group of hunters. As a result, each hunter’s unique skill set can be put to good use at different points in the huntThese include time series prediction [16], COVID-19-positive cases’ detection by X-ray pictures [15], economic load dispatching, efficient fuzzy classification [17], and sonar database categorization [10]. Despite the fact that these studies have some validity, attempting to solve a well-known problem by introducing new paradigms or approaches is not a productive research strategy.Other optimization methods, such as hybrid SCA-ChOA [18], combination random vector functional ChOA, and spotted hyena Sh-ChOA, are employed in conjunction with ChOA to increase their performance [19]. For long-term, low-power underwater sensor networks, a hybrid ChOA/HGS approach has been proposed [13]. Hybrid models may be more accurate, but their excessive complexity makes them inappropriate for difficult situations, especially those with several dimensions.Finally, academics have attempted to increase the ChOA’s performance by creating or altering specific operators. In order to speed up ChOA convergence, the WChOA employed an average weighting approach [8]. Niching-ChOA adopted ChOA’s niching approach in order to boost its exploratory abilities [11], whereas the EChOA [9] used the incredibly destructive exponential mutation and correlation parameters to start the population with the lowest social status chimpanzees. Classifiers were developed using Fuzzy-ChOA [20], which uses fuzzy models to modify the ChOA. DLF-ChOA (dynamic levy flight ChOA) is a variation on ChOA that aims to improve global performance [7].Given the novelty of ChOA, some study has focused on how it may be improved. Because of this, its precision and convergence rate may be enhanced even more. The goal of this research is to increase the decision tree’s performance by using it in conjunction with ChOA for predicting oil production in steam floods.According to the following structure, the rest of this paper will be as follows: Section2 introduces the subject matter, Section 3 explains the technique, Section 4 gives the simulation results and discussion, and Section 5 concludes the article.


## 2. Background Materials

The decision tree and ChOA will be briefly reviewed in this section.


### 2.1. Decision Tree

A decision tree is just a data flow diagram architecture where each node in the middle represents tests and each route represents the results of the tests. This means that each leaf node represents a class label. The roots and leaves of a tree indicate classification criteria. Visual and analytical help for decision-making is provided by decision trees and influence diagrams, in which the predicted values (or usefulness) of competing choices are estimated. Three types of nodes may be found in a decision tree’s branches:(i)
Decision nodes: a typical way to represent these nodes is to use squares(ii)
Nodes of randomness: usually depicted by concentric circles(iii)
End nodes: end nodes are frequently denoted with trianglesOperation research frequently employs decision trees. A probability model should be used as the best choice framework or online selection model method if decision-making should be carried out online without any recall under incomplete knowledge. Decision trees may also be used to calculate conditional probabilities by providing a visual representation of the relationships between variables.


### 2.2. Chimp Optimization Algorithm

A fission-fusion system governs chimp social life. The mix of society in this type of civilization changes with time. For each community member, there is an inherent talent or task that might vary throughout time [21]. Due to the fact that each chimp group has its own unique capacity to do a certain task, the notion of independent groups is included in this algorithm.According to prior research, chimps may be divided into four categories: drivers, barriers, chasers, and attackers. To ensure a successful hunt, they are tasked with a variety of responsibilities. Rather than attempting to seize their victim, drivers simply follow along behind them. The prey’s escape route is obstructed by barriers erected in trees. Chasers pursue their prey at breakneck speed in order to snatch them. As a final precaution, predators know the prey’s escape path down into the lower treetops. Figure1 depicts the various stages of the hunt. Attackers must be better at guessing the prey’s future moves. As a result, a successful hunt is rewarded with a bigger portion of meat for the attacker. Age, intelligence, and physical prowess all play a part in a player’s ability to attack. It is possible for chimpanzees to switch roles during a hunt or retain their roles throughout the entire operation.Figure 1
Two main stages of ChOA.
(a)
Exploration(b)
ExploitationAccording to a recent study, chimpanzees seek meat in order to exchange it for social privileges like sex or grooming. Because of this, intelligence and knowledge may have an unintentional influence on the quest. The term “social incentives” has been used solely by humans and chimpanzees, to our knowledge. A unique advantage is given to chimpanzees in this regard compared to other social predators. As a result, chimpanzees operate in a disorderly fashion in the closing stages of the hunt, allowing each chimpanzee to pursue his or her own goal of obtaining prey. Chimps hunt in two phases: “exploration,” in which they drive, block, and chase their prey, and “exploitation,” in which they assault it. Exploitation is the first step of chimpanzee social hunting. Figure1 depicts these two stages. In the next part, we will go through the mathematical models for the hunt’s first two stages and its last four steps [21].As previously stated, hunting occurs during the exploratory and exploitative stages. Equations (1) and (2) are used to numerically simulate driving and pursuing the prey [21].
(1)d=c.xpreyt−m.xchimpt,(2)xchimpt+1=xpreyt−a.d,where t is the latest iteration, a, m, and c are the regression coefficients, and xchimp and xprey denote the chimp and prey position vectors, respectively. Additionally, a, m, and c coefficients are determined using
(3)a=2.f.r1−a,(4)c=2.r2,(5)m=Chaotic_value.The iteration procedure reducesf nonlinearly from 2.5 to 0. Additionally, r1 and r2 are random vectors inside the range [0,1]. Furthermore, m is a chaotic variable computed from the numerous chaotic maps; this vector therefore captures the chimps’ desire on the hunting process. The next sections will provide a detailed description of these vectors. The classic population-based method allows individuals to be seen as a single group with a common search strategy since all individuals act identically in local and global searches. It is possible to obtain a straight and a stochastic search result using different population-based techniques, but, this is only theoretical. Independent chimp groups will be mathematically described in the next sections, in which several methods of updating f are used. To keep the separate groups up to date, you can use any continuous function. f must be reduced with each iteration of these equations. It must be noted that the coefficient vectors are indicated in bold type such as m, a, and d, and every multiplication between two arrays such as “a.d and f.r1” means array multiplication.All minimization strategies face the challenge of locating the global minimum. In population-based optimization approaches, generally, the preferred manner to converge towards the global solution can be divided into two main stages (exploration and exploitation).It is important to encourage individuals to spread out during the initial phases of optimization. In other words, instead of focusing on local minima, they should strive to examine the entire search space. In the later steps, the individuals have to exploit knowledge obtained to converge on the global solution. In ChOA, by fine-adjusting of the variablef, we may combine these two stages to discover global minimum with rapid convergence speed. Based on these considerations, we propose the concept of autonomous groups called “attacker, barrier, chaser, and driver,” which is a four-part system.Individual particles search the issue space using their own technique, which is tuned byf. This means that particles can be viewed as a single group with a single strategy when it comes to both local and global search in population-based optimization methods. However, a population-based optimization algorithm might possibly result in a more randomized and directed search at the same time if it uses a variety of autonomous groups with a shared goal. The autonomous groups are mathematically modeled in this study, using several methods for updating f. To put it another way, the organizations differ in their approach to exploration and exploitation. An autonomous group’s strategy can be updated using any continuous function that has a range between [0, L].These four autonomous groups each employ their own pattern to investigate the search space on a local and global scale. Additionally, the most effective variations of ChOA with distinct subgroups are selected from among the numerous techniques evaluated. The dynamic features off are depicted in Table 1 and Figure 2. t signifies the current iteration, while T denotes the total number of iterations possible. In order to increase the quality of ChOAs, dynamic equations were adjusted to include a wide variety of curves and slopes, guaranteeing that each group shows a different exploration behavior [21].Table 1
Thef vectors.
GroupsDriverAttackerChaserBarrierf−3t3/T3+1.51.95−2t1/4/T1/3−2t3/T3+1.51.95−2t1/3/T1/4Figure 2
Mathematical models of the nonlinear reduction off vectors.To illustrate the notion of Equations (1) and (2), Figure 3 depicts a 2D and 3D representation of a chimp, as well as a number of its probable future places. As shown, a chimpanzee in location (x, y) can adjust its location in relation to the location of its prey x∗,y∗ by modifying the values of the a and c coefficients. It is worth noting that the chimpanzees have access to every point in the search area via the randomized variables r1 and r2. This method may be generalized to search an n-dimensional space.Figure 3
The 2D and 3D presentation of chimps’ positions.
(a)
Two-dimensional(b)
Three-dimensionalTo arithmetically design chimps attacking behavior patterns, two approaches are taken: in the first place, the chimpanzees are able to find their prey’s position by driving, obstructing, and chasing it. Finally, attackers are often in charge of the hunt. The optimal posture of the prey during the initial iteration is unknown. To address this problem, the attacker’s location is considered to be that of the prey. As a result, the optimal solution are preserved, and other chimpanzees are prompted to adjust their locations depending on the best chimps’ placements. Equations (6) to (8) define this approach [21]:
(6)dA=c1⋅xA−m1⋅x,dB=c2⋅xB−m2⋅x,dCh=c3⋅xCh−m3⋅x,dD=c4⋅xD−m4⋅x,(7)x1=xA−a1dA,x2=xB−a2dB,x3=xCh−a3dCh,x3=xD−a4dD,(8)xt+1=14∑k=14xk.A chimpanzee’s location in the search area is constantly changed based on the position of other chimpanzees, as seen in Figure4. The chimpanzee’s ultimate location may be observed to be in a circle established by the positions of the assailant, barrier, pursue, and drivers.Figure 4
The producers of chimp’s updating position.To summarize, the chimps will assault their prey until it is no longer moving and then end their search. Reducing the value off linearly will help us better understand how an assault works. The range of a vector is likewise lowered, much like the range of f vector. As seen in Figure 5, a chimp’s future position will be anyplace between its current position and the position of the prey. Despite the recommended pushing, blocking, and pursuing tactics, there is still a possibility that chimps will be trapped in local minima. To emphasize the exploratory skills in the evaluation stage, another operator is required. Instead of relying on only one operator, ChOA requires an additional operator during the exploitation phase to help avoid local minima trapping.Figure 5
The algorithms’ convergence curves in unimodal function.Divergent and converging chimpanzee attacks are common in ChOA. This behavior is mathematically represented in Figure6 by allocating vector a.Figure 6
A chimp’s positional update system is affected bya.ChOA’s exploration phase gets a boost with the addition of thec vector. Equation (4) demonstrates that c is a random vector with a range of [0, 2]. Predator-prey distance may be calculated mathematically using Equation (4). When chimps are out in the wild, the vector of c acts as a deterrent, keeping them from getting close to their prey. Prey can be made more difficult or easy to catch thanks to the vector of c.Chimp’s social motivation depends on hunting meat, as previously indicated. The chimpanzees are forced to give up their own hunts in order to get their hands on the final piece of hunting meat. Because of this, they will do everything to get their hands on flesh from a hunt in order to satisfy their social needs. Chaos maps can be used to simulate the chimpanzees’ last stage behavior, which is characterized by randomness.Maps utilized to increase ChOA’s performance are shown in Table2 and Figure 7. In reality, randomness may be generated by these deterministic processes as well. All chaotic maps have a starting value of 0.7. Modeling the update process in this way looks like this [21]:
(9)xchimpt+1=xpreyt−a.difμ<0.5,Chaotic_valueifμ≥0.5,where μ denotes a random number between 0 and 1. In this equation, the normal behavior of chimp for changing position xchimpt+1=xpreyt−a.d is substituted by values from the chaotic map (Chaotic_value) to provide chaotic behaviors for justification of sexual motivation of chimp. Indeed, this term reduces the risk of getting stuck in local minima by changing the search space, chaotically. In fact, by using the chaotic maps, we can control how the search space is changed in addition to the random behavior.Table 2
Chaotic maps.
No.NameChaotic mapRange1Quadraticxi+1=x2i−c(0,1)2Chebyshevxi+1=cosi×cos−1xi(-1,1)3Gauss/mousexi+1=1,xi=01/modxi,1,else(0,1)4Iterativexi+1=sin7π/10×xi(-1,1)5Logisticxi+1=αxi1−xi,α=4(0,1)6Singerxi+1=7.75xi−23.29xi2+28.64xi3−13.29xi4×μ(0,1)7Bernoullixi+1=2×ximod1(0,1)8Sinexi+1=sinπ×xi(0,1)9Tentxi+1=10×xi/7,xi<0.710/31−xi,0.7≤xi(0,1)10Circlexi+1=modxi+0.2−1/4×πsin2πxk,1(0,1)Figure 7
The chaotic map visualization.Starting with a random chimpanzee population, ChOA is launched in the first phase of its development (candidate solutions). Four groups of chimps are randomly assigned. After that, each chimp uses its own group approach to update itsf coefficients. The prey’s distance from each possible solution is then updated. Additionally, adaptive adjustment of the c and m results in the avoidance of local optima while increasing the pace of convergence. f is also lowered to 0 from its previous value of 2.5, further aiding exploitation. Divergence from prey occurs when there is a disparity between predators and prey. Finally, chaotic maps aid in rapid convergence while avoiding local minima.


## 2.1. Decision Tree

A decision tree is just a data flow diagram architecture where each node in the middle represents tests and each route represents the results of the tests. This means that each leaf node represents a class label. The roots and leaves of a tree indicate classification criteria. Visual and analytical help for decision-making is provided by decision trees and influence diagrams, in which the predicted values (or usefulness) of competing choices are estimated. Three types of nodes may be found in a decision tree’s branches:(i)
Decision nodes: a typical way to represent these nodes is to use squares(ii)
Nodes of randomness: usually depicted by concentric circles(iii)
End nodes: end nodes are frequently denoted with trianglesOperation research frequently employs decision trees. A probability model should be used as the best choice framework or online selection model method if decision-making should be carried out online without any recall under incomplete knowledge. Decision trees may also be used to calculate conditional probabilities by providing a visual representation of the relationships between variables.


## 2.2. Chimp Optimization Algorithm

A fission-fusion system governs chimp social life. The mix of society in this type of civilization changes with time. For each community member, there is an inherent talent or task that might vary throughout time [21]. Due to the fact that each chimp group has its own unique capacity to do a certain task, the notion of independent groups is included in this algorithm.According to prior research, chimps may be divided into four categories: drivers, barriers, chasers, and attackers. To ensure a successful hunt, they are tasked with a variety of responsibilities. Rather than attempting to seize their victim, drivers simply follow along behind them. The prey’s escape route is obstructed by barriers erected in trees. Chasers pursue their prey at breakneck speed in order to snatch them. As a final precaution, predators know the prey’s escape path down into the lower treetops. Figure1 depicts the various stages of the hunt. Attackers must be better at guessing the prey’s future moves. As a result, a successful hunt is rewarded with a bigger portion of meat for the attacker. Age, intelligence, and physical prowess all play a part in a player’s ability to attack. It is possible for chimpanzees to switch roles during a hunt or retain their roles throughout the entire operation.Figure 1
Two main stages of ChOA.
(a)
Exploration(b)
ExploitationAccording to a recent study, chimpanzees seek meat in order to exchange it for social privileges like sex or grooming. Because of this, intelligence and knowledge may have an unintentional influence on the quest. The term “social incentives” has been used solely by humans and chimpanzees, to our knowledge. A unique advantage is given to chimpanzees in this regard compared to other social predators. As a result, chimpanzees operate in a disorderly fashion in the closing stages of the hunt, allowing each chimpanzee to pursue his or her own goal of obtaining prey. Chimps hunt in two phases: “exploration,” in which they drive, block, and chase their prey, and “exploitation,” in which they assault it. Exploitation is the first step of chimpanzee social hunting. Figure1 depicts these two stages. In the next part, we will go through the mathematical models for the hunt’s first two stages and its last four steps [21].As previously stated, hunting occurs during the exploratory and exploitative stages. Equations (1) and (2) are used to numerically simulate driving and pursuing the prey [21].
(1)d=c.xpreyt−m.xchimpt,(2)xchimpt+1=xpreyt−a.d,where t is the latest iteration, a, m, and c are the regression coefficients, and xchimp and xprey denote the chimp and prey position vectors, respectively. Additionally, a, m, and c coefficients are determined using
(3)a=2.f.r1−a,(4)c=2.r2,(5)m=Chaotic_value.The iteration procedure reducesf nonlinearly from 2.5 to 0. Additionally, r1 and r2 are random vectors inside the range [0,1]. Furthermore, m is a chaotic variable computed from the numerous chaotic maps; this vector therefore captures the chimps’ desire on the hunting process. The next sections will provide a detailed description of these vectors. The classic population-based method allows individuals to be seen as a single group with a common search strategy since all individuals act identically in local and global searches. It is possible to obtain a straight and a stochastic search result using different population-based techniques, but, this is only theoretical. Independent chimp groups will be mathematically described in the next sections, in which several methods of updating f are used. To keep the separate groups up to date, you can use any continuous function. f must be reduced with each iteration of these equations. It must be noted that the coefficient vectors are indicated in bold type such as m, a, and d, and every multiplication between two arrays such as “a.d and f.r1” means array multiplication.All minimization strategies face the challenge of locating the global minimum. In population-based optimization approaches, generally, the preferred manner to converge towards the global solution can be divided into two main stages (exploration and exploitation).It is important to encourage individuals to spread out during the initial phases of optimization. In other words, instead of focusing on local minima, they should strive to examine the entire search space. In the later steps, the individuals have to exploit knowledge obtained to converge on the global solution. In ChOA, by fine-adjusting of the variablef, we may combine these two stages to discover global minimum with rapid convergence speed. Based on these considerations, we propose the concept of autonomous groups called “attacker, barrier, chaser, and driver,” which is a four-part system.Individual particles search the issue space using their own technique, which is tuned byf. This means that particles can be viewed as a single group with a single strategy when it comes to both local and global search in population-based optimization methods. However, a population-based optimization algorithm might possibly result in a more randomized and directed search at the same time if it uses a variety of autonomous groups with a shared goal. The autonomous groups are mathematically modeled in this study, using several methods for updating f. To put it another way, the organizations differ in their approach to exploration and exploitation. An autonomous group’s strategy can be updated using any continuous function that has a range between [0, L].These four autonomous groups each employ their own pattern to investigate the search space on a local and global scale. Additionally, the most effective variations of ChOA with distinct subgroups are selected from among the numerous techniques evaluated. The dynamic features off are depicted in Table 1 and Figure 2. t signifies the current iteration, while T denotes the total number of iterations possible. In order to increase the quality of ChOAs, dynamic equations were adjusted to include a wide variety of curves and slopes, guaranteeing that each group shows a different exploration behavior [21].Table 1
Thef vectors.
GroupsDriverAttackerChaserBarrierf−3t3/T3+1.51.95−2t1/4/T1/3−2t3/T3+1.51.95−2t1/3/T1/4Figure 2
Mathematical models of the nonlinear reduction off vectors.To illustrate the notion of Equations (1) and (2), Figure 3 depicts a 2D and 3D representation of a chimp, as well as a number of its probable future places. As shown, a chimpanzee in location (x, y) can adjust its location in relation to the location of its prey x∗,y∗ by modifying the values of the a and c coefficients. It is worth noting that the chimpanzees have access to every point in the search area via the randomized variables r1 and r2. This method may be generalized to search an n-dimensional space.Figure 3
The 2D and 3D presentation of chimps’ positions.
(a)
Two-dimensional(b)
Three-dimensionalTo arithmetically design chimps attacking behavior patterns, two approaches are taken: in the first place, the chimpanzees are able to find their prey’s position by driving, obstructing, and chasing it. Finally, attackers are often in charge of the hunt. The optimal posture of the prey during the initial iteration is unknown. To address this problem, the attacker’s location is considered to be that of the prey. As a result, the optimal solution are preserved, and other chimpanzees are prompted to adjust their locations depending on the best chimps’ placements. Equations (6) to (8) define this approach [21]:
(6)dA=c1⋅xA−m1⋅x,dB=c2⋅xB−m2⋅x,dCh=c3⋅xCh−m3⋅x,dD=c4⋅xD−m4⋅x,(7)x1=xA−a1dA,x2=xB−a2dB,x3=xCh−a3dCh,x3=xD−a4dD,(8)xt+1=14∑k=14xk.A chimpanzee’s location in the search area is constantly changed based on the position of other chimpanzees, as seen in Figure4. The chimpanzee’s ultimate location may be observed to be in a circle established by the positions of the assailant, barrier, pursue, and drivers.Figure 4
The producers of chimp’s updating position.To summarize, the chimps will assault their prey until it is no longer moving and then end their search. Reducing the value off linearly will help us better understand how an assault works. The range of a vector is likewise lowered, much like the range of f vector. As seen in Figure 5, a chimp’s future position will be anyplace between its current position and the position of the prey. Despite the recommended pushing, blocking, and pursuing tactics, there is still a possibility that chimps will be trapped in local minima. To emphasize the exploratory skills in the evaluation stage, another operator is required. Instead of relying on only one operator, ChOA requires an additional operator during the exploitation phase to help avoid local minima trapping.Figure 5
The algorithms’ convergence curves in unimodal function.Divergent and converging chimpanzee attacks are common in ChOA. This behavior is mathematically represented in Figure6 by allocating vector a.Figure 6
A chimp’s positional update system is affected bya.ChOA’s exploration phase gets a boost with the addition of thec vector. Equation (4) demonstrates that c is a random vector with a range of [0, 2]. Predator-prey distance may be calculated mathematically using Equation (4). When chimps are out in the wild, the vector of c acts as a deterrent, keeping them from getting close to their prey. Prey can be made more difficult or easy to catch thanks to the vector of c.Chimp’s social motivation depends on hunting meat, as previously indicated. The chimpanzees are forced to give up their own hunts in order to get their hands on the final piece of hunting meat. Because of this, they will do everything to get their hands on flesh from a hunt in order to satisfy their social needs. Chaos maps can be used to simulate the chimpanzees’ last stage behavior, which is characterized by randomness.Maps utilized to increase ChOA’s performance are shown in Table2 and Figure 7. In reality, randomness may be generated by these deterministic processes as well. All chaotic maps have a starting value of 0.7. Modeling the update process in this way looks like this [21]:
(9)xchimpt+1=xpreyt−a.difμ<0.5,Chaotic_valueifμ≥0.5,where μ denotes a random number between 0 and 1. In this equation, the normal behavior of chimp for changing position xchimpt+1=xpreyt−a.d is substituted by values from the chaotic map (Chaotic_value) to provide chaotic behaviors for justification of sexual motivation of chimp. Indeed, this term reduces the risk of getting stuck in local minima by changing the search space, chaotically. In fact, by using the chaotic maps, we can control how the search space is changed in addition to the random behavior.Table 2
Chaotic maps.
No.NameChaotic mapRange1Quadraticxi+1=x2i−c(0,1)2Chebyshevxi+1=cosi×cos−1xi(-1,1)3Gauss/mousexi+1=1,xi=01/modxi,1,else(0,1)4Iterativexi+1=sin7π/10×xi(-1,1)5Logisticxi+1=αxi1−xi,α=4(0,1)6Singerxi+1=7.75xi−23.29xi2+28.64xi3−13.29xi4×μ(0,1)7Bernoullixi+1=2×ximod1(0,1)8Sinexi+1=sinπ×xi(0,1)9Tentxi+1=10×xi/7,xi<0.710/31−xi,0.7≤xi(0,1)10Circlexi+1=modxi+0.2−1/4×πsin2πxk,1(0,1)Figure 7
The chaotic map visualization.Starting with a random chimpanzee population, ChOA is launched in the first phase of its development (candidate solutions). Four groups of chimps are randomly assigned. After that, each chimp uses its own group approach to update itsf coefficients. The prey’s distance from each possible solution is then updated. Additionally, adaptive adjustment of the c and m results in the avoidance of local optima while increasing the pace of convergence. f is also lowered to 0 from its previous value of 2.5, further aiding exploitation. Divergence from prey occurs when there is a disparity between predators and prey. Finally, chaotic maps aid in rapid convergence while avoiding local minima.


## 3. Model Developing

The classic technique relies on well-established algorithms and input data to forecast an output, such as oil production. This problem can be solved in a different way using intelligent system techniques. In the MA technique, candidate models are trained using the input and output from a training dataset (Figure8).Figure 8
Comparison of intelligent and traditional approaches for oil production prediction.The best model is determined using predetermined criteria and tested on a new dataset that was never used before. The conventional technique is motivated by physical principles, whereas data drive intelligent systems. Developing intelligent system models does not necessitate the use of geological parameters, as is the case with more traditional methods. The proportional value of each element in an intricate nonlinear system may be determined using decision tree-based intelligent system techniques such as random forests and XGBoost [22]. Using an intelligent system’s tremendous capabilities, a steam flood monitoring team can statistically investigate ways to increase oil output. IoT and intelligent systems work well together. Because of the real-time data gathering, storage capabilities of IoT, and the ability to train and deploy intelligent system models on a cloud infrastructure or IoT devices, intelligent systems can analyze vast amounts of data gathered by IoT nodes to uncover previously unknown patterns. Incorporating IoT and intelligent system technologies is a win-win situation for this project.


### 3.1. Data Collection and Introduction

In the field, edge sensors gather raw data from five different data sources. Schematic design, principal keys, and sample frequency differ among the sources. To gather and cross-reference data, collect errors, and consolidate them into a single location, daily extract, transform, and load tasks are employed. After that, they have moved to a cloud storage facility so that the data engineering procedure may get started.At the well level, Table3 depicts the daily structure of a neighboring dependent well dataset. To accurately predict the daily oil output from each well, we want to create a single model for each pad. Sixteen variables are included in the dataset. Two types of wells fall under the well name umbrella: infill and production. Sensor data is a collection of real-time temperature and pressure readings taken in the field. There is a difference between infill wells and those that are currently producing oil: infill wells use steam volume as the daily amount of steam that is injected into the wells. An oil-producing well’s daily output is known as its “oil volume.” The empirical dataset is bound to have some missing data. The data science stage is required before putting data into a decision tree algorithm.Table 3
Structure of a well level’s daily dataset.
DateIdentifier of wellCondition of wellSensor dataSteam volumeOil volume2021-11-12ProdPump88NA192021-11-13ProdShut-in198NA292021-11-12InfillN/ANA5N/A2021-11-13InfillNANA10NA


### 3.2. Methodology

There are five stages in the workflow process: data collection and transmission, statistical modeling, model creation, visualization of data, and system optimization. We use to the front and reverse copies to fill in the blanks for missing data for a variety of variables. Data engineering requires the whole history of all wells, so no records are discarded. The dataset has been divided into two subsets because there are two types of wells. For each of the infill wells, we construct a new data format based on the daily amounts of steam injected into each row, column, and feature. Two sets of characteristics have been added to the production-well subset. There is a gas/day/rate and a one-hot encoding of production wells based on categorical data, such as the well identifier and well condition. After reorganizing infill wells and aligning production wells by date, we create a new dataset by merging the two sets.


## 3.1. Data Collection and Introduction

In the field, edge sensors gather raw data from five different data sources. Schematic design, principal keys, and sample frequency differ among the sources. To gather and cross-reference data, collect errors, and consolidate them into a single location, daily extract, transform, and load tasks are employed. After that, they have moved to a cloud storage facility so that the data engineering procedure may get started.At the well level, Table3 depicts the daily structure of a neighboring dependent well dataset. To accurately predict the daily oil output from each well, we want to create a single model for each pad. Sixteen variables are included in the dataset. Two types of wells fall under the well name umbrella: infill and production. Sensor data is a collection of real-time temperature and pressure readings taken in the field. There is a difference between infill wells and those that are currently producing oil: infill wells use steam volume as the daily amount of steam that is injected into the wells. An oil-producing well’s daily output is known as its “oil volume.” The empirical dataset is bound to have some missing data. The data science stage is required before putting data into a decision tree algorithm.Table 3
Structure of a well level’s daily dataset.
DateIdentifier of wellCondition of wellSensor dataSteam volumeOil volume2021-11-12ProdPump88NA192021-11-13ProdShut-in198NA292021-11-12InfillN/ANA5N/A2021-11-13InfillNANA10NA


## 3.2. Methodology

There are five stages in the workflow process: data collection and transmission, statistical modeling, model creation, visualization of data, and system optimization. We use to the front and reverse copies to fill in the blanks for missing data for a variety of variables. Data engineering requires the whole history of all wells, so no records are discarded. The dataset has been divided into two subsets because there are two types of wells. For each of the infill wells, we construct a new data format based on the daily amounts of steam injected into each row, column, and feature. Two sets of characteristics have been added to the production-well subset. There is a gas/day/rate and a one-hot encoding of production wells based on categorical data, such as the well identifier and well condition. After reorganizing infill wells and aligning production wells by date, we create a new dataset by merging the two sets.


## 4. Experimental Results

On the benchmark functions, the suggested ChOA’s performance is assessed first. After that, we will utilize the new ChOA model to get a better handle on oil output. Nine well-known algorithms, including PSO [23], GA, HGSO [24], IWT [25], CBBO [26], BMGWO [27], CFW [28], WOA [29], and NLBBO [30], were utilized to test ChOA’s performance in benchmark functions. In MATLAB, each benchmark issue was run 30 times for each method. Table 4 also shows the algorithm’s initial settings and parameters.Table 4
The initial values and parameters.
ValueParameterAlgorithmChOAfFigure1r1,r2RandommTable1NLBBO and CBBO1Immigration probability1Max (I) and (E)0.005The probability of mutationHGSOvc⟶0,1BMGWOaLinearly decreased from 2 to 0CFWVelocity5 m/sInitial velocity3 m/sTotal weight10−3 kgIWTaLinearly decreased from 2 to 010%ElitismGA0.08Mutation0.92Crossover0.11The inertial movement rate (α)PSO0.65C10.93C2In this part, the suggested method is evaluated against 23 competitive benchmark functions. In order to determine the convergence trend and local optimums, we can use 16 multimodal functions and seven unimodal functions. Nine multimodal functions, as well as seven fixed dimension multimodal functions, are also utilized. In you will find further information. Benchmark difficulties are shown graphically in Figure9. The comparison of various algorithms’ convergence curves is shown in Figures 5–11.Figure 9
3D plot of benchmark functions.Figure 10
The algorithms’ convergence curves in multimodal function.Figure 11
The algorithms’ convergence curves in fixed-dimension function.Here, we provide the findings of a 30-day prediction model that we believe is the best. Figure12 shows the model’s eight most critical characteristics. In order to aid their planning and decision-making, a monitoring team can acquire a qualitative view of the importance of each aspect [29].Figure 12
The model’s eight most critical characteristics.The dataset is separated into test (20 percent) and training (80 percent) datasets. According to Figure13, real oil output is compared to a model’s prediction of monthly oil production. To make things easier to see, the daily output and forecast are both calculated at the well levels and summed over all producing wells in a pad. The root mean square error (RMSE) measure is used to identify the best model from the fivefold cross-validation (RMSE). There has been a substantial improvement over prior studies in predicting test dataset results that are within the -10% to +10% range of the real outputs. As shown in Table 5, optimum and baseline models perform well on training and test datasets, respectively [30]. To anticipate future daily oil output, the baseline model uses the most recent 30-day previous daily production as a starting point. In terms of R2 and RMSE, the decision tree-ChOA model exceeds the baseline model by a wide margin.Figure 13
Comparison of actual values and predicted values using decision tree-ChOA for 12 months.Table 5
The comparison of various benchmark algorithm in oil production prediction.
AlgorithmRMSER2ChOA0.0012±0.00230.852±0.0134CBBO0.0213±0.00550.633±0.0425NLBBO0.0123±0.00660.544±0.0222IWT0.0152±0.00450.725±0.0352PSO0.0523±0.00980.542±0.0769GA0.0512±0.00990.652±0.0785BMGWO0.0265±0.00450.733±0.0211HGSO0.0285±0.00440.722±0.0178CFW0.0123±0.00290.802±0.0149Optimizing steam flood distribution is simple when using a model that can reliably forecast oil production in various sensors. It is an example of a pad with triple infill wells, and infill well 2 took in 4211 m3 of steam volume every month, which is the true total monthly oil output. The model forecasts that 4242 m3 of oil will be produced, which is 0.9 percent more than the actual output. A brute-force search of all potential situations is the simplest way to find the best steam allocation strategy to optimize production. Because of the three infill wells, a set total steam volume is needed to calculate the steam volumes delivered into infill wells 1 and 2, which are two independent parameters.For the best scenario, 30 percent steam injection into infill well 1, four percent injection into infill well 2, and 70 percent injection into infill well 3 yield a maximum oil output of 4339 m3, which is 3.3% higher than the actual production.While brute-force search takes more and longer the more infill wells there are, it may be more practical to employ alternative optimization techniques, such as gradient descent search, in the future. In addition, this optimization system was created with the goal of increasing oil output. An alternative approach to optimization can be used if other goal functions, such as reducing the steam-to-oil ratio to reduce fuel costs, are defined.In order to make this huge improvement, the search agent has been divided into four separate subgroups (assailant, obstacle, follower, and driver), and the chaos-based maps have been used rather than random numbers. As a result, the new method has no additional cost in terms of processing power. This will only work if the various autonomous teams have been set up in concert. Otherwise, the ChOA’s speed will be slightly reduced.


## 5. Conclusion

To handle a specific type of time series data, hybrid decision tree ChOA algorithm has been implemented in this research. In comparison to existing approaches, our model is able to estimate oil output in certain steam flood situations with an exceptional level of precision. The optimization system that we have built can also increase oil output by 3.21% by recommencing the best steam allocation plan. The emergence of cloud platforms for IoT has enabled us to create a cloud-based minimal level viable solution for steam flood optimization, allowing for real-time data collection, transmission, storage, and intelligent system training and deployment on cloud platforms. Steam floods may be studied more thoroughly thanks to this research. It would be fascinating to see how this technique may be applied to additional datasets with comparable time series structures. This method, for example, may be used to develop other metaheuristic algorithms to forecast the quantitative amount of abrasion on a machine part based on past records and the state of future operations.



---

*Source: 1326325-2022-07-25.xml*