Dynamic Multi-Swarm Differential Learning Quantum Bird Swarm Algorithm and Its Application in Random Forest Classification Model

Zhang, Jiangnan; Xia, Kewen; He, Ziping; Fan, Shurui

doi:https://doi.org/10.1155/2020/6858541

Computational Intelligence and Neuroscience

On this page

Abstract Introduction Conclusion Data Availability Conflicts of Interest Acknowledgments References Copyright Related Articles

Research Article | Open Access

Volume 2020 | Article ID 6858541 | https://doi.org/10.1155/2020/6858541

Dynamic Multi-Swarm Differential Learning Quantum Bird Swarm Algorithm and Its Application in Random Forest Classification Model

Jiangnan Zhang,¹Kewen Xia,¹Ziping He,¹and Shurui Fan¹

Academic Editor: Raşit Köker

Received14 Aug 2019

Revised21 Jun 2020

Accepted24 Jun 2020

Published07 Aug 2020

Abstract

Bird swarm algorithm is one of the swarm intelligence algorithms proposed recently. However, the original bird swarm algorithm has some drawbacks, such as easy to fall into local optimum and slow convergence speed. To overcome these short-comings, a dynamic multi-swarm differential learning quantum bird swarm algorithm which combines three hybrid strategies was established. First, establishing a dynamic multi-swarm bird swarm algorithm and the differential evolution strategy was adopted to enhance the randomness of the foraging behavior’s movement, which can make the bird swarm algorithm have a stronger global exploration capability. Next, quantum behavior was introduced into the bird swarm algorithm for more efficient search solution space. Then, the improved bird swarm algorithm is used to optimize the number of decision trees and the number of predictor variables on the random forest classification model. In the experiment, the 18 benchmark functions, 30 CEC2014 functions, and the 8 UCI datasets are tested to show that the improved algorithm and model are very competitive and outperform the other algorithms and models. Finally, the effective random forest classification model was applied to actual oil logging prediction. As the experimental results show, the three strategies can significantly boost the performance of the bird swarm algorithm and the proposed learning scheme can guarantee a more stable random forest classification model with higher accuracy and efficiency compared to others.

1. Introduction

The concept of swarm intelligence was first proposed by Hackwood and Beni in 1992 [1]. Swarm intelligence algorithms have been proved that it can solve nondifferentiable problems, NP-hard problems, and difficult nonlinear problems which the traditional techniques cannot solve. For this reason, swarm intelligence algorithms are hotly researched in computer science and have been updated from generation to generation. For classic swarm intelligence algorithms, particle swarm optimization (PSO) [2] is used to define the basic principle and equations of the swarm intelligence algorithms. In recent years, many new swarm intelligence algorithms have been proposed, such as artificial bee colony (ABC) algorithm [3] which is inspired by the stock of food location behavior of bees. Artificial fish school algorithm (AFSA) [4] and firefly algorithm (FA) [5] are inspired by the foraging process of fish and firefly, and cat swarm optimization (CSO) [6] is developed based on vigilance and foraging behavior of cats in nature. According to the foraging behavior, vigilance behavior, and flight behavior of the bird swarms in nature, Meng et al. proposed a novel swarm intelligence algorithm called bird swarm algorithm (BSA) [7]. Meanwhile, due to these advantages above, swarm intelligence algorithms have been applied to optimize various fields, such as PSO for mutation testing problems [8], genetic algorithm (GA) for convolutional neural networks parameters [9], FA for convolutional neural network problems [10], and whale optimization algorithm (WOA) for cloud computing environments [11]. So, BSA which will be used in this paper has been widely applied to engineering optimization problems.

However, the original swarm intelligence algorithms have limitations in solving some practical problems. Hybrid strategy which is one of the main research directions to improve the performance of swarm intelligence algorithms has become a research hotspot in machine learning. Tuba and Bacanin [12] modified the exploitation process of the original seeker optimization algorithm (SOA) approach by hybridizing it with FA which overcame shortcomings and outperformed other algorithms. Strumberger et al. [13] also has proposed dynamic search tree growth algorithm (TGA) and hybridized elephant herding optimization (EHO) with ABC, and the simulation results have shown that the proposed approach was viable and effective. Yang [14] analyzed swarm intelligence algorithms by using differential evolution, dynamic systems, self-organization, and Markov chain framework. The discussions demonstrate that the hybrid algorithms have some advantages over traditional algorithms. Bacanin and Tuba [15] proposed a modified ABC based on GA, and the obtained results show that the hybrid ABC is able to provide competitive results and outperform other counterparts. Liu et al. [16] presented a multistrategy brain storm optimization (BSO) with dynamic parameter adjustment which is more competitive than other related algorithms. Peng et al. [17] has proposed FA with luciferase inhibition mechanism to improve the effectiveness of selection. The simulation results have shown that the proposed approach has the best performance in some complex functions. Peng et al. [18] also developed a hybrid approach, which is using the best neighbor-guided solution search strategy to search ABC algorithm. The experimental results indicate that the proposed ABC is very competitive and outperforms the other algorithms. It can be seen that the hybrid strategy is a strategy to successfully improve the swarm intelligence algorithm, so the BSA algorithm will be improved by hybrid strategy in this paper.

Similarly, BSA can also be applied to multiple fields, especially in the field of parameter estimation, and hybrid strategy is also the improvement method for BSA. In 2017, Xu et al. [19] proposed improved boundary BSA (IBBSA) for chaotic system optimization of the Lorenz system and the coupling motor system. However, the improved boundary learning strategy has randomness, which makes IBBSA generalization performance not high. Yang and Liu [20] introduced the dynamic weight into the foraging formula of BSA (IBSA) which provides a solution for problem that anti-same-frequency interference of shipborne radar. The results have shown that the dynamic weight is just introduced into the foraging formula of BSA, but IBSA ignored the impact of population initialization. Wang et al. [21] designed a strategy named “disturbing the local optimum” for helping the original BSA converge to the global optimal solution faster and more stably. However, “disturbing the local optimum” also has randomness, which makes the generalization performance of improved BSA not very well.

Like many swarm intelligence algorithms, BSA is also faced with the problem of being trapped in local optima and slow convergence. These disadvantages limit the wider application of BSA. In this paper, a dynamic multi-swarm differential learning quantum BSA called DMSDL-QBSA is proposed, which introduced three hybrid strategies into the original BSA to improve its effectiveness. Motivated by the defect of insufficient generalization ability in the literature [19, 21], we will first establish a dynamic multi-swarm bird swarm algorithm (DMS-BSA) and merge the differential evolution operator into each sub-swarm of the DMS-BSA, and it improves the local search capability and global search capability of foraging behavior. Second, according to the contempt for the impact of population initialization in the literature [20], they used quantum behavior to optimize the particle swarm optimization in order to obtain a good ability to jump out of global optimum; we will use the quantum system to initialize the search space of the bird. Consequently, it improves the convergence rate of the whole population and avoids BSA into a local optimum. In order to validate effectiveness of the proposed method, we have evaluated the performance of DMSDL-QBSA on classical benchmark functions and CEC2014 functions including unimodal and multimodal functions in comparison with the state-of-the-art methods and new popular algorithms. The experimental results have shown that the three improvement strategies are able to significantly boost the performance of BSA.

Based on the DMSDL-QBSA, an effective hybrid random forest (RF) model for actual oil logging prediction is established, called DMSDL-QBSA-RF approach. RF has the characteristics of being nonlinear and anti-interference [22]. In addition, it can decrease the possibility of overfitting which often occurs in actual logging. RF has been widely used in various classification problems, but it has not yet been applied to the field of actual logging. Parameter estimation is a prerequisite to accomplish the RF classification model. The two key parameters of RF are the number of decision trees and the number of predictor variables; the former is called , and the latter is called . Meanwhile, parameter estimation of the model is a complex optimization problem that traditional methods might fail to solve. Many works have proposed to use swarm intelligence algorithms to find the best parameters of the RF model. Ma and Fan [23] adopted AFSA and PSO to optimize the parameters of the RF. Hou et al. [24] used the DE to obtain an optimal set of initial parameters for RF. Liu et al. [25] compared genetic algorithms, simulated annealing, and hill climbing algorithms to optimize the parameters of the RF. From these papers, we can see that metaheuristic algorithm must be suitable for this problem. In this study, the DMSDL-QBSA was used to optimize the two key parameters that can improve the accuracy without overfitting for RF. When investigating the performance of the DMSDL-QBSA-RF classification model compared with 3 swarm intelligence algorithm-based RF methods, 8 two-dimensional UCI datasets are applied. As the experimental results show, the proposed learning scheme can guarantee a more stable RF classification model with higher predictive accuracy compared to other counterparts. The rest of the paper is organized as follows:(i)In order to achieve a better balance between efficiency and velocity for BSA, we have studied the effects of four different hybrid strategies of the dynamic multi-swarm method, differential evolution, and quantum behavior on the performance of BSA.(ii)The proposed DMSDL-QBSA has successfully optimized and setting problem of RF. The resulting hybrid classification model has been rigorously evaluated on oil logging prediction.(iii)The proposed hybrid classification model delivers better classification performance and offers more accurate and faster results when compared to other swarm intelligence algorithm-based RF models.

2. Bird Swarm Algorithm and Its Improvement

2.1. Bird Swarm Algorithm Principle

BSA, as proposed by Meng et al. in 2015, is a new intelligent bionic algorithm based on multigroup and multisearch methods; it mimics the birds’ foraging behavior, vigilance behavior, and flight behavior, and employs this swarm intelligence to solve the optimization problem. The bird swarm algorithm can be simplified by the five rules: Rule 1: each bird can switch between vigilant behavior and foraging behavior, and both bird forages and keeps vigilance is mimicked as random decisions. Rule 2: when foraging, each bird records and updates its previous best experience and the swarms’ previous best experience with food patches. The experience can also be used to search for food. Instant sharing of social information is across the group. Rule 3: when keeping vigilance, each bird tries to move towards the center of the swarm. This behavior may be influenced by disturbances caused by swarm competition. Birds with more stocks are more likely to be near swarm’s centers than birds with lease stocks. Rule 4: birds fly to another place regularly. When flying to another location, birds often switch between production and shrubs. The bird with the most stocks is the producer, and the bird with the least is a scrounger. Other birds with the highest and lowest reserves are randomly selected for producers and scroungers. Rule 5: producers actively seek food. Scroungers randomly follow producers looking for food.

According to Rule 1, we define that the time interval of each bird flight behavior , the probability of foraging behavior , and a uniform random number .(1)Foraging behavior If the number of iteration is less than and , the bird will be the foraging behavior. Rule 2 can be written mathematically as follows: where and are two positive numbers; the former is called cognitive accelerated coefficients, and the latter is called social accelerated coefficients. Here, is the -th bird’s best previous position and is the best previous swarm’s position.(2)Vigilance behavior If the number of iteration is less than and , the bird will be the vigilance behavior. Rule 3 can be written mathematically as follows: where and are two positive constants in , is the best fitness value of -th bird, and is the sum of the swarms’ best fitness value. Here, , which is used to avoid zero-division error, is the smallest constant in the computer. denotes the -th element of the whole swarm’s average position.(3)Flight behavior If the number of iteration equals , the bird will be the flight behavior which can be divided into the behaviors of the producers and scroungers by fitness. Rule 3 and Rule 4 can be written mathematically as follows:where () means that the scrounger would follow the producer to search for food.

2.2. The Bird Swarm Algorithm Based on Dynamic Multi-Swarm Method, Differential Evolution, and Quantum Behavior

2.2.1. The Foraging Behavior Based on Dynamic Multi-Swarm Method

Dynamic multi-swarm method has been widely used in real-world applications, because it is efficient and easy to implement. In addition, it is very common in the improvement of swarm intelligent optimization, such as coevolutionary algorithm [26], the framework of evolutionary algorithms [27], multiobjective particle swarm optimization [28], hybrid dynamic robust [29], and PSO algorithm [30, 31]. However, the PSO algorithm is easy to fall into the local optimum and its generalization performance is not high. Consequently, motivated by these literature studies, we will establish a dynamic multi-swarm bird swarm algorithm (DMS-BSA), and it improves the local search capability of foraging behavior.

In DMS-PSO, the whole population is divided into many small swarms, which are often regrouped by using various reorganization plans to exchange information. The velocity update strategy iswhere is the best historical position achieved within the local community of the -th particle.

According to the characteristic of equation (1), we can see that the foraging behavior formula of BSA is similar to the particle velocity update formula of PSO. So, according to the characteristic of equation (7), we can get the improved foraging behavior formula as follows:where is called the guiding vector.

The dynamic multi-swarm method is used to improve the local search capability, while the guiding vector can enhance the global search capability of foraging behavior. Obviously, we need to build a good guiding vector.

2.2.2. The Guiding Vector Based on Differential Evolution

Differential evolution (DE) is a powerful evolutionary algorithm with three differential evolution operators for solving the tough global optimization problems [32]. Besides, DE has got more and more attention of scholars to evolve and improve in evolutionary computation, such as hybrid multiple crossover operations [33] and proposed DE/neighbor/1 [34], due to its excellent global search capability. From these literature studies, we can see that DE has a good global search capability, so we will establish the guiding vector based on differential evolution operator to improve the global search capability of foraging behavior. The detailed implementation of is presented as follows:(1)Differential mutation According to the characteristic of equation (8), the “DE/best/1”, “DE/best/2,” and “DE/current-to-best/1” mutation strategies are suitable. In the experiments of the literature [31], they showed that the “DE/best/1” mutation strategy is the most suitable in DMS-PSO, so we choose this mutation strategy in BSA. And the “DE/lbest/1” mutation strategy can be written as follows: DE/lbest/1： Note that some components of the mutant vector may violate predefined boundary constraints. In this case, the boundary processing is used. It can be expressed as follows:(2)Crossover After differential mutation, a binomial crossover operation exchanges some components of the mutant vector with the best previous position to generate the target vector . The process can be expressed as(3)Selection Because the purpose of BSA is to find the best fitness, a selection operation chooses a vector accompanied a better fitness to enter the next generation to generate the selection operator, namely, guiding vector . The process can be expressed as follows: Choose a vector with better fitness to enter the next generation

2.2.3. The Initialization of Search Space Based on Quantum Behavior

Quantum behavior is a nonlinear and excellent superposition system. With its simple and effective characteristics and good performance in global optimization, it has been applied to optimize many algorithms, such as particle swarm optimization [35] and pigeon-inspired optimization algorithm [36]. Consequently, according to the literature studies and its excellent global optimization performance, we use the quantum system to initialize the search space of the bird.

Quantum-behaved particle position can be written mathematically as follows:

According to the characteristics of equations (13)–(15), we can get the improved search space initialization formula as follows:where is a positive number, which can be, respectively, called as a contraction expansion factor. Here, is the position of the particle at the previous moment and is the average value of the best previous positions of all the birds (Algorithm 1).

2.2.4. Procedures of the DMSDL-QBSA

Variable setting: number of iterations:, bird positions: , local optimum: , global optimal position:, global optimum:,and fitness of sub-swarm optimal position: ;
Input: population size: , dimension’s size: , number of function evaluations:, the time interval of each bird flight behavior: , the probability of foraging behavior: , constant parameter: , , , , , , and contraction expansion factor: ;
Output: global optimal position: , fitness of global optimal position: ;
(1)	Begin
(2)	Initialize the positions of N birds using equations (16)-(17): ;
(3)	Calculated fitness: ; set to be and find ;
(4)	Whiledo
(5)	/∗ Dynamic sub-swarm∗/
(6)	Regroup and of the sub-swarms randomly;
(7)	Sort the and refine the first best ;
(8)	update the corresponding ;
(9)	/∗Differential learning scheme∗/
(10)	For
(11)	Construct using DMS-BSA
(12)	Differential evolution: construct using equations (9)-(10);
(13)	Crossover: construct using equation (11);
(14)	Selection: construct using equation (12);
(15)	End For
(16)	/∗Birds position adjusting∗/
(17)	If
(18)	For
(19)	If
(20)	Foraging behavior: update the position of birds using equation (8);
(21)	Else
(22)	Vigilance behavior: update the position of birds using equation (2);
(23)	End If
(24)	End For
(25)	Else
(26)	Flight behavior is divided into producers and scroungers;
(27)	For
(28)	If is a producer
(29)	Producers: update the position of birds using equation (5);
(30)	Else
(31)	Scroungers: update the position of birds using equation (6);
(32)	End If
(33)	End For
(34)	End If
(35)	Evaluate ;
(36)	Update and ;
(37)	;
(38)	End While
(39)	End

In Sections 2.2.1–2.2.3, in order to improve the local search capability and the global search capability on BSA, this paper has improved the BSA in three parts:(1)In order to improve the local search capability of foraging behavior on BSA, we put forward equation (8) based on the dynamic multi-swarm method.(2)In order to get the guiding vector to improve the global search capability of foraging behavior on BSA, we put forward equations (9), (11), and (12) based on differential evolution.(3)In order to expand the initialization search space of the bird to improve the global search capability on BSA, we put forward equations (16) and (17) based on quantum behavior.

Finally, the steps of DMSDL-QBSA can be shown in Algorithm 1.

2.3. Simulation Experiment and Analysis

This section presents the evaluation of DMSDL-QBSA using a series of experiments on benchmark functions and CEC2014 test functions. All experiments in this paper are implemented using the following: MATLAB R2014b; Win 7 (64-bit); Inter (R) Core (TM) i5-2450M; CPU @2.50 GHz; 4.00 GB RAM. To obtain fair results, all the experiments were conducted under the same conditions. The number of the population size is set as 30 in these algorithms. And each algorithm runs 30 times independently for each function.

2.3.1. Benchmark Functions and CEC 2014 Test Functions

When investigating the effective and universal performance of DMSDL-QBSA compared with several hybrid algorithms and popular algorithms, 18 benchmark functions and CEC2014 test functions are applied. In order to test the effectiveness of the proposed DMSDL-QBSA, 18 benchmark functions [37] are adopted, and all of which have an optimal value of 0. The benchmark functions and their searching ranges are shown in Table 1. In this test suite, are unimodal functions. These unimodal functions are usually used to test and investigate whether the proposed algorithm has a good convergence performance. Then, are multimodal functions. These multimodal functions are used to test the global search capability of the proposed algorithm. The smaller the fitness value of functions, the better the algorithm performs. Furthermore, in order to better verify the comprehensive performance of DMSDL-QBSA in a more comprehensively manner, another 30 complex CEC2014 benchmarks are used. The CEC2014 benchmark functions are simply described in Table 2.

2.3.2. Parameter Settings

In order to verify the effectiveness and generalization of the proposed DMSDL-QBSA, the improved DMSDL-QBSA is compared with several hybrid algorithms. These algorithms are BSA [7], DE [32], DMSDL-PSO [31], and DMSDL-BSA. Another 5 popular intelligence algorithms, such as grey wolf optimizer (GWO) [38], whale optimization algorithm (WOA) [39], sine cosine algorithm (SCA) [40], grasshopper optimization algorithm (GOA) [41], and sparrow search algorithm (SSA) [42], are used to compare with DMSDL-QBSA. These algorithms represented state-of-the-art can be used to better verify the performance of DMSDL-QBSA in a more comprehensively manner. For fair comparison, the number of populations of all algorithms is set to 30, respectively, and other parameters of all algorithms are set according to their original papers. The parameter settings of these involved algorithms are shown in Table 3 in detail.

2.3.3. Comparison on Benchmark Functions with Hybrid Algorithms

According to Section 2.2, three hybrid strategies (dynamic multi-swarm method, DE, and quantum behavior) have been combined with the basic BSA method. When investigating the effectiveness of DMSDL-QBSA compared with several hybrid algorithms, such as BSA, DE, DMSDL-PSO, and DMSDL-BSA, 18 benchmark functions are applied. Compared with DMSDL-QBSA, quantum behavior dynamic is not used in the dynamic multi-swarm differential learning bird swarm algorithm (DMSDL-BSA). The number of function evaluations (FEs) is 10000. We selected two different dimension’s sizes (Dim). Dim = 10 is the typical dimensions for the benchmark functions. And Dim = 2 is for RF has two parameters that need to be optimized, which means that the optimization function is 2-dimensional.

The fitness value curves of a run of several algorithms on about eight different functions are shown in Figures 1 and 2, where the horizontal axis represents the number of iterations and the vertical axis represents the fitness value. We can obviously see the convergence speeds of several different algorithms. The maximum value (Max), the minimum value (Min), the mean value (Mean), and the variance (Var) obtained by several benchmark algorithms are shown in Tables 4–7, where the best results are marked in bold. Table 4 and 5 show the performance of the several algorithms on unimodal functions when Dim = 10 and 2, and Table 6 and 7 show the performance of the several algorithms on multimodal functions when Dim = 10 and 2.

(a)

(b)

(c)

(d)

(a)

(b)

(c)

(d)

(1) Unimodal functions From the numerical testing results on 8 unimodal functions in Table 4, we can see that DMSDL-QBSA can find the optimal solution for all unimodal functions and get the minimum value of 0 on , , , , and . Both DMSDL-QBSA and DMSDL-BSA can find the minimum value. However, DMSDL-QBSA has the best mean value and variance on each function. The main reason is that DMSDL-QBSA has better population diversity during the initialization period. In summary, the DMSDL-QBSA has best performance on unimodal functions compared to the other algorithms when Dim = 10. Obviously, the DMSDL-QBSA has a relatively well convergence speed. The evolution curves of these algorithms on four unimodal functions , , , and are drawn in Figure 1. It can be detected from the figure that the curve of DMSDL-QBSA descends fastest in the number of iterations that are far less than 10000 times. For , , and case, DMSDL-QBSA has the fastest convergence speed compared with other algorithms. However, the original BSA got the worst solution because it is trapped in the local optimum prematurely. For function , these algorithms did not find the value 0. However, the convergence speed of the DMSDL-QBSA is significantly faster than other algorithms in the early stage and the solution eventually found is the best. Overall, owing to enhance the diversity of population, DMSDL-QBSA has a relatively excellent convergence speed when Dim = 2. According to the results of Table 5, DMSDL-QBSA gets the best performance on these 8 unimodal functions when Dim = 2. DMSDL-QBSA finds the minimum value of 0 on , , , , , , , and . DMSDL-QBSA has better performance on , , and compared with DMSDL-BSA and DMSDL-PSO. DE does not perform well on these functions, but BSA performs relatively well on , , , , , and . The main reason is that BSA has a better convergence performance in the early search. Obviously, DMSDL-QBSA can find the best two parameters for RF that need to be optimized.(2)Multimodal functions From the numerical testing results on 8 multimodal functions in Table 6, we can see that DMSDL-QBSA can find the optimal solution for all multimodal functions and get the minimum value of 0 on , , and . DMSDL-QBSA has the best performance on , , , , , and . BSA works the best on . DMSDL-PSO performs not very well. And DMSDL-QBSA has the best mean value and variance on most functions. The main reason is that DMSDL-QBSA has a stronger global exploration capability based on the dynamic multi-swarm method and differential evolution. In summary, the DMSDL-QBSA has relatively well performance on unimodal functions compared to the other algorithms when typical Dim = 10. Obviously, the DMSDL-QBSA has relatively well global search capability.

The evolution curves of these algorithms on four multimodal functions , , , and when Dim = 2 are depicted in Figure 2. We can see that DMSDL-QBSA can find the optimal solution in the same iteration. For and case, DMSDL-QBSA continues to decline. However, the original BSA and DE get parallel straight lines because of their poor global convergence ability. For functions and , although DMSDL-QBSA also trapped the local optimum, it find the minimum value compared to other algorithms. Obviously, the convergence speed of the DMSDL-QBSA is significantly faster than other algorithms in the early stage, and the solution eventually found is the best. In general, owing to enhance the diversity of population, DMSDL-QBSA has a relatively balanced global search capability when Dim = 2.

Furthermore, from the numerical testing results on nine multimodal functions in Table 7, we can see that DMSDL-QBSA has the best performance on , , , , , , and . DMSDL-QBSA gets the minimum value of 0 on , , , and . BSA has got the minimum value of 0 on , , and . DE also has not got the minimum value of 0 on any functions. DMSDL-BSA has got the minimum value of 0 on and . In summary, the DMSDL-QBSA has a superior global search capability on most multimodal functions when Dim = 2. Obviously, DMSDL-QBSA can find the best two parameters for RF that need to be optimized, because of its best global search capability.

In this section, it can be seen from Figures 1 and 2 and Tables 4–7 that DMSDL-QBSA can obtain the best function values for most cases. It indicates that the hybrid strategies of BSA, dynamic multi-swarm method, DE, and quantum behavior operators, lead to the bird moves towards the best solutions. And DMSDL-QBSA has well ability of searching for the best two parameters for RF with higher accuracy and efficiency.

2.3.4. Comparison on Benchmark Functions with Popular Algorithms

When comparing the timeliness and applicability of DMSDL-QBSA compared with several popular algorithms, such as GWO, WOA, SCA, GOA, and SSA, 18 benchmark functions are applied. And GWO, WOA, GOA and SSA are swarm intelligence algorithms. In this experiment, the dimension’s size of these functions is10. The number of function evaluations (FEs) is100000. The maximum value (Max), the minimum value (Min), the mean value (Mean), and the variance (Var) obtained by several different algorithms are shown in Tables 8 and 9, where the best results are marked in bold.

From the test results in Table 8, we can see that DMSDL-QBSA has the best performance on each unimodal function. GWO finds the value 0 on , , , , and . WOA obtains 0 on , , and . SSA works the best on and . With the experiment of multimodal function evaluations, Table 9 shows that DMSDL-QBSA has the best performance on , , , , , , and . SSA has the best performance on . GWO gets the minimum on . WOA and SCA obtains the optimal value on and . Obviously, compared with these popular algorithms, DMSDL-QBSA is a competitive algorithm for solving several functions and the swarm intelligence algorithms perform better than other algorithms. The results of Tables 8 and 9 show that DMSDL-QBSA has the best performance on the most test benchmark functions.

2.3.5. Comparison on CEC2014 Test Functions with Hybrid Algorithms

When comparing the comprehensive performance of proposed DMSDL-QBSA compared with several hybrid algorithms, such as BSA, DE, DMSDL-PSO, and DMSDL-BSA, 30 CEC2014 test functions are applied. In this experiment, the dimension’s size (Dim) is set to 10. The number of function evaluations (FEs) is 100000. Experimental comparisons included the maximum value (Max), the minimum value (Min), the mean value (Mean), and the variance (Var) are given in Tables 10 and 11, where the best results are marked in bold.

Based on the mean value (Mean), on the CEC2014 test functions, DMSDL-QBSA has the best performance on F₂, F₃, F₄, F₆, F₇, F₈, F₉, F₁₀, F₁₁, F₁₅, F₁₆, F₁₇, F₂₁, F₂₆, F₂₇, F₂₉, and F₃₀. DMSDL-BSA does show an advantage on F₁, F₁₂, F₁₃, F₁₄, F₁₈, F₁₉, F₂₀, F₂₄, F₂₅, and F₂₈. According to the results, we can observe that DMSDL-QBSA can find the minimal value on 17 CEC2014 test functions. DMSDL-BSA gets the minimum value on F₁, F₁₂, F₁₃, F₁₄, F₁₈, F₁₉, F₂₄, and F₃₀, and DMSDL-PSO obtains the minimum value on F₄, F₇, and F₂₃. Owing to enhance the capability of exploitation, DMSDL-QBSA is better than DMSDL-BSA and DMSDL-PSO on most functions. From the results of tests, it can be seen that DMSDL-QBSA performs better than BSA, DE, DMSDL-PSO, and DMSDL-BSA. It can be observed that DMSDL-QBSA obtains optimal value. It can be concluded that DMSDL-QBSA has better global search ability and better robustness on these test suites.

3. Optimize RF Classification Model Based on Improved BSA Algorithm

3.1. RF Classification Model

RF, as proposed by Breiman et al., is an ensemble learning model based on bagging and random subspace methods. The whole modeling process includes building decision trees and decision processes. The process of constructing decision trees is mainly composed of decision trees, and each of which consists of nonleaf nodes and leaf nodes. The leaf node is a child node of the node branch. It is supposed that the dataset has M attributes. When each leaf node of the decision tree needs to be segmented, the attributes are randomly selected from the M attributes as the reselected splitting variables of this node. This process can be defined as follows:where is the splitting variable of the -th leaf node of the decision tree, and is the probability that reselected attributes are selected as the splitting attribute of the node.

The nonleaf node is a parent node that classifies training data as a left or right child node. The function of -th decision tree is as follows:where , where the symbol 0 indicates that the -th row of data is classified as a negative label and the symbol 1 indicates that the -th row of data is classified as a positive label. Here, is the training function of the -th decision tree based on the splitting variable . is the -th row of data in the dataset by random sampling with replacement. The symbol is a positive constant, which is used as the threshold value of the training decision.

When decision processes are trained, each row of data will be input into a leaf node of each decision tree. The average of decision tree classification results is used as the final classification result. This process can be written mathematically as follows:where is the number of decision trees which judged -th row of data as .

From the above principle, we can see that it is mainly necessary to determine two parameters of and in the RF modeling process. In order to verify the influence of these two parameters on the classification accuracy of the RF classification model, the Ionosphere dataset is used to test the influence of the two parameters on the performance of the RF model, as shown in Figure 3, where the horizontal axis represents and , respectively, and the vertical axis represents the accuracy of the RF classification model.(1)Parameter analysis of When the number of predictor variables is set to 6, the number of decision trees is cyclically set from 0 to 1000 at intervals of 20. And the evolutionary progress of RF classification model accuracy with the change of is shown in Figure 3(a). From the curve in Figure 3(a), we can see that the accuracy of RF is gradually improved with the increase of the number N of decision trees. However, when the number of decision trees is greater than a certain value, the improvement of RF performance has become gentle without obvious improvement, but the running time becomes longer.(2)Parameter analysis of When the number of decision trees is set to 500, the number of predictor variables is cyclically set from 1 to 32. The limit of is set to 32, because the number of attributes of the Ionosphere dataset is 32. And the obtained curve of RF classification model accuracy with transformation is shown in Figure 3(b). And we can see that with the increase of the splitting property of the selection, the classification performance of RF is gradually improved, but when the number of predictor variables is greater than 9, the RF generates overfitting and the accuracy of RF begins to decrease. The main reason is that too many split attributes are selected, which resulted in the same splitting attributes which are owned by a large number of decision trees. This reduced the diversity of decision trees.

(a)

(b)

In summary, for the RF classification model to obtain the ideal optimal solution, the selection of the number of decision trees and the number of predictor variables are very important. And the classification accuracy of the RF classification model can only be optimized by the comprehensive optimization of these two parameters. So, it is necessary to use the proposed algorithm to find a suitable set of RF parameters. Next, we will optimize the RF classification model by the improved BSA proposed in Section 2.

3.2. RF Model Based on an Improved Bird Swarm Algorithm

Improved bird swarm algorithm optimized RF classification model (DMSDL-QBSA-RF) is based on the improved bird swarm algorithm optimized the RF classification model and introduced the training dataset into the training process of the RF classification model, finally getting the DMSDL-QBSA-RF classification model. The main idea is to construct a two-dimensional fitness function containing RF’s two parameters and as the optimization target of DMSDL-QBSA, so as to obtain a set of grouping parameters and make the RF classification model obtain the best classification accuracy. The specific algorithm steps are shown as in Algorithm 2.

Variable setting: number of iterations: , bird positions: , local optimum: , global optimal position: , global optimum:, and out of bag error: OOB error;
Input: training dataset: , , test dataset: , the parameters of DMSDL-QBSA;
Output: the label of test dataset: , the final classification model: DMSDL-QBSA-RF;
(1)	Begin
(2)	/∗Build classification model based on DMSDL-QBSA-RF∗/
(3)	Initialize the positions of N birds using equations (16) and (17): ;
(4)	Calculated fitness: ; set to be and find ;
(5)	Whiledo
(6)	For
(7)	Give each tree a training set of size by random sampling with replacement based on Bootstrap;
(8)	Select attributes randomly at each leaf node, compare the attributes, and select the best one;
(9)	Recursively generate each decision tree without pruning operations;
(10)	End For
(11)	Update classification accuracy of RF: Evaluate ;
(12)	Update and ;
(13)	;
(14)	;
(15)	End While
(16)	/∗Classify using RF model∗/
(17)	For
(18)	Give each tree a training set of size by random sampling with replacement based on Bootstrap;
(19)	Select attributes randomly at each leaf node, compare the attributes, and select the best one;
(20)	Recursively generate each decision tree without pruning operations;
(21)	End
(22)	Return DMSDL-QBSA-RF classification model
(23)	Classify the test dataset using equation (20);
(24)	Calculate OOB error;
(25)	End

3.3. Simulation Experiment and Analysis

In order to test the performance of the improved DMSDL-QBSA-RF classification model, we compare the improved classification model with the standard RF model, BSA-RF model, and DMSDL-BSA-RF model on 8 two-dimensional UCI datasets. The DMSDL-BSA-RF classification model is an RF classification model optimized by BSA without quantum behavior. In our experiment, each of datasets is divided into two parts: 70% of the dataset is as training set and the remaining 30% is as a test set. The average classification accuracies of 10 independent runs of each model are recorded in Table 12, where the best results are marked in bold.

From the accuracy results in Table 12, we can see that the DMSDL-QBSA-RF classification model can get best accuracy on each UCI dataset except magic dataset. And the DMSDL-BSA-RF classification model has got best accuracy on magic dataset. Then, compared with the standard RF model, the accuracy of the DMSDL-QBSA-RF classification model can get better accuracy which is increased by about 10%. Finally, the DMSDL-QBSA-RF classification model has got the best accuracy on appendicitis dataset which is up to 93.55%. In summary, the DMSDL-QBSA-RF classification model has validity on most datasets and a good performance on them.

4. Oil Layer Classification Application

4.1. Design of Oil Layer Classification System

The block diagram of the oil layer classification system based on the improved DMSDL-QBSA-RF is shown in Figure 4. The oil layer classification can be simplified by the following five steps: Step 1. The selection of the actual logging datasets is intact and full-scale. At the same time, the datasets should be closely related to rock sample analysis. The dataset should be relatively independent. The dataset is randomly divided into two parts of training and testing samples. Step 2. In order to better understand the relationship between independent variables and dependent variables and reduce the sample information attribute, the dataset continuous attribute should be discretized by using a greedy algorithm. Step 3. In order to improve the calculation speed and classification accuracy, we use the covering rough set method [43] to realize the attribute reduction. After attribute reduction, normalization of the actual logging datasets is carried out to avoid computational saturation. Step 4. In the DMSDL-QBSA-RF layer classification model, we input the actual logging dataset after attribute reduction, use a DMSDL-QBSA-RF layer classification algorithm to train, and finally get the DMSDL-QBSA-RF layer classification model. Step 5. The whole oil section is identified by the trained DMSDL-QBSA-RF layer classification model, and we output the classification results.

In order to verify the application effect of the DMSDL-QBSA-RF layer classification model, we select three actual logging datasets of oil and gas wells to train and test.

4.2. Practical Application

In Section 2.3, the performance of the proposed DMSDL-QBSA is simulated and analyzed on benchmark functions. And in Section 3.3, the effectiveness of the improved RF classification model optimized by the proposed DMSDL-QBSA is tested and verified on two-dimensional UCI datasets. In order to test the application effect of the improved DMSDL-QBSA-RF layer classification model, three actual logging datasets are adopted and recorded as mathematical problems in engineering W1, W2, and W3. The W1 is a gas well in Xian (China), the W2 is a gas well in Shanxi (China), and the W3 is an oil well in Xinjiang (China). The depth and the corresponding rock sample analysis samples of the three wells selected in the experiment are as shown in Table 13.

Attribute reduction on the actual logging datasets is performed before the training of the DMSDL-QBSA-RF classification model on the training dataset, as shown in Table 14. Then, these attributes are normalized as shown in Figure 5, where the horizontal axis represents the depth and the vertical axis represents the normalized value.

(a)

(b)

(c)

(d)

(e)

(f)

The logging dataset after attribute reduction and normalization is used to train the oil and gas layer classification model. In order to measure the performance of the DMSDL-QBSA-RF classification model, we compare the improved classification model with several popular oil and gas layer classification models. These classification models are the standard RF model, SVM model, BSA-RF model, and DMSDL-BSA-RF model. Here, the RF classification model was first applied to the field of logging. In order to evaluate the performance of the recognition model, we select the following performance indicators:where and are the classification output value and the expected output value, respectively.

RMSE is used to evaluate the accuracy of each classification model. MAE is used to show actual forecasting errors. Table 15 records the performance indicator data of each classification model, and the best results are marked in bold. The smaller the RMSE and MAE, the better the classification model performs.

From the performance indicator data of each classification model in Table 15, we can see that the DMSDL-QBSA-RF classification model can get the best recognition accuracy and all the accuracies are up to 90%. The recognition accuracy of the proposed classification model for W3 is up to 99.73%, and it has superior performance for oil and gas layer classification in other performance indicators and different wells. Secondly, DMSDL-QBSA can improve the performance of RF, and the parameters found by DMSDL-QBSA used in the RF classification model can improve the classification accuracy and keep running speed relatively fast at the same time. For example, the running times of DMSDL-QBSA-RF classification model for W1 and W2 are, respectively, 0.0504 seconds and 1.9292 seconds faster than the original RF classification model. Based on above results of data, the proposed classification model is better than the traditional RF and SVM model in oil layer classification. The comparison of oil layer classification result is shown in Figure 6, where, (a), (c), and (e) represent the actual oil layer distribution and (b), (d), and (f) represent DMSDL-QBSA-RF oil layer distribution. In addition, 0 means this depth has no oil or gas and 1 means this depth has oil or gas.

(a)

(b)

(c)

(d)

(e)

(f)

From Figure 6, we can see that the DMSDL-QBSA-RF classification model identifies that the oil layer distribution results are not much different from the test oil test results. It can accurately identify the distribution of oil and gas in a well. The DMSDL-QBSA-RF model is suitable for petroleum logging applications, which greatly reduces the difficulty of oil exploration and has a good application foreground.

5. Conclusion

This paper presents an improved BSA called DMSDL-QBSA, which employed the dynamic multi-swarm method, differential evolution, and quantum behavior to enhance the global and the local exploration capabilities of original BSA. First, 18 classical benchmark functions are used to verify the effectiveness of the improved method. The experimental study of the effects of these three strategies on the performance of DMSDL-QBSA revealed that the hybrid method has an excellent influence to improve the improvement of original GOA and especially original DE. Second, compared with the popular intelligence algorithms, such as GWO, WOA, SCA, GOA, and SSA, the DMSDL-QBSA can provide more competitive results on the 18 classical benchmark functions. Additionally, 30 complex CEC2014 test functions are used to better verify the performance of DMSDL-QBSA in a more comprehensively manner. The DMSDL-QBSA can show more excellent performance on the 18 classical benchmark functions. Finally, the improved DMSDL-QBSA is used to optimize the parameters of RF. Experimental results on actual oil logging prediction problem have proved that the classification accuracy of the established DMSDL-QBSA-RF classification model can get 94.00%, 94.24%, and 99.73% on these wells, and the accuracy is much higher than the original RF model. At the same time, the running speed performed faster than other four advanced classification models on most wells.

Although the proposed DMSDL-QBSA has been proven to be effective in solving general optimization problems, DMSDL-QBSA has some shortcomings that warrant further investigation. And in DMSDL-QBSA, due to the hybrid of three strategies, DMSDL-QBSA has needed more time than the classical BSA. Therefore, deploying the proposed algorithm to increase recognition efficiency is a worthwhile direction. In the future research work, the method presented in this paper can also be extended to solving discrete optimization problems and multiobjective optimization problems. Furthermore, applying the proposed DMSDL-QBSA-RF model to other fields such as financial prediction and biomedical science diagnosis is also an interesting future work.

Data Availability

All data included in this study are available upon request by contact with the corresponding author.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

This work was supported by the National Natural Science Foundation of China (no. U1813222), Tianjin Natural Science Foundation, China (no. 18JCYBJC16500), Key Research and Development Project from Hebei Province, China (nos. 19210404D and 20351802D), Key Research Project of Science and Technology from the Ministry of Education of Hebei Province, China (no. ZD2019010), and Project of Industry-University Cooperative Education of Ministry of Education of China (no. 201801335014).

References

A. P. Engelbrecht, Foundations of Computational Swarm Intelligence, Beijing: Tsinghua University Press, Beijing, China, 2019.
J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of the IEEE International Conference Neural Networks, Perth, Australia, July 1995.
View at: Publisher Site | Google Scholar
D. Karaboga, “An idea based on honey bee swarm for numerical optimization,” Tech. Rep., Erciyes University, Kayseri, Turkey, 2005, Technical report-TR06.
View at: Google Scholar
X. Li, A new intelligent optimization method-artificial fish school algorithm, Doctoral thesis, Zhejiang University, Hangzhou, China, 2003.
X. S. Yang, “Firefly algorithms for multimodal optimization stochastic algorithms: foundations and applications,” in Proceedings of the 5th International Symposium on Stochastic Algorithms, SAGA, Berlin, Germany, 2009.
View at: Google Scholar
Y. Sharafi, M. A. Khanesar, and M. Teshnehlab, “Discrete binary cat swarm optimization,” in Proceedings of the IEEE International Conference on Computer, Control and Communication (IC4), Karachi, Pakistan, September 2013.
View at: Google Scholar
X. B. Meng, X. Z. Gao, L. Lu, Y. Liu, and H. Z. Zhang, “A new bio-inspired optimisation algorithm: bird swarm algorithm,” Journal of Experimental & Theoretical Artificial Intelligence, vol. 28, no. 4, pp. 673–687, 2016.
View at: Google Scholar
N. Jatana and B. Suri, “Particle swarm and genetic algorithm applied to mutation testing for test data generation: a comparative evaluation,” Journal of King Saud University-Computer and Information Sciences, vol. 32, pp. 514–521, 2020.
View at: Publisher Site | Google Scholar
H. Chung and K. Shin, “Genetic algorithm-optimized multi-channel convolutional neural network for stock market prediction,” in Neural Computing and Applications, Springer, New York, NY, USA, 2019.
View at: Google Scholar
I. Strumberger, E. Tuba, M. Zivkovic, N. Bacanin, M. Beko, and M. Tuba, “Designing convolutional neural network architecture by the firefly algorithm,” in Proceedings of the 2019 IEEE International Young Engineers Forum (YEF-ECE), Costa da Caparica, Portugal, May, 2019.
View at: Publisher Site | Google Scholar
I. Strumberger, N. Bacanin, M. Tuba, and E. Tuba, “Resource scheduling in cloud computing based on a hybridized whale optimization algorithm,” Applied Sciences, vol. 9, no. 22, p. 4893, 2019.
View at: Google Scholar
M. Tuba and N. Bacanin, “Improved seeker optimization algorithm hybridized with firefly algorithm for constrained optimization problems,” Neurocomputing, vol. 143, pp. 197–207, 2014.
View at: Publisher Site | Google Scholar
I. Strumberger, M. Minovic, M. Tuba, and N. Bacanin, “Performance of elephant herding optimization and tree growth algorithm adapted for node localization in wireless sensor networks,” Sensors, vol. 19, no. 11, p. 2515, 2019.
View at: Google Scholar
X. S. Yang, “Swarm intelligence based algorithms: a critical analysis,” Evolutionary Intelligence, vol. 7, no. 1, pp. 17–28, 2014.
View at: Publisher Site | Google Scholar
N. Bacanin and M. Tuba, “Artificial bee colony (ABC) algorithm for constrained optimization improved with genetic operators,” Studies in Informatics and Control, vol. 21, no. 2, pp. 137–146, 2012.
View at: Google Scholar
J. Liu, H. Peng, Z. Wu, J. Chen, and C. Deng, Multi-Strategy Brainstorm Optimization Algorithm with Dynamic Parameters Adjustment, Applied Intelligence, Guildford, UK, 2010.
H. Peng, Y. He, and C. Deng, “Firefly algorithm with luciferase inhibition mechanism,” IEEE Access, vol. 7, pp. 120189–120201, 2019.
View at: Publisher Site | Google Scholar
H. Peng, C. Deng, and Z. Wu, “Best neighbor guided artificial bee colony algorithm for continuous optimization problems,” Soft Computing, vol. 23, no. 18, pp. 8723–8740, 2019.
View at: Google Scholar
C. Xu and R. Yang, “Parameter estimation for chaotic systems using improved bird awarm algorithm,” Modern Physics Letters B, vol. 31, no. 36, pp. 1–15, 2017.
View at: Publisher Site | Google Scholar
J. Yang and Y. Liu, “Separation of signals with same frequency based on improved bird swarm algorithm,” in Proceedings of the International Symposium on Distributed Computing and Applications for Business Engineering and Science, Wuxi, China, August 2018.
View at: Publisher Site | Google Scholar
X. Wang, Y. Deng, and H. Duan, “Edge-based target detection for unmanned aerial vehicles using competitive bird swarm algorithm,” Aerospace Science & Technology, vol. 78, pp. 708–720, 2018.
View at: Publisher Site | Google Scholar
L. Breiman, “Random forests,” Machine Learning, vol. 45, no. 1, pp. 5–32, 2001.
View at: Publisher Site | Google Scholar
L. Ma and S. Fan, “CURE-SMOTE algorithm and hybrid algorithm for feature selection and parameter optimization based on random forests,” BMC Bioinformatics, vol. 18, no. 1, pp. 1–18, 2017.
View at: Publisher Site | Google Scholar
J. Hou, Q. Li, and S. Meng, “A differential privacy protection random forest,” IEEE Access, vol. 7, pp. 130707–130720, 2019.
View at: Publisher Site | Google Scholar
G. L. Liu, S. J. Han, and X. H. Zhao, “Optimisation algorithms for spatially constrained forest planning,” Ecological Modelling, vol. 194, no. 4, pp. 421–428, 2006.
View at: Publisher Site | Google Scholar
D. Gong, B. Xu, and Y. Zhang, “A similarity-based cooperative co-evolutionary algorithm for dynamic interval multi-objective optimization problems,” in Proceedings of the IEEE Transactions on Evolutionary Computation, Piscataway, NJ, USA, February 2019.
View at: Google Scholar
M. Rong, D. Gong, and W. Pedrycz, “A multi-model prediction method for dynamic multi-objective evolutionary optimization,” IEEE Transactions on Evolutionary Computation, vol. 20, no. 24, pp. 290–304, 2020.
View at: Publisher Site | Google Scholar
B. Xu, Y. Zhang, D. Gong, Y. Guo, and M. Rong, “Environment sensitivity-based cooperative co-evolutionary algorithms for dynamic multi-objective optimization,” IEEE-ACM Transactions on Computational Biology and Bioinformatics, vol. 15, no. 6, pp. 1877–1890, 2018.
View at: Publisher Site | Google Scholar
Y. Guo, H. Yang, M. Chen, J. Cheng, and D. Gong, “Ensemble prediction-based dynamic robust multi-objective optimization methods,” Swarm and Evolutionary Computation, vol. 48, pp. 156–171, 2019.
View at: Publisher Site | Google Scholar
J. J. Liang and P. N. Suganthan, “Dynamic multi-swarm particle swarm optimizer with local search,” in Proceedings of the IEEE Congress on Evolutionary Computation, Edinburgh, Scotland, 2005.
View at: Google Scholar
Y. Chen, L. Li, and H. Peng, “Dynamic multi-swarm differential learning particle swarm optimizer,” Swarm and Evolutionary Computation, vol. 39, pp. 209–221, 2018.
View at: Google Scholar
R. Storn, “Differential evolution design of an IIR-filter,” in Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC 96), Nagoya, Japan, May 1996.
View at: Google Scholar
Z. Liu, X. Ji, and Y. Yang, “Hierarchical differential evolution algorithm combined with multi-cross operation,” Expert Systems with Applications, vol. 130, pp. 276–292, 2019.
View at: Google Scholar
H. Peng, Z. Guo, and C. Deng, “Enhancing differential evolution with random neighbors based strategy,” Journal of Computational Science, vol. 26, pp. 501–511, 2018.
View at: Publisher Site | Google Scholar
J. Sun, W. Fang, X. Wu, V. Palade, and W. Xu, “Quantum-behaved particle swarm optimization: analysis of individual particle behavior and parameter selection,” Evolutionary Computation, vol. 20, no. 3, pp. 349–393, 2012.
View at: Publisher Site | Google Scholar
B. Chen, H. Lei, H. Shen, Y. Liu, and Y. Lu, “A hybrid quantum-based PIO algorithm for global numerical optimization,” Science China–Information Sciences, vol. 62, no. 7, 2019.
View at: Publisher Site | Google Scholar
X. Yao, Y. Liu, and G. Lin, “Evolutionary programming made faster,” IEEE Transactions on Evolutionary Computation, vol. 3, no. 2, pp. 82–102, 1999.
View at: Publisher Site | Google Scholar
S. Mirjalili, S. M. Mirjalili, and A. Lewis, “Grey wolf optimizer,” Advances in Engineering Software, vol. 69, pp. 46–61, 2014.
View at: Google Scholar
S. Mirjalili and A. Lewis, “The whale optimization algorithm,” Advances in Engineering Software, vol. 95, pp. 51–67, 2016.
View at: Google Scholar
S. Mirjalili, “SCA: a sine cosine algorithm for solving optimization problems,” Knowledge Based Systems, vol. 95, pp. 120–133, 2016.
View at: Google Scholar
S. Shahrzad, M. Seyedali, and L. Andrew, “Grasshopper optimisation algorithm: theory and application,” Advances in Engineering Software, vol. 105, pp. 30–47, 2017.
View at: Google Scholar
J. Xue and B. Shen, “A novel swarm intelligence optimization approach: sparrow search algorithm,” Systems Science & Control Engineering An Open Access Journal, vol. 8, no. 1, pp. 22–34, 2020.
View at: Google Scholar
J. Bai, K. Xia, Y. Lin, and P. Wu, “Attribute reduction based on consistent covering rough set and its application,” Complexity, vol. 2017, Article ID 8986917, 9 pages, 2017.
View at: Publisher Site | Google Scholar

Copyright

Copyright © 2020 Jiangnan Zhang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

PDF Download Citation

Download other formats

Order printed copies

Views

529

Downloads

1013

Citations