Next Article in Journal
Analysis of the Influencing Factors on S-Band Sea Spikes
Next Article in Special Issue
Towards Adversarial Attacks for Clinical Document Classification
Previous Article in Journal
Design of an Adaptive Distributed Drive Control Strategy for a Wheel-Side Rear-Drive Electric Bus
Previous Article in Special Issue
Quantum Dynamic Optimization Algorithm for Neural Architecture Search on Image Classification
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

An Improved Whale Optimizer with Multiple Strategies for Intelligent Prediction of Talent Stability

1
Wenzhou Vocational College of Science and Technology, Wenzhou 325006, China
2
School of Information Engineering, Wenzhou Business College, Wenzhou 325035, China
3
College of Computer Science and Artificial Intelligence, Wenzhou University, Wenzhou 325035, China
4
Department of Artificial Intelligence, Wenzhou Polytechnic, Wenzhou 325035, China
5
College of Computer Science, Sichuan University, Chengdu 610065, China
*
Authors to whom correspondence should be addressed.
Electronics 2022, 11(24), 4224; https://doi.org/10.3390/electronics11244224
Submission received: 18 November 2022 / Revised: 14 December 2022 / Accepted: 15 December 2022 / Published: 18 December 2022
(This article belongs to the Special Issue Advanced Machine Learning Applications in Big Data Analytics)

Abstract

:
Talent resources are a primary resource and an important driving force for economic and social development. At present, researchers have conducted studies on talent introduction, but there is a paucity of research work on the stability of talent introduction. This paper presents the first study on talent stability in higher education, aiming to design an intelligent prediction model for talent stability in higher education using a kernel extreme learning machine (KELM) and proposing a differential evolution crisscross whale optimization algorithm (DECCWOA) for optimizing the model parameters. By introducing the crossover operator, the exchange of information regarding individuals is facilitated and the problem of dimensional lag is improved. Differential evolution operation is performed in a certain period of time to perturb the population by using the differences in individuals to ensure the diversity of the population. Furthermore, 35 benchmark functions of 23 baseline functions and CEC2014 were selected for comparison experiments in order to demonstrate the optimization performance of the DECCWOA. It is shown that the DECCWOA can achieve high accuracy and fast convergence in solving both unimodal and multimodal functions. In addition, the DECCWOA is combined with KELM and feature selection (DECCWOA-KELM-FS) to achieve efficient talent stability intelligence prediction for universities or colleges in Wenzhou. The results show that the performance of the proposed model outperforms other comparative algorithms. This study proposes a DECCWOA optimizer and constructs an intelligent prediction of talent stability system. The designed system can be used as a reliable method of predicting talent mobility in higher education.

1. Introduction

Talent resources are the core resources on which universities rely for survival and development. A reasonable flow of talent can stimulate the vitality of the organization, improve the quality of talent, form a virtuous cycle and promote the complementary advantages of talent resources among universities. However, the “war for talents” against the background of “double tops” has led to the disorderly and utilitarian flow of talents in colleges and universities, an increase in the introduction to talents, a continuous increase in local competition, an accelerated frequency of talent flow and a structural imbalance of talent flow among colleges and universities in the region. This has engendered many negative effects on the development of universities. Therefore, a reasonable forecast in stable trends of university talent is crucial to the survival and development of universities. However, traditional methods have some limitations on predicting the stability of talent. It is a new trend to use artificial intelligence algorithms to achieve accurate predictions of talent stability. There have been few studies that have used the artificial intelligence tools to solve the prediction issue of talent stability, so we have summarized some related works which used artificial intelligence tools to tackle the prediction problems for students; this is shown in Table 1.
The swarm intelligence algorithm (SIA) is a crucial optimization method by which to predict traditional talent stability. SIA is derived from natural phenomena or group behaviors, etc., such as group predation and physical phenomena. Optimization principles exist within these phenomena. As a kind of SIA, the whale optimization algorithm (WOA) [11] has a clear algorithm structure and good performance, which was proposed in 2016. It was designed by simulating the hunting behavior of whales. During foraging, the whales use bubbles as tools to surround their prey. Furthermore, the algorithm has been used in many natural science fields, such as shop scheduling problems [12,13] and engineering design problems. Navarro et al. [14] proposed a version of the WOA with the K-means mechanism to explore the algorithm’s search space. The proposed model was effective against resolving complex optimization issues. Abbas et al. [15] proposed a combination of the technique of an extremely randomized tree with the WOA for the detection and prediction of medical diseases. Abd et al. [16] introduced a novel WOA version application for multilevel threshold image segmentation. Abdel-Basset et al. [17] presented a new WOA version based on local search mechanisms to optimize a scheduling problem with the multimedia data objects field. Qiao et al. [18] presented a novel version of the WOA, which combined the worst individual disturbance and the neighborhood mutation search strategy for solving engineering design problems. Peng et al. [19] introduced an enhanced WOA, which combined the information-sharing search strategy and the Nelder-Mead simplex strategy, to evaluate the parameters of solar cells and photovoltaic modules. Abderazek et al. [20] presented the WOA and a moth-flame optimizer for optimizing spur gear design.
For the high-quality training of talent, in addition to focusing on the employment and entrepreneurship of university students, the stability of talents is also an important foundation for social and economic development. Employment stability reflects psychological satisfaction with practitioners regarding the employment unit, employment environment, remuneration package and career development. In the past five years, the average turnover rate of several colleges and universities in Wenzhou was 28.1%. An appropriate turnover rate is conducive to the “catfish effect” in enterprises and institutions, and stimulates the vitality and competitiveness of the organization; however, an excessive turnover rate has a negative impact on the human resource costs and economic efficiency of universities, as well as their social reputation and the quality development of the economy and society.
Big data has a wide scope of application in the field of talent mobility management. Through the effective mining of big data onto talent flows in a university, the stability of talent employment is analyzed, and the correlation hypothesis is verified by integrating an intelligent optimization algorithm, neural network, support vector machine and other machine learning methods; an intelligent prediction model is then constructed. At the same time, key factors affecting the stability of talent employment are mined, and the key influencing factors are analyzed in depth to explore the main features affecting the stability of talent employment and to provide reference for government decision-making and policy formulation. The main contributions are shown as bellow:
(1)
A multi-strategy hybrid modified whale optimization algorithm is proposed.
(2)
Introducing the crossover operator to facilitate the exchange of information and improve the problem of dimensional lag.
(3)
DECCWOA is verified on the 35 benchmark functions to demonstrate the optimization performance.
(4)
DECCWOA is combined with KELM and feature selection to achieve efficient talent stability intelligence prediction.
(5)
Results show the proposed methods surpass other reported approaches.
The remainder of this paper is structured as follows. Section 2 reviews the whale optimization algorithm. Section 3 provides a comprehensive description of the proposed method. The proposed method is verified and applied using benchmark function experiments and feature selection experiments in Section 4. The conclusion and future work are outlined in Section 5.

2. Relate Work

In recent years, swarm intelligence optimization algorithms have emerged, such as the Runge Kutta optimizer (RUN) [21], the slime mold algorithm (SMA) [22], the Harris hawks optimization (HHO) [23], the hunger games search (HGS) [24], the weighted mean of vectors (INFO) [25], and the colony predation algorithm (CPA) [26]. Moreover, they have achieved very good results in many fields, such as feature selection [27,28], image segmentation [29,30], bankruptcy prediction [31,32], plant disease recognition [33], medical diagnosis [34,35], the economic emission dispatch problem [36], robust optimization [37,38], expensive optimization problems [39,40], the multi-objective problem [41,42], scheduling problems [43,44,45], optimization of a machine learning model [46], gate resource allocation [47,48], solar cell parameter identification [49] and fault diagnosis [50]. In addition to the above, the whale optimization algorithm (WOA) [11] is an optimization algorithm simulating the behaviors of whales rounding up their prey. During feeding, whales surround their prey in groups and move in a whirling motion, releasing bubbles in the process, and thus, closing in on their prey. In the WOA, the feeding process of whales can be divided into two behaviors, including encircling prey and forming bubble nets. During each generation of swimming, the whale population will randomly choose between these two behaviors to hunt. In d -dimensional space, suppose that the position of each individual in the whale population is expressed as X = ( x 1 ,   x 2 ,   ,   x D ) .
Agrawal et al. [51] proposed an improved WOA and applied it to the field of feature selection [52]. Bahiraei et al. [53] proposed a novel perceptron neural network, which combined the WOA and other algorithms, and was applied to the field of polymer materials. Qi et al. [54] introduced a new WOA with a directional crossover strategy, directional mutation strategy, and levy initialization strategy. The potential for using the suggested approach to address engineering issues is very high. Bui et al. [55] proposed a neural-network-model-based WOA, which also integrated a dragonfly optimizer and an ant colony optimizer, and was applied to the construction field. Butti et al. [56] presented an effective version of the WOA to optimize the stability of power systems. Cao et al. [57] also proposed a new WOA to improve the efficiency of the proton exchange of membrane fuel cells. Cercevik et al. [58] presented an optimization model, combined with the WOA and others, to improve the parameters of seismic isolated structures. Zhao et al. [59] presented a susceptible-exposed-infected-quarantined (hospital or home)-recovered model based on the WOA and human intervention strategies to simulate and predict recent outbreak transmission trends and peaks in Changchun. A brand-new hybrid optimizer was developed by Fan et al. [60] to solve large-scale, complex practical situations. The proposed hybrid optimization algorithm combined a fruit flew optimizer with the WOA. Raj et al. [61] proposed the application of the WOA as a solution to reactive power planning with flexible transmission systems. Guo et al. [62] proposed an improved WOA with two strategies to improve the exploration and exploitation abilities of the WOA, including the random hopping update mechanism and random control parameter mechanism. To improve the algorithm’s convergence rate and accuracy, a new version of the WOA was presented by Jiang et al. [63] to apply constraints to engineering tasks.
Although the WOA has obtained good results in many fields, the algorithm easily falls into the local optimum in the face of complex problems. Therefore, many excellent improvement algorithms have been proposed. For example, Hussien et al. [29] proposed a novel version of the whale optimizer with the gaussian walk mechanism and the virus colony search strategy to improve convergence accuracy. To solve the WOA’s susceptibility to falling into the local optimum with slow convergence speeds, an improved WOA with a communication strategy and the biogeography-based model was proposed by Tu et al. [64]. Wang et al. [65] presented a novel-based elite mechanism WOA, with a spiral motion strategy to improve the original algorithm. Ye et al. [49] introduced an enhanced WOA version of the levy flight strategy and search mechanism to improve the algorithm’s balance. Abd et al. [66] presented an innovative method to enhance the WOA, including the differential evolution exploration strategy. Abdel-Basset et al. [67] introduced an enhanced whale optimizer, which was combined with a slime mold optimizer to improve the performance of the algorithm. To enhance the WOA’s search ability and diversity, a novel version of the WOA with an information exchange mechanism was proposed by Chai et al. [68]. Heidari et al. [69] presented a whale optimizer with two strategies, including an associative learning method and a hill-climbing algorithm. Jin et al. [70] proposed a dual operation mechanism based on the WOA to solve the slow convergence speed problem. Therefore, the WOA is an effective optimizer by which to improve the performance of traditional talent stability prediction.

3. Materials and Methods

This section will improve the problems existing in the traditional whale optimization algorithm, so as to propose a new version of the algorithm. During the process of the whale population continuously approaching the optimal position, the population appears in an aggregation state, which is the main reason for the algorithm falling into the local optimal. Based on this, the DE operation is performed on the whale population during a certain period, and the whale population is disturbed by the differential information of multiple individuals, so as to ensure the diversity of the population. By introducing the idea of a crisscross optimization algorithm, a vertical crossover is performed in dimensions to improve dimensional stagnation as iterations progress, and horizontal crossover is performed between individuals to fully facilitate the exchange of information between individuals, allowing the problem space to be fully searched, effectively improving the search capability of the algorithm. Overall, the proposed algorithm is named as the DE-based crisscross whale algorithm (DECCWOA).

3.1. Whale Optimization Algorithm

3.1.1. Encircling Prey

In the process of encircling the prey, each individual will choose the position closest to the prey in the group, that is, the global optimal solution, or will randomly select a whale and approach it. The equation for updating the position of the whale is shown in Equation (1).
X i t + 1 = X b e s t t A |   C × X q t X i t t |
where X q t   is X b e s t t when the whale swims toward the optimal whale position, and X r a n d t   when the whale swims toward the random whale position. A is a random number with a uniform distribution between   ( a ,   a ) , and the initial value of a is 2, which linearly decreases to 0 with the number of iterations. C is a random number that satisfies the uniform distribution, and its value is between (0, 2). The choice of whether the whale individual swims toward the optimal whale or random position is up to the value of A . When   | A   <   1 | , the whale decides to swim toward the optimal individual; otherwise, the whales will select a random location in the population and approach it.

3.1.2. Forming Bubble Nets

Whales release bubbles while hunting, thus forming a spiraling, blistering net to repel the prey. If bubble feeding is chosen, the whale first calculates the distance between itself and the best whale, then swims upwards in a spiral and spits out bubbles of varying sizes to feed on the fish and prawns. At this point, the position of the whale is updated by the equation shown in Equation (2).
X i t + 1 = | X b e s t t X i t | × e b l × c o s ( 2 π l ) + X b e s t t
where b is a constant, and l is a random number between [−1, 1], meeting a uniform distribution.

3.2. Differential Evolution Algorithm (DE)

The differential evolution algorithm (DE) [71] was proposed in 1997 based on the idea of evolutionary algorithms, such as genetic algorithms, which are essentially multi-objective optimization algorithms that can be used to solve the overall optimal solution in a multi-dimensional space. The DE is the same as other genetic algorithms in that the main process consists of three steps: mutation, crossover and selection. However, the variance vector of the differential DE is generated from the parent differential vector and is crossed with the parent individual vector to generate a new individual vector, which is directly selected with its parent individual. Suppose the position vector of the i -th individual in the population is   X i .

3.2.1. Crossover Operations

The basic variance vector is generated by Equation (3), and r 1   r 2 r 3 . Therefore, in the DE algorithm, the population must be greater than 3. F is the crossover operator, with a value usually between [0, 2], which controls the amplification of the deviation vector. Commonly, the difference between the two vectors is multiplied by the crossover operator and added to the third vector to generate a new mutation vector.
X i = X r 1 + F × ( X r 2 X r 3 )
In this article, in order to allow for faster convergence of the population algorithm while maintaining population diversity, we attempt to calculate the difference between the position of the current population and the optimal population position ( X b e s t ) , on the basis of which a new variant population is generated. Therefore, Equation (3) is rewritten as shown in Equation (4).
  V i = X i + F × ( X b e s t X i )

3.2.2. Mutation Operations

To increase the diversity of the interference vectors, crossover operations are introduced. Equation (5) presents the principle of the crossover operation.
U i , j = { V j i       i f   r a n d b ( j )     C R   o r   j = r n b r ( i ) X i , j     i f   r a n d b ( j ) > C R   o r   j     r n b r ( i ) ,   i = 1 ,   2 ,   ,   N P ;   j = 1 , 2 ,   ,   D
r a n d b ( j ) denotes the generation of the j -th estimate of a random number between [0, 1] and r n b r denotes a randomly chosen sequence. C R is the crossover operator. In simple terms, if the randomly generated randb(j) is less than C R or j = r , then the variant population is placed in the selection population; if not, the original population is placed in the selection population.

3.2.3. Selection Operation

In order to decide whether the vectors in the selection population can become part of the next generation, the newly generated position vectors are compared with the current target vectors, and, if it appears that the objective function is further optimized or the original state is maintained, then, the newly generated individuals will appear in the next generation. The selection operation is defined as shown in Equation (6).
X i = { U i       i f   f ( U i ) < f ( X i )   X i     i f   f ( U i )   f ( X i )  
The DE is a simple and easy-to-implement algorithm that mainly performs genetic operations by means of differential variation operators. The algorithm has shown good robustness and efficiency in solving most optimization problems [72,73,74,75]. Furthermore, the algorithm is intrinsically parallel and can coordinate searches, so that the DE has a faster convergence rate for the same requirement.

3.3. Crisscross Optimization Algorithm

The crisscross optimization algorithm (CSO) [76] is a new population-based stochastic search algorithm that performs both horizontal and vertical crossover in each generation during each iteration, thus allowing certain dimensions of the population that are trapped in a pseudo-optimal a chance to jump out. The new individuals obtained after each crossover need to go through competition, and only the individuals better than the parent generation will be retained for the next iteration.

3.3.1. Horizontal Crossover Operator

A horizontal crossover operation is similar to crossover operations in genetic algorithms, a kind of arithmetic crossover between the same dimension of two different individual particles in a population. Assuming a horizontal crossover in the d -th dimension for the i -th and j -th parent individual particles, the formula for generating offspring is shown in Equations (7) and (8).
M S h c ( i , d ) = r 1 × X ( i ,   d ) + ( 1 r 1 ) × X ( j ,   d ) + c 1 × ( X ( i ,   d ) X ( j ,   d ) )  
M S h c ( j , d ) = r 1 × X ( j ,   d ) + ( 1 r 1 ) × X ( i ,   d ) + c 1 × ( X ( j ,   d ) X ( i ,   d ) )  
where r 1 and r 2 are random numbers between [0, 1], and, c 1 and c 2 are random numbers between [−1, 1]. X ( i ,   d ) and X ( j ,   d ) represent the d -th dimension of the i -th and j -th individuals in the population, respectively. M S h c ( i , d ) and M S h c ( j , d ) are the d -th dimension of the offspring generated by X ( i ,   d ) and X ( j ,   d ) via horizontal crossover, respectively. From a sociological point of view, r 1 × X ( i ,   d ) is the memory term of particle X ( i ) . ( 1 r 1 ) × X ( j ,   d ) is the group cognitive term of particles X ( i ) and X ( j ) , representing the interaction between different particles. c 1 is the learning factor, c 1 × ( X ( i ,   d ) X ( j ,   d ) )   can effectively enlarge the search interval and search for optimization at the edge. The schematic diagram of the horizontal crossover operation is shown in Figure 1.

3.3.2. Vertical Crossover Operator

A vertical crossover is an arithmetic crossover between two different dimensions of a particle in a population. Since different dimensional elements have different ranges of values, the two dimensions need to be normalized before crossover. Furthermore, in order to allow the dimension that has stalled in the local optimum to jump out of the local optimum without destroying the information of the other dimension, only one child particle is generated for each vertical crossover operation, and only one of the dimensions is updated. The vertical crossover operation is defined by Equation (9).
M S v c ( i ,   d 1 ) = r × X ( i ,   d 1 ) + ( 1 r ) × X ( i ,   d 2 ) ,   i   N ( 1 ,   M ) ,   d 1   d 2     N ( 1 ,   D )
where r is a random number between [0, 1]. M S v c ( i ,   d 1 ) is the d 1 -th dimension of the offspring produced by the d 1 -th and d 2 -th dimensions of individual X ( i ) by vertical crossover. The new individual contains not only the information of the d 1 -th dimension of the parent particle, but also the information of the d 2 -th dimension with a certain probability, and the information of the d 2 -th dimension will not be destroyed during the crossover. A schematic diagram of the vertical crossover is shown in Figure 2.

3.4. Framework of Proposed DECCWOA

The whale algorithm, the crossover and mutation operations in the DE and the crisscross operators together form the overall framework of the DECCWOA. We consider a positive population renewal to be complete when a location closer to a food source is found in one iteration. When the entire whale population has completed S positive updates, we consider the population to have been concentrated and to be losing population diversity. In one iteration, after the whales have completed one location update, it is determined whether the population has completed S positive updates, and, if so, the crossover and mutation operations of the DE algorithm are performed, resulting in a perturbation of the whale population, further ensuring population quality. Moreover, vertical crossover is performed in dimensions to improve dimensional stagnation as iterations progress, and, when the entire population has completed one location update, horizontal crossover is performed between individuals to fully facilitate the exchange of information between individuals, allowing the problem space to be fully searched, effectively improving the search capability of the algorithm. The pseudo-code of the DECCWOA can be seen in Algorithm 1, and a flow chart of the overall DECCWOA framework is shown in Figure 3.
Algorithm 1: The pseudo-code of the DECCWOA
Input: Number of populations N, maximum number of iterations T, ,   objective   function   f o b j ;
Output: Optimum   whale   position   X b e s t ;
Initialize the whale population positions X;
Calculate fitness values for all individuals in the whale population and sort them;
Set   the   position   of   the   individual   with   the   smallest   fitness   value   f b e s t   to   X b e s t ;
Set s = 0;
while (t < T)
    for each agent
      Update a, A, C l, S and p;
      if p < 0.5
            if   | A | < 1   &&   s < S
             Update   the   position   of   agent   using   Equation   ( 1 ) ,   and   set   X q   as   X b e s t ;
            elseif   | A |     1   &&   s < S
             Select   a   random   search   agent   as   X r a n d ;
             Update   the   position   of   agent   using   Equation   ( 1 ) ,   and   set   X q   as   X r a n d ;
            elseif   s     S
             Performing crossover and mutation operations in DE;
            end if
      else
           Update the position of agent using Equation (2);
       end if
      Perform vertical crossover operator using Equation (9);
    end for
   Perform horizontal crossover operation using Equations (7) and (8);
   Calculate fitness values for all individuals in the whale population and sort them;
    Set   the   position   of   the   individual   with   the   smallest   fitness   value   g b e s t   to   X g b e s t ;
    if   g b e s t < f b e s t
         Updates   X b e s t   and   f b e s t ;
         s = s + 1;
    end if
     t = t + 1;
end while
Return   X b e s t
In the basic whale algorithm, only each individual in the population is updated according to the corresponding situation in each iteration, excluding other complex operations. Therefore, the time complexity of the algorithm is only related to the maximum number of iterations T and the population size N ; that is, the time complexity of the whale algorithm is O ( T N ) . When executing the vertical crossover algorithm, the time complexity of the vertical crossover is O(D); a vertical crossover is performed at the end of each individual update as the vertical crossover occurs in dimension D . When the horizontal crossover is executed after the whole population has been updated, the time complexity of the horizontal crossover is O ( N D ) depending on the size of the individuals and the dimension of the problem, as the horizontal crossover is performed by communicating between individuals and updating the dimensional information in turn. In DE, a crossover is performed, and the mutation and selection operations are only related to dimensions, so the time complexity of an iteration is O ( D ) . In this work, only when the position of the population is updated every time and a certain period is met, we carry out an operation of crossover, mutation and selection for the population. Therefore, the operation of theoretically introducing the DE does not add a high time cost to the algorithm. In summary, the time complexity of the proposed algorithm DECCWOA is O ( T   ( O ( N D ) + O ( N ) ) ) .

4. Experimental Results

This section presents a quantitative analysis of the introduced DE and CSO mechanisms and presents the experimental results comparing the proposed algorithm, DECCWOA, with other improved WOA algorithms and improved swarm intelligence algorithms that have better performance on 35 benchmark functions. Furthermore, to show that the proposed algorithm is still valid for practical applications, the DECCWOA is applied to the intelligent prediction of talent stability in universities. All experiments were carried out on a Windows Server 2012 R2 operating system with Intel(R) Xeon(R) Silver 4110 CPU (2.10 GHz) and 32.GB RAM. All algorithms were coded and run on MATLAB 2014b.
To ensure fairness of the experiment, all algorithms were executed in the same environment. For all algorithms, the population size was set to 30, the maximum number of function evaluations was set to 300,000 and, to avoid the effect of randomness on the results, each algorithm was individually executed 30 times on each benchmark function. a v g and s t d reflect the average ability and stability of each algorithm after 30 independent experiments. To allow a more visual presentation of the average performance of all the algorithms, the Freidman test is used to evaluate the experimental results of all algorithms on the benchmark function and the final ranking is recorded.

4.1. Experimental Results of the DECCWOA on Benchmark Functions

The DECCWOA and its related comparison algorithm conducted comparison experiments on 35 benchmark functions selected from 23 benchmark functions and CEC2014. In detail, Table A1 of the Appendix A shows a summary of the 35 test functions, which can be divided into three categories, including unimodal functions, multimodal functions and hybrid functions.

4.1.1. Parameter Sensitivity Analysis

Not every dimension of an individual is selected for crossover in a vertical crossover operation. In the vertical crossover operation, there is a key parameter p 2 . When the random probability is less than p 2 , the crossover operation is performed in the corresponding dimension of the individual, as shown in Equation (9). Otherwise, the operation is considered not to be performed in that dimension. The possible values of p 2 are 0.1, 0.2, 0.3, 0.4, 0.5, 0.6, 0.7, 0.8, 0.9 and 1.0. In order to visually present the impact of p 2 on the optimization capabilities of the DECCWOA, we conducted comparative experiments using different versions. The names corresponding to the different algorithm versions are shown in Table 2.
Different values of p 2 have a direct impact on the optimization of the DECCWOA. Table 3 shows the results of the DECCWOA2 and Table A2 in Appendix A shows the detailed results when p 2 is taken to different values. The rankings generated by the Friedman test show that when the value of p 2 is too large, the less effective the average optimization is. The significance of introducing a longitudinal crossover operator is to help the population change dimensional stagnation. That is because when p 2 takes a larger value, it means that each dimension of the individual changes with a high probability. This not only changes the dimension of stagnation, but also the dimension of having good performance along with it. Notably, when p 2 is taken as 0.1 versus 0.2, the performance is similar for 28 of the 35 benchmark functions, but, for overall performance, the DECCWOA2 is slightly better. This is because, when the value of p 2 is too small, only a few dimensions are adjusted after the individual enters the vertical crossover operator, which does not have the problem of falling into local optima due to dimensional stagnation being significantly improved, especially in solving multimodal functions and hybrid functions. Therefore, in the course of the next experiments, p 2 was set to 0.2.

4.1.2. Comparison of Mechanisms

In order to verify the effectiveness of the introduced mechanism in improving the optimization capabilities of the WOA, ablation studies on the integrated DE and CSO were conducted. Table 4 presents the comparison results for the introduced mechanisms. The detailed results can be found in Table A3 of Appendix A. Notably, on most of the benchmark functions, the DECCWOA has the best optimization capability by performing the Friedman test on 30 times randomized trials. Furthermore, the CCWOA with the introduction of CSO outperforms the WOA on more than 90% of the benchmark functions. However, for the DEWOA, which introduces the DE into the WOA, although the overall results are not significantly improved, a comparison of the optimization performance of CCWOA and DECCWOA shows that the combination of CSO with the DE makes the WOA more optimizable.
Convergence curves of the comparison results for the introduced mechanisms are shown in Figure 4. Among them, the CCWOA excels in both optimization accuracy and convergence speed on F4, F6 (from 23 benchmark functions) and unimodal functions of F14 (from CEC2014), F12, F13 (from 23 benchmark functions), multimodal functions of F18, F19, F23, F24, F29 (from CEC2014) and hybrid functions of F30 and F32. In particular, CCWOA also has stronger search ability in multimodal functions and hybrid functions. This shows that CSO effectively improves the problem that the basic WOA is prone to falling into the local optimum. It is also worth noting that the introduction of the DE did not give the desired results on most of the benchmark functions. However, when acting together with a CSO on the WOA, the convergence speed and optimization accuracy of the DECCWOA are significantly improved. Especially in F4, F6 and F13, it is obvious that the DECCWOA has better performance than the CCWOA. This is because we perform the DE crossover and mutation operations over a period of time in order to take advantage of differences between individuals to disturb the population, but do not perform the rounding up of prey in the basic WOA at this time, thus slowing the efficiency of the whale population towards the food source. However, when CSO is applied to the whole population, not only is the information between individuals utilized, but also the information in the spatial dimension is considered. Combined with the periodic perturbation of the DE, the whale population can search the whole problem space more efficiently.

4.1.3. Comparison with Improved WOA Versions

In order to provide a clearer picture of the results of the experiments comparing the DECCWOA with other improved WOA algorithms for 35 benchmark functions, a v g and s t d of all functions obtained after 30 independent experiments on the corresponding benchmark functions and the average ranking results of the Friedman test on the average results are recorded in Table 5. The detailed results are shown in Table A4 of Appendix A. The composite average ranking of the DECCWOA is the highest, followed by the RDWOA and the CCMWOA with the lowest. Among them, +/−/= respectively records the number of benchmark functions that the DECCWOA is superior to, inferior to and similar to in terms of performance to other competing algorithms among the 35 test functions. For the worst performing CCMWOA, the DECCWOA outperforms it for twenty-eight benchmark functions, has the same performance on five functions, and performs slightly worse on only two functions. Moreover, compared to the RDWOA, which ranks second overall, the DECCWOA has better performance for sixteen benchmark functions, has the same optimization ability for thirteen functions and only has poor performance for six functions. This proves that the DECCWOA has better performance than other improved WOA algorithms for most of the optimization problems, further demonstrating that the introduced CSO and DE have a positive steering effect on improving the basic WOA, such as slow convergence speed and poor accuracy guiding role.
In this section, the performance of the DECCWOA is compared with other improved versions of the WOA, including the RDWOA, the ACWOA, the CCMWOA [77], the CWOA [78], the BMWOA, the BWOA, the LWOA [79] and the IWOA [80]. Figure 5 shows the convergence curves of the average results obtained after 30 operations for all algorithms. On unimodal functions such as F6, it can be intuitively observed that the DECCWOA has the strongest search capability, with the RDWOA in second place, but the DECCWOA has a better performance than the RDWOA in terms of both accuracy and convergence speed. For both F12 and F13, the optimal values found by the other improved WOA algorithms are similar and more concentrated; however, the accuracy of the optimization obtained by the DECCWOA calculation is substantially improved. On F18, F19, F21, F23, F25 and F29, the DECCOWA can still search for more satisfactory optimal values compared to the other improved WOA algorithms. This demonstrates that the improvements to the WOA in this experiment are relatively more effective, and that, even when solving for multimodal functions, the DECCWOA can still jump out of the local optimum in time to obtain a high-quality optimal solution.

4.1.4. Comparison with Advanced Algorithms

Table 6 presents the comparison results for the DECCWOA with advanced algorithms. The detailed results can be found in Table A5 of Appendix A. a v g reflects the average optimization ability of the algorithm after independently running on the benchmark function for 30 times, and s t d represents the influence of randomness on the optimization ability of the algorithm, which further reflects the stability of the algorithm to solve problems. From Table 6, the DECCWOA is superior to the IGWO on twenty functions and is inferior to the IGWO on eight functions (F3, F5, F22, F28, F30, F33, F34, F35). The DECCWOA beats the OBLGWOA on nineteen functions and loses to the OBLGWO on five functions (F3, F7, F28, F30, F33). For the CGPSO, ALCPSO and RCBA, the DECCWOA is inferior to them on nine functions, and outperforms most of the others. In detail, the DECCWOA is worse than the CGPSO at F5, F7, F8, F16, F17, F26, F30, F33 and F34, worse than the ALCPSO at F15, F16, F20, F21, F22, F28, F30, F33 and F34 and is worse than the RCBA at F14, F15, F16, F17, F20, F26, F30, F33 and F34. The DECCWOA beats the CBA on twenty-four functions, and loses to the CBA in six functions (F15, F16, F20, F30, F33, F34). The DECCWOA outperforms the OBSCA on 32 functions and only performs worse than the OBSCA on one function of F3. The DECCWOA is worse than the SCADE on F3 and F6. Based on the analysis above, the DECCWOA did not perform as well as the ALPSO, RCBA and CBA on the three unimodal functions (F14~F16) selected in CEC2014, but demonstrated competitive performance on the seven unimodal functions (F1~F7) selected from the twenty-three benchmark functions. The DECCWOA does not perform more competitively than the other comparison algorithms in terms of hybrid functions, but the DECCWOA performs well on most of the multimodal functions.
In order to verify the effectiveness of the proposed DECCWOA compared to other advanced algorithms, comparison experiments were carried out. Among them, an enhanced GWO with a new hierarchical structure (IGWO) [81], boosted GWO (OBLGWO) [82], cluster guide PSO (CGPSO) [83], hybridizing sine cosine algorithm with differential evolution (SCADE) [84], particle swarm optimization with an aging leader and challengers (ALPSO) [85], hybrid bat algorithm (RCBA) [86], chaotic BA (CBA) [87] and opposition-based SCA (OBSCA) [88] were selected as the comparison algorithms. Convergence curves for comparison with the advanced algorithms are displayed in Figure 6. In particular, for unimodal functions, the DECCWOA has the same search capability as the IGWO, OBLGWO, CGPSO and SCADE in F1. For F6, the DECCWOA has the strongest optimization capability and, as can be seen in Figure 6, the DECCWOA maintains a satisfactory convergence rate for F6. On the multimodal functions, such as F12, F13, F21, F23, F24 and F29, the DECCWOA also shows strong optimization ability. Compared with the classic ALPSO, the optimization performance of the DECCWOA is not inferior, and it can even converge to a better solution at a faster convergence rate. When solving a hybrid optimization problem, such as F31, although the IGWO can still obtain better solutions in the late iteration, its convergence speed is slow and the search ability is poor in the early iteration. The OBLGWOA, CGPAO, SCADE and OBSCA are unsatisfactory in terms of their optimization ability and convergence speeds during the entire iterative process, while the ALPSO, RCBA and CBA are relatively better; however, the DECCWOA showed better optimization than them.

4.2. Experiments on Application of the DECCWOA in Predicting Talent Stability in Higher Education

4.2.1. Description of the Selected Data

The subjects studied in this paper were 69 talented individuals who left several colleges and universities in Wenzhou from 1 January 2015, accounting for 11.5% of the official staff. The following characteristics were examined: subject gender, political status, professional attributes, age, type of place of origin, category of talents above the municipal level, nature of the previous unit, type of location of college and university, year of employment at college and university, type of position at college and university, professional relevance of employment at college and university, annual salary level at college and university, current employment unit, time of introduction of current employment unit, nature of current employment unit and type of location of current employment unit. The indicators, as presented in Table A6 of the Appendix A, were mined and analyzed to explore the importance and interconnectedness of each indicator, and to build an intelligent prediction model based on these indicators. Moreover, the following indicators are bolded as important indicators.

4.2.2. Experimental Results

The proposed DECCWOA was combined with the KELM and the feature selection (DECCWOA-KELM-FS) method to solve the classification problem of employment intention of talent. The experimental results are shown in Table 7 and Table 8. The DECCWOA-KELM-FS’s results on the ACC, Sensitivity, Specificity and MCC indicators are 95.87%, 94.96%, 96.59% and 91.64%, respectively. The classification results are all superior to other comparison algorithms, including the DECCWOA-KELM, DECCWOA-KELM, WOA-KELM, ANN, RF and SVM. Furthermore, the stability results of the ten experimental results of the proposed model are also superior. The std metrics results of the ACC, Sensitivity, Specificity and MCC indicators are 3.19 × 10−2, 6.85 × 10−2, 4.25 × 10−2 and 6.66 × 10−2. Obviously, the stability of the proposed algorithm is better than that of most comparison algorithms. Therefore, by combining the DECCWOA with the KELM and FS, the talent stability prediction of Wenzhou Vocational College is effectively realized. To further visualize the results, Figure 7 shows a comparison of results between the proposed algorithm and the other five methods, including the average results and standard deviations of the five indicators. Similarly, the average performance and stability of the DECCWOA-KELM-FS in each index are better than most reported algorithms.
Figure 8 shows the feature selection results of the proposed model. As can be seen, F7 (city-level and above talent categories) and F22 (professional and technical position at the time of leaving) are both screened the most, eight times. It shows that the two key factors affecting the stability of university talents are F7 and F22, which provides some guiding significance of the flow of highly educated talents. Based on the fact that the proposed method has such excellent performance, it can also be applied in many other fields in the future, such as information retrieval services [89,90], named entity recognition [91], road network planning [92], colorectal polyp region extraction [93], image denoising [94], image segmentation [95,96,97] and power flow optimization [98].

5. Conclusions

This paper studied the stability of higher education talent for the first time, and proposed a DECCWOA-KELM-FS model to intelligently predict the stability of higher education talent. By introducing a crossover algorithm, the information exchange between individuals was promoted and the problem of dimension stagnation was improved. The DE operation was carried out in a certain time, and the difference between individuals was used to disturb the population and ensure the diversity of the population. In order to verify the optimization performance of the DECCWOA, 35 benchmark functions were selected from 32 benchmark functions and CEC214 for comparative experiments. Experimental results showed that the DECCWOA algorithm had higher accuracy and faster convergence rates when solving unimodal and multimodal functions; although the mixture function also had very good performance. By combining the DECCWOA with the KELM and feature selection, the stable intelligence of talent in Wenzhou colleges and universities was efficiently predicted. This method can be used as a reliable and high precision method to predict the flow of talent in colleges and universities.
Subsequent studies will further improve the generality of the proposed GLLCSA-KELM-FS and solve more complex classification problems, such as disease diagnosis and financial risk prediction.

Author Contributions

Conceptualization, G.L. and H.C.; methodology, F.K. and H.C.; software, G.L. and F.K.; validation, H.L., S.K., X.R., C.L., G.L., H.C., F.K. and L.L.; formal analysis, F.K., G.L. and L.L.; investigation, H.L., S.K., D.C. and C.L.; resources, F.K., G.L. and L.L.; data curation, F.K., G.L. and C.L.; writing—original draft preparation, H.L., S.K., X.R. and C.L.; writing—review and editing, G.L. and H.C.; visualization, G.L. and H.C.; supervision, F.K., G.L. and L.L.; project administration, F.K., G.L. and L.L.; funding acquisition, F.K., G.L. and H.C. All authors have read and agreed to the published version of the manuscript.

Funding

Zhejiang Provincial universities Major Humanities and social Science project: Innovation and Practice of Cultivating Paths for Leaders in Rural Industry Revitalization under the Background of Common Prosperity (Moderator: Li Hong), Humanities and Social Science Research Planning Fund Project of the Ministry of Education (research on risk measurement and early warning mechanism of science and technology finance based on big data analysis, 20YJA790090), Zhejiang Provincial Philosophy and Social Sciences Planning Project (Research on rumor recognition and dissemination intervention based on automated essay scoring, 23NDJC393YBM).

Data Availability Statement

The data involved in this study are all public data, which can be downloaded through public channels.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

Table A1. Details of the selected 35 benchmark functions.
Table A1. Details of the selected 35 benchmark functions.
TypesNo.FunctionsRangfmin
Unimodal
Functions
F1 f 1 ( x ) = i = 1 n x i 2 [−100, 100]0
F2 f 2 ( x ) = i = 1 n | x i | + i = 1 n | x i | [−10, 10]0
F3 f 3 ( x ) = i = 1 n   ( j 1 i   x j ) 2 [−100, 100]0
F4 f 4 ( x ) = max i { | x i | , 1 i n } [−100, 100]0
F5 f 5 ( x ) = i = 1 n 1 [ 100 ( x i + 1 x i 2 ) 2 + ( x i 1 ) 2 ] [−30, 30]0
F6 f 6 ( x ) = i = 1 n ( [ x i + 0.5 ] ) 2 [−100, 100]0
F7 f 7 ( x ) = i = 1 n i x i 4 + r a n d o m [ 0 , 1 ] [−1.28, 1.28]0
Multimodal
Functions
F8 f 8 ( x ) = i = 1 n x i sin ( | x i | ) [−500, 500]−418.9829 × 5
F9 f 9 ( x ) = i = 1 n [ x i 2 10 cos ( 2 π x i ) + 10 ] [−5.12, 5.12]0
F10 f 10 ( x ) = 20 exp ( 0.2 1 n i = 1 n x i 2 ) exp ( 1 n i = 1 n cos ( 2 π x i ) ) + 20 + e [−32, 32]0
F11 f 11 ( x ) = 1 4000 i = 1 n x i 2 i = 1 n cos ( x i i ) + 1 [−600, 600]0
F12 f 12 ( x ) = π n { 10 sin ( π y 1 ) + i = 1 n 1 ( y i 1 ) 2 [ 1 + 10 sin 2 ( π y i + 1 ) ] + ( y n 1 ) 2 } + i = 1 n u ( x i , 10 , 100 , 4 ) y i = 1 + x i + 1 4 , u ( x i , a , k , m ) = { k ( x i a ) m x i > a 0 a < x i < a k ( x i a ) m x i < a [−50, 50]0
F13 f 13 ( x ) = 0.1 { sin 2 ( 3 π x 1 ) + i = 1 n ( x i 1 ) 2 [ 1 + sin 2 ( 3 π x i + 1 ) ] + ( x n 1 ) 2 [ 1 + sin 2 ( 2 π x n ) ] } + i = 1 n u ( x i , 5 , 100 , 4 ) [−50, 50]0
Unimodal FunctionsF14Rotated High Conditioned Elliptic Function[−100, 100]100
F15Rotated Bent Cigar Function[−100, 100]200
F16Rotated Discus Function[−100, 100]300
Simple Multimodal FunctionsF17Shifted and Rotated Rosenbrock’s Function[−100, 100]400
F18Shifted and Rotated Ackley’s Function[−100, 100]500
F19Shifted and Rotated Weierstrass Function[−100, 100]600
F20Shifted and Rotated Griewank’s Function[−100, 100]700
F21Shifted Rastrigin’s Function[−100, 100]800
F22Shifted and Rotated Rastrigin’s Function[−100, 100]900
F23Shifted Schwefel’s Function[−100, 100]1000
F24Shifted and Rotated Schwefel’s Function[−100, 100]1100
F25Shifted and Rotated Katsuura Function[−100, 100]1200
F26Shifted and Rotated HappyCat Function[−100, 100]1300
F27Shifted and Rotated HGBat Function[−100, 100]1400
F28Shifted and Rotated Expanded Griewank’s plus Rosenbrock’s Function[−100, 100]1500
F29Shifted and Rotated Expanded Scaffer’s F6 Function[−100, 100]1600
Hybrid Function1F30Hybrid Function 1 (N = 3)[−100, 100]1700
F31Hybrid Function 2 (N = 3)[−100, 100]1800
F32Hybrid Function 3 (N = 4)[−100, 100]1900
F33Hybrid Function 4 (N = 4)[−100, 100]2000
F34Hybrid Function 5 (N = 5)[−100, 100]2100
F35Hybrid Function 6 (N = 5)[−100, 100]2200
Table A2. Experimental results for analysis of key parameter p 2 .
Table A2. Experimental results for analysis of key parameter p 2 .
F1F2F3
a v g s t d a v g s t d a v g s t d
DECCWOA10.0000 × 1000.0000 × 1000.0000 × 1000.0000 × 1006.0453 × 10−83.3108 × 10−7
DECCWOA20.0000 × 1000.0000 × 1000.0000 × 1000.0000 × 1004.2361 × 10−172.3074 × 10−16
DECCWOA30.0000 × 1000.0000 × 1000.0000 × 1000.0000 × 1006.1871 × 10−281.4243 × 10−27
DECCWOA40.0000 × 1000.0000 × 1000.0000 × 1000.0000 × 1001.8338 × 10−272.4802 × 10−27
DECCWOA50.0000 × 1000.0000 × 1000.0000 × 1000.0000 × 1005.5498 × 10−281.4428 × 10−27
DECCWOA60.0000 × 1000.0000 × 1000.0000 × 1000.0000 × 1005.9383 × 10−281.6120 × 10−27
DECCWOA70.0000 × 1000.0000 × 1000.0000 × 1000.0000 × 1009.3229 × 10−281.9913 × 10−27
DECCWOA80.0000 × 1000.0000 × 1000.0000 × 1000.0000 × 1003.4963 × 10−281.1052 × 10−27
DECCWOA90.0000 × 1000.0000 × 1000.0000 × 1000.0000 × 1005.3287 × 10−281.2818 × 10−27
DECCWOA100.0000 × 1000.0000 × 1000.0000 × 1000.0000 × 1004.2382 × 10−281.3085 × 10−27
F4F5F6
a v g s t d a v g s t d a v g s t d
DECCWOA10.0000 × 1000.0000 × 1002.4439 × 1016.6504 × 1000.0000 × 1000.0000 × 100
DECCWOA20.0000 × 1000.0000 × 1002.4123 × 1016.5641 × 1000.0000 × 1000.0000 × 100
DECCWOA30.0000 × 1000.0000 × 1002.6257 × 1012.8910 × 10−10.0000 × 1000.0000 × 100
DECCWOA40.0000 × 1000.0000 × 1002.5987 × 1014.1389 × 10−10.0000 × 1000.0000 × 100
DECCWOA50.0000 × 1000.0000 × 1002.6107 × 1013.0119 × 10−10.0000 × 1000.0000 × 100
DECCWOA60.0000 × 1000.0000 × 1002.5412 × 1014.8062 × 1000.0000 × 1000.0000 × 100
DECCWOA70.0000 × 1000.0000 × 1002.5432 × 1014.8097 × 1000.0000 × 1000.0000 × 100
DECCWOA80.0000 × 1000.0000 × 1002.4619 × 1016.6972 × 1000.0000 × 1000.0000 × 100
DECCWOA90.0000 × 1000.0000 × 1002.5539 × 1014.8318 × 1000.0000 × 1000.0000 × 100
DECCWOA100.0000 × 1000.0000 × 1002.6489 × 1013.4054 × 10−10.0000 × 1000.0000 × 100
F7F8F9
a v g s t d a v g s t d a v g s t d
DECCWOA11.6842 × 10−42.7932 × 10−4−1.3963 × 1045.1858 × 1030.0000 × 1000.0000 × 100
DECCWOA21.5645 × 10−41.7877 × 10−4−1.2595 × 1041.3910 × 1020.0000 × 1000.0000 × 100
DECCWOA36.6910 × 10−59.9764 × 10−5−1.2619 × 1042.7031 × 1020.0000 × 1000.0000 × 100
DECCWOA41.0031 × 10−41.4658 × 10−4−1.2530 × 1045.3042 × 1020.0000 × 1000.0000 × 100
DECCWOA58.9743 × 10−51.0676 × 10−4−1.3512 × 1045.1597 × 1030.0000 × 1000.0000 × 100
DECCWOA65.2519 × 10−55.3764 × 10−5−1.2569 × 1041.9404 × 10−120.0000 × 1000.0000 × 100
DECCWOA76.4531 × 10−56.4938 × 10−5−1.3485 × 1042.8423 × 1030.0000 × 1000.0000 × 100
DECCWOA84.0419 × 10−55.3492 × 10−5−1.2805 × 1049.0308 × 1020.0000 × 1000.0000 × 100
DECCWOA96.3101 × 10−57.7305 × 10−5−1.2569 × 1042.0267 × 10−120.0000 × 1000.0000 × 100
DECCWOA103.8169 × 10−56.1534 × 10−5−1.2673 × 1042.7066 × 1020.0000 × 1000.0000 × 100
F10F11F12
a v g s t d a v g s t d a v g s t d
DECCWOA18.8818 × 10−160.0000 × 1000.0000 × 1000.0000 × 1001.5705 × 10−325.5674 × 10−48
DECCWOA28.8818 × 10−160.0000 × 1000.0000 × 1000.0000 × 1001.5705 × 10−325.5674 × 10−48
DECCWOA38.8818 × 10−160.0000 × 1000.0000 × 1000.0000 × 1001.5705 × 10−325.5674 × 10−48
DECCWOA48.8818 × 10−160.0000 × 1000.0000 × 1000.0000 × 1001.5705 × 10−325.5674 × 10−48
DECCWOA58.8818 × 10−160.0000 × 1000.0000 × 1000.0000 × 1001.5705 × 10−325.5674 × 10−48
DECCWOA68.8818 × 10−160.0000 × 1000.0000 × 1000.0000 × 1001.5705 × 10−325.5674 × 10−48
DECCWOA78.8818 × 10−160.0000 × 1000.0000 × 1000.0000 × 1001.5705 × 10−325.5674 × 10−48
DECCWOA88.8818 × 10−160.0000 × 1000.0000 × 1000.0000 × 1001.5705 × 10−325.5674 × 10−48
DECCWOA98.8818 × 10−160.0000 × 1000.0000 × 1000.0000 × 1001.5705 × 10−325.5674 × 10−48
DECCWOA108.8818 × 10−160.0000 × 1000.0000 × 1000.0000 × 1001.5705 × 10−325.5674 × 10−48
F13F14F15
a v g s t d a v g s t d a v g s t d
DECCWOA11.3498 × 10−325.5674 × 10−483.6810 × 1062.7334 × 1061.3342 × 1051.9982 × 105
DECCWOA21.3498 × 10−325.5674 × 10−485.1469 × 1063.7469 × 1062.2654 × 1053.0564 × 105
DECCWOA31.3498 × 10−325.5674 × 10−481.6507 × 1071.0130 × 1079.4042 × 1078.6776 × 107
DECCWOA41.3498 × 10−325.5674 × 10−487.2801 × 1065.0765 × 1068.7941 × 1067.2596 × 106
DECCWOA51.3498 × 10−325.5674 × 10−481.1619 × 1077.8606 × 1063.3924 × 1072.5699 × 107
DECCWOA61.3498 × 10−325.5674 × 10−481.2238 × 1078.2473 × 1067.4207 × 1075.2159 × 107
DECCWOA71.3498 × 10−325.5674 × 10−482.5408 × 1071.2932 × 1071.5504 × 1081.0836 × 108
DECCWOA81.3498 × 10−325.5674 × 10−482.9064 × 1071.2592 × 1073.1493 × 1083.1857 × 108
DECCWOA91.3498 × 10−325.5674 × 10−482.7983 × 1071.7994 × 1074.3963 × 1085.9410 × 108
DECCWOA101.3498 × 10−325.5674 × 10−484.0140 × 1072.8456 × 1076.8723 × 1087.6542 × 108
F16F17F18
a v g s t d a v g s t d a v g s t d
DECCWOA17.4819 × 1034.6257 × 1034.9577 × 1024.4816 × 1015.2004 × 1024.4169 × 10−2
DECCWOA25.3970 × 1035.6834 × 1035.2284 × 1024.4110 × 1015.2009 × 1024.7541 × 10−2
DECCWOA35.5074 × 1033.3963 × 1035.9759 × 1025.0184 × 1015.2036 × 1021.4114 × 10−1
DECCWOA44.7987 × 1034.0122 × 1035.5522 × 1025.6453 × 1015.2019 × 1029.2319 × 10−2
DECCWOA53.9879 × 1032.8027 × 1035.6621 × 1024.6593 × 1015.2029 × 1021.0546 × 10−1
DECCWOA64.7947 × 1033.8454 × 1036.0512 × 1023.7665 × 1015.2031 × 1021.4175 × 10−1
DECCWOA74.7025 × 1033.4303 × 1036.4612 × 1025.0034 × 1015.2039 × 1021.4396 × 10−1
DECCWOA85.7773 × 1033.8347 × 1036.9438 × 1029.0009 × 1015.2033 × 1021.7149 × 10−1
DECCWOA96.8194 × 1033.9312 × 1036.7202 × 1027.1887 × 1015.2035 × 1021.6351 × 10−1
DECCWOA107.6046 × 1032.9400 × 1036.9534 × 1027.7239 × 1015.2038 × 1021.7225 × 10−1
F19F20F21
a v g s t d a v g s t d a v g s t d
DECCWOA16.2052 × 1023.2852 × 1007.0040 × 1022.2886 × 10−18.0287 × 1021.0273 × 101
DECCWOA26.1946 × 1022.9290 × 1007.0052 × 1022.0981 × 10−18.1110 × 1022.0103 × 101
DECCWOA36.2495 × 1022.9171 × 1007.0250 × 1028.3283 × 10−18.7716 × 1021.8311 × 101
DECCWOA46.2184 × 1022.6694 × 1007.0111 × 1027.1368 × 10−28.2441 × 1027.7346 × 100
DECCWOA56.2371 × 1022.6632 × 1007.0164 × 1024.2137 × 10−18.4642 × 1021.7780 × 101
DECCWOA66.2456 × 1023.2157 × 1007.0230 × 1028.4958 × 10−18.7407 × 1022.4081 × 101
DECCWOA76.2621 × 1023.2713 × 1007.0300 × 1028.7250 × 10−18.9713 × 1021.9802 × 101
DECCWOA86.2840 × 1023.4007 × 1007.0506 × 1022.9144 × 1009.1581 × 1021.9967 × 101
DECCWOA96.2897 × 1023.4733 × 1007.0619 × 1022.5650 × 1009.2703 × 1022.5100 × 101
DECCWOA106.2933 × 1023.7025 × 1007.0753 × 1023.4438 × 1009.4279 × 1022.4986 × 101
F22F23F24
a v g s t d a v g s t d a v g s t d
DECCWOA11.0312 × 1032.7380 × 1011.0420 × 1031.1886 × 1023.9026 × 1036.5371 × 102
DECCWOA21.0377 × 1033.4427 × 1011.0510 × 1037.9342 × 1014.1202 × 1037.1968 × 102
DECCWOA31.0545 × 1033.3397 × 1011.7059 × 1033.0416 × 1025.3301 × 1034.9187 × 102
DECCWOA41.0420 × 1033.5382 × 1011.1956 × 1032.0676 × 1024.2088 × 1036.4091 × 102
DECCWOA51.0502 × 1032.9746 × 1011.4485 × 1034.7609 × 1024.9060 × 1037.5372 × 102
DECCWOA61.0708 × 1032.3208 × 1011.6654 × 1033.5966 × 1025.0839 × 1037.4254 × 102
DECCWOA71.0725 × 1032.9966 × 1012.4340 × 1033.6991 × 1025.5460 × 1036.9622 × 102
DECCWOA81.0867 × 1033.0093 × 1012.8661 × 1035.7401 × 1025.6002 × 1035.3783 × 102
DECCWOA91.0862 × 1032.9502 × 1013.4724 × 1036.7538 × 1025.6526 × 1037.8496 × 102
DECCWOA101.0860 × 1033.5118 × 1013.7201 × 1035.3438 × 1025.6708 × 1035.7142 × 102
F25F26F27
a v g s t d a v g s t d a v g s t d
DECCWOA11.2002 × 1036.7099 × 10−21.3005 × 1031.5439 × 10−11.4003 × 1034.8887 × 10−2
DECCWOA21.2002 × 1036.0385 × 10−21.3005 × 1031.1841 × 10−11.4003 × 1035.5441 × 10−2
DECCWOA31.2008 × 1032.9906 × 10−11.3005 × 1031.1364 × 10−11.4003 × 1034.0852 × 10−2
DECCWOA41.2004 × 1031.2088 × 10−11.3005 × 1031.3836 × 10−11.4003 × 1031.9112 × 10−1
DECCWOA51.2005 × 1031.9004 × 10−11.3005 × 1031.0714 × 10−11.4003 × 1035.7154 × 10−2
DECCWOA61.2008 × 1032.5696 × 10−11.3005 × 1039.5896 × 10−21.4003 × 1031.0255 × 10−1
DECCWOA71.2010 × 1033.2942 × 10−11.3005 × 1031.1984 × 10−11.4003 × 1031.7872 × 10−1
DECCWOA81.2011 × 1033.7909 × 10−11.3005 × 1031.3301 × 10−11.4004 × 1036.0314 × 10−1
DECCWOA91.2012 × 1033.9281 × 10−11.3006 × 1031.4510 × 10−11.4003 × 1035.1310 × 10−2
DECCWOA101.2014 × 1034.0093 × 10−11.3005 × 1031.1885 × 10−11.4004 × 1031.7136 × 10−1
F28F29F30
a v g s t d a v g s t d a v g s t d
DECCWOA11.5176 × 1036.4897 × 1001.6104 × 1036.8683 × 10−11.9247 × 1061.1101 × 106
DECCWOA21.5189 × 1037.4912 × 1001.6104 × 1037.6782 × 10−11.5103 × 1061.1011 × 106
DECCWOA31.5422 × 1031.3549 × 1011.6115 × 1036.7294 × 10−11.9418 × 1061.2814 × 106
DECCWOA41.5266 × 1036.5567 × 1001.6110 × 1036.9374 × 10−11.7005 × 1069.1883 × 105
DECCWOA51.5304 × 1039.0407 × 1001.6113 × 1036.2976 × 10−11.8482 × 1061.1135 × 106
DECCWOA61.5424 × 1031.2171 × 1011.6116 × 1035.9848 × 10−11.9396 × 1061.2724 × 106
DECCWOA71.6047 × 1032.9073 × 1021.6119 × 1036.5689 × 10−12.0687 × 1061.2220 × 106
DECCWOA81.5684 × 1033.2783 × 1011.6120 × 1034.3100 × 10−12.2597 × 1061.5545 × 106
DECCWOA91.5970 × 1034.5170 × 1011.6121 × 1036.1504 × 10−12.2349 × 1061.2776 × 106
DECCWOA101.6376 × 1039.5739 × 1011.6119 × 1037.4369 × 10−12.4610 × 1061.6436 × 106
F31F32F33
a v g s t d a v g s t d a v g s t d
DECCWOA15.8087 × 1036.2358 × 1031.9179 × 1032.6069 × 1011.4137 × 1047.6746 × 103
DECCWOA24.8867 × 1033.6023 × 1031.9189 × 1032.3237 × 1018.3832 × 1035.6464 × 103
DECCWOA34.0166 × 1032.5970 × 1031.9215 × 1032.4809 × 1015.5742 × 1032.6752 × 103
DECCWOA45.2173 × 1033.9350 × 1031.9267 × 1033.4926 × 1014.9997 × 1032.4000 × 103
DECCWOA54.9446 × 1034.1973 × 1031.9262 × 1032.9792 × 1014.5639 × 1032.0732 × 103
DECCWOA64.5409 × 1032.8935 × 1031.9239 × 1032.2044 × 1015.0427 × 1032.4608 × 103
DECCWOA74.7751 × 1032.8190 × 1031.9279 × 1032.2825 × 1014.5396 × 1031.8457 × 103
DECCWOA84.6894 × 1042.3224 × 1051.9358 × 1033.7797 × 1014.8777 × 1031.6024 × 103
DECCWOA97.0415 × 1039.3191 × 1031.9284 × 1032.5490 × 1014.5525 × 1032.1545 × 103
DECCWOA106.2462 × 1039.1482 × 1031.9295 × 1032.4829 × 1013.7338 × 1031.6768 × 103
Overall rankF34F35overall
a v g s t d a v g s t d +/−/=rank
DECCWOA18.6335 × 1056.2796 × 1052.8860 × 1032.2542 × 102~2
DECCWOA27.0965 × 1056.4048 × 1052.7590 × 1031.9713 × 1024/3/281
DECCWOA38.1850 × 1056.4237 × 1052.6856 × 1031.9951 × 10214/3/186
DECCWOA48.3727 × 1056.0484 × 1052.8021 × 1031.8728 × 10212/2/215
DECCWOA57.2517 × 1056.6623 × 1052.7406 × 1032.2485 × 10214/4/173
DECCWOA65.9730 × 1054.4486 × 1052.7219 × 1031.8356 × 10214/5/164
DECCWOA76.4163 × 1054.3900 × 1052.6995 × 1032.0571 × 10214/4/177
DECCWOA87.0675 × 1056.1652 × 1052.7178 × 1031.9634 × 10215/4/168
DECCWOA96.4914 × 1055.4887 × 1052.7793 × 1031.9480 × 10217/2/169
DECCWOA105.9732 × 1054.7600 × 1052.7603 × 1032.1609 × 10216/2/1710
Table A3. Comparison results for the introduced mechanisms.
Table A3. Comparison results for the introduced mechanisms.
F1F2F3
a v g s t d a v g s t d a v g s t d
DECCWOA0.0000 × 1000.0000 × 1000.0000 × 1000.0000 × 1004.1255 × 10−182.1806 × 10−17
DEWOA1.2420 × 10−103.9129 × 10−108.5083 × 10−61.4067 × 10−57.8264 × 1031.2145 × 104
CCWOA0.0000 × 1000.0000 × 1000.0000 × 1000.0000 × 1000.0000 × 1000.0000 × 100
WOA0.0000 × 1000.0000 × 1000.0000 × 1000.0000 × 1003.2071 × 1016.1783 × 101
F4F5F6
a v g s t d a v g s t d a v g s t d
DECCWOA0.0000 × 1000.0000 × 1002.5968 × 1013.5258 × 10−10.0000 × 1000.0000 × 100
DEWOA6.3178 × 10−31.5936 × 10−24.4319 × 10−34.7769 × 10−39.6180 × 10−51.2811 × 10−4
CCWOA0.0000 × 1000.0000 × 1002.2483 × 1016.1153 × 1001.1597 × 10−111.3565 × 10−11
WOA7.5414 × 1001.7526 × 1012.3562 × 1014.4675 × 1004.7799 × 10−61.8846 × 10−6
F7F8F9
a v g s t d a v g s t d a v g s t d
DECCWOA1.0328 × 10−41.7676 × 10−4−1.2783 × 1048.3042 × 1020.0000 × 1000.0000 × 100
DEWOA3.4741 × 10−35.8983 × 10−3−1.4406 × 1044.9552 × 1036.2111 × 10−108.6723 × 10−10
CCWOA1.7804 × 10−53.0937 × 10−5−1.2569 × 1045.6938 × 10−70.0000 × 1000.0000 × 100
WOA1.5818 × 10−41.8724 × 10−4−1.2236 × 1048.6401 × 1020.0000 × 1000.0000 × 100
F10F11F12
a v g s t d a v g s t d a v g s t d
DECCWOA8.8818 × 10−160.0000 × 1000.0000 × 1000.0000 × 1001.5705 × 10−325.5674 × 10−48
DEWOA4.8353 × 10−61.1226 × 10−56.9380 × 10−73.7853 × 10−67.0591 × 10−69.9086 × 10−6
CCWOA8.8818 × 10−160.0000 × 1000.0000 × 1000.0000 × 1001.6821 × 10−122.1310 × 10−12
WOA3.6119 × 10−151.7906 × 10−152.7668 × 10−41.5155 × 10−32.1111 × 10−41.1507 × 10−3
F13F14F15
a v g s t d a v g s t d a v g s t d
DECCWOA1.3498 × 10−325.5674 × 10−484.6009 × 1063.5694 × 1061.5068 × 1051.7046 × 105
DEWOA1.3742 × 10−42.1617 × 10−44.5118 × 1073.3352 × 1072.6842 × 1092.2525 × 109
CCWOA2.2806 × 10−112.1476 × 10−111.0815 × 1077.8011 × 1066.3006 × 1063.9908 × 106
WOA1.1255 × 10−33.3493 × 10−33.3488 × 1071.7699 × 1073.8002 × 1067.5915 × 106
F16F17F18
a v g s t d a v g s t d a v g s t d
DECCWOA6.2884 × 1034.0514 × 1034.9673 × 1023.4575 × 1015.2008 × 1025.6636 × 10−2
DEWOA3.6134 × 1043.3572 × 1048.0754 × 1021.5372 × 1025.2033 × 1022.2602 × 10−1
CCWOA5.8371 × 1033.4122 × 1035.3911 × 1025.8876 × 1015.2032 × 1028.7776 × 10−2
WOA3.6143 × 1042.3682 × 1045.8016 × 1025.5983 × 1015.2032 × 1021.6884 × 10−1
F19F20F21
a v g s t d a v g s t d a v g s t d
DECCWOA6.1813 × 1023.3345 × 1007.0050 × 1021.8285 × 10−18.0336 × 1025.5434 × 100
DEWOA6.4146 × 1022.3442 × 1007.1656 × 1021.1726 × 1019.7436 × 1022.7480 × 101
CCWOA6.2191 × 1023.1893 × 1007.0106 × 1021.1101 × 10−18.2734 × 1021.6890 × 101
WOA6.3521 × 1023.8342 × 1007.0102 × 1027.0807 × 10−29.8601 × 1023.9020 × 101
F22F23F24
a v g s t d a v g s t d a v g s t d
DECCWOA1.0398 × 1034.1688 × 1011.0459 × 1038.8217 × 1013.7945 × 1035.1310 × 102
DEWOA1.1215 × 1033.4240 × 1015.3843 × 1039.7624 × 1027.0285 × 1031.3163 × 103
CCWOA1.0486 × 1033.6153 × 1011.3579 × 1037.6567 × 1024.2859 × 1035.9815 × 102
WOA1.1285 × 1035.7638 × 1014.9219 × 1036.8542 × 1025.7481 × 1039.5752 × 102
DECCWOA1.0398 × 1034.1688 × 1011.0459 × 1038.8217 × 1013.7945 × 1035.1310 × 102
F25F26F27
a v g s t d a v g s t d a v g s t d
DECCWOA1.2002 × 1037.7530 × 10−21.3005 × 1031.0640 × 10−11.4003 × 1035.7690 × 10−2
DEWOA1.2026 × 1036.7176 × 10−11.3011 × 1038.8278 × 10−11.4032 × 1036.9794 × 100
CCWOA1.2007 × 1031.9439 × 10−11.3005 × 1031.0762 × 10−11.4003 × 1035.6885 × 10−2
WOA1.2017 × 1035.8032 × 10−11.3005 × 1031.4025 × 10−11.4003 × 1034.6882 × 10−2
F28F29F30
a v g s t d a v g s t d a v g s t d
DECCWOA1.5215 × 1037.2851 × 1001.6105 × 1035.6166 × 10−11.6567 × 1061.2704 × 106
DEWOA3.9455 × 1031.8290 × 1031.6129 × 1035.3817 × 10−15.2403 × 1063.8043 × 106
CCWOA1.5263 × 1037.8018 × 1001.6111 × 1035.3599 × 10−12.3769 × 1061.7422 × 106
WOA1.5710 × 1032.7076 × 1011.6124 × 1036.2114 × 10−13.8096 × 1063.0597 × 106
F31F32F33
a v g s t d a v g s t d a v g s t d
DECCWOA6.8401 × 1036.1595 × 1031.9156 × 1031.7561 × 1018.1086 × 1034.1891 × 103
DEWOA1.1805 × 1041.9283 × 1042.0808 × 1037.9264 × 1012.3551 × 1041.9203 × 104
CCWOA1.5061 × 1042.0280 × 1041.9305 × 1033.7604 × 1015.3268 × 1033.0310 × 103
WOA6.2265 × 1034.2908 × 1031.9415 × 1033.6716 × 1012.3634 × 1041.4518 × 104
Overall rankF34F35overall
a v g s t d a v g s t d +/−/=rank
DECCWOA7.8180 × 1056.8802 × 1052.8140 × 1032.4485 × 102~1
DEWOA1.1914 × 1061.0362 × 1063.3508 × 1033.5303 × 10231/1/34
CCWOA5.8255 × 1054.9559 × 1052.7967 × 1031.7716 × 10218/4/132
WOA1.3452 × 1061.6988 × 1063.0734 × 1032.6034 × 10225/1/93
Table A4. Comparison results for the DECCWOA with improved WOA versions.
Table A4. Comparison results for the DECCWOA with improved WOA versions.
F1F2F3
a v g s t d a v g s t d a v g s t d
DECCWOA0.0000 × 1000.0000 × 1000.0000 × 1000.0000 × 1002.7777 × 10−181.2942 × 10−17
RDWOA0.0000 × 1000.0000 × 1000.0000 × 1000.0000 × 1000.0000 × 1000.0000 × 100
ACWOA0.0000 × 1000.0000 × 1000.0000 × 1000.0000 × 1000.0000 × 1000.0000 × 100
CCMWOA0.0000 × 1000.0000 × 1004.7501 × 10−2860.0000 × 1000.0000 × 1000.0000 × 100
CWOA0.0000 × 1000.0000 × 1000.0000 × 1000.0000 × 1006.9438 × 1001.0312 × 101
BMWOA9.0723 × 10−41.2467 × 10−37.9729 × 10−37.3643 × 10−32.4579 × 10−17.2733 × 10−1
BWOA0.0000 × 1000.0000 × 1000.0000 × 1000.0000 × 1000.0000 × 1000.0000 × 100
LWOA4.9293 × 10−21.1696 × 10−21.0756 × 1001.8737 × 10−11.8394 × 1014.5449 × 100
IWOA0.0000 × 1000.0000 × 1000.0000 × 1000.0000 × 1008.8944 × 1011.3312 × 102
F4F5F6
a v g s t d a v g s t d a v g s t d
DECCWOA0.0000 × 1000.0000 × 1002.4313 × 1016.6194 × 1000.0000 × 1000.0000 × 100
RDWOA0.0000 × 1000.0000 × 1001.8882 × 1015.1359 × 1005.1469 × 10−153.2926 × 10−15
ACWOA0.0000 × 1000.0000 × 1002.4274 × 1014.5690 × 1006.3093 × 10−42.1127 × 10−4
CCMWOA4.3891 × 10−2890.0000 × 1002.7607 × 1007.6225 × 1002.0854 × 10−28.2250 × 10−3
CWOA8.4827 × 1001.6542 × 1012.5501 × 1011.5480 × 1001.0737 × 10−11.6796 × 10−1
BMWOA4.4563 × 10−36.7037 × 10−31.2474 × 10−23.0382 × 10−21.2974 × 10−31.8541 × 10−3
BWOA0.0000 × 1000.0000 × 1002.3788 × 1016.4677 × 1001.3716 × 10−45.6219 × 10−5
LWOA3.5964 × 10−19.6483 × 10−24.8931 × 1014.4527 × 1015.8005 × 10−21.4408 × 10−2
IWOA3.0373 × 10−41.4320 × 10−32.3521 × 1017.0061 × 10−13.5922 × 10−61.7322 × 10−6
F7F8F9
a v g s t d a v g s t d a v g s t d
DECCWOA1.7008 × 10−42.2308 × 10−4−1.2569 × 1042.8058 × 10−120.0000 × 1000.0000 × 100
RDWOA2.8442 × 10−53.6777 × 10−5−1.2521 × 1041.6733 × 1020.0000 × 1000.0000 × 100
ACWOA5.6623 × 10−65.7698 × 10−6−1.2569 × 1042.1881 × 10−30.0000 × 1000.0000 × 100
CCMWOA1.9668 × 10−41.6220 × 10−4−1.0928 × 1049.5870 × 1020.0000 × 1000.0000 × 100
CWOA3.1139 × 10−43.9744 × 10−4−1.1583 × 1041.6942 × 1030.0000 × 1000.0000 × 100
BMWOA1.0619 × 10−38.6629 × 10−4−1.2569 × 1042.9396 × 10−36.3549 × 10−41.1849 × 10−3
BWOA2.5018 × 10−53.0399 × 10−5−1.2357 × 1044.2512 × 1020.0000 × 1000.0000 × 100
LWOA1.2178 × 10−14.6795 × 10−2−1.2382 × 1044.4862 × 1021.0110 × 1022.6929 × 101
IWOA2.6929 × 10−43.2479 × 10−4−1.2298 × 1047.5775 × 1020.0000 × 1000.0000 × 100
F10F11F12
a v g s t d a v g s t d a v g s t d
DECCWOA8.8818 × 10−160.0000 × 1000.0000 × 1000.0000 × 1001.5705 × 10−325.5674 × 10−48
RDWOA8.8818 × 10−160.0000 × 1000.0000 × 1000.0000 × 1002.1668 × 10−71.1868 × 10−6
ACWOA1.0066 × 10−156.4863 × 10−160.0000 × 1000.0000 × 1006.7416 × 10−51.9647 × 10−5
CCMWOA8.8818 × 10−160.0000 × 1000.0000 × 1000.0000 × 1007.8157 × 10−43.6365 × 10−4
CWOA3.0198 × 10−152.0010 × 10−150.0000 × 1000.0000 × 1004.4206 × 10−36.6548 × 10−3
BMWOA5.1495 × 10−34.7013 × 10−32.1417 × 10−34.0514 × 10−31.5181 × 10−52.4654 × 10−5
BWOA8.8818 × 10−160.0000 × 1000.0000 × 1000.0000 × 1001.8415 × 10−56.4484 × 10−6
LWOA6.6177 × 10−16.9724 × 10−11.4973 × 10−21.3048 × 10−25.5931 × 10−11.1387 × 100
IWOA2.5461 × 10−152.0298 × 10−151.8892 × 10−31.0348 × 10−25.1354 × 10−71.4075 × 10−7
F13F14F15
a v g s t d a v g s t d a v g s t d
DECCWOA1.3498 × 10−325.5674 × 10−485.3971 × 1064.3864 × 1061.1568 × 1051.0038 × 105
RDWOA3.6625 × 10−42.0060 × 10−31.0435 × 1076.2580 × 1062.2927 × 1072.8097 × 107
ACWOA2.5808 × 10−34.6664 × 10−31.4456 × 1085.9824 × 1077.4176 × 1094.5829 × 109
CCMWOA6.6551 × 10−47.9798 × 10−43.1814 × 1081.2548 × 1083.0720 × 10107.7697 × 109
CWOA5.3049 × 10−14.3677 × 10−16.6829 × 1074.6037 × 1072.0499 × 1092.4020 × 109
BMWOA1.2733 × 10−42.2038 × 10−41.0438 × 1083.7729 × 1072.8151 × 1081.3106 × 108
BWOA3.3556 × 10−35.0182 × 10−36.4289 × 1072.9224 × 1072.4303 × 1081.3580 × 108
LWOA2.1065 × 10−27.2157 × 10−33.7558 × 1061.3953 × 1065.2308 × 1051.5679 × 105
IWOA9.8357 × 10−69.6866 × 10−62.4173 × 1071.2055 × 1072.1211 × 1063.5049 × 106
F16F17F18
a v g s t d a v g s t d a v g s t d
DECCWOA4.0353 × 1032.8694 × 1034.9768 × 1024.3913 × 1015.2008 × 1026.1713 × 10−2
RDWOA6.3763 × 1033.2741 × 1035.3428 × 1023.9426 × 1015.2012 × 1021.1564 × 10−1
ACWOA5.0442 × 1046.7503 × 1031.2586 × 1032.9833 × 1025.2085 × 1021.1588 × 10−1
CCMWOA5.9083 × 1049.2658 × 1032.7400 × 1031.0666 × 1035.2088 × 1021.7053 × 10−1
CWOA5.7234 × 1043.7392 × 1048.0857 × 1022.2460 × 1025.2029 × 1021.3417 × 10−1
BMWOA5.7008 × 1049.2535 × 1036.7153 × 1026.3683 × 1015.2097 × 1029.6222 × 10−2
BWOA3.2197 × 1041.0637 × 1046.9451 × 1027.2749 × 1015.2067 × 1021.7262 × 10−1
LWOA1.0354 × 1034.9837 × 1025.0374 × 1024.8236 × 1015.2048 × 1029.4869 × 10−2
IWOA1.6513 × 1049.7529 × 1035.7401 × 1026.2791 × 1015.2023 × 1021.3567 × 10−1
F19F20F21
a v g s t d a v g s t d a v g s t d
DECCWOA6.1886 × 1022.8176 × 1007.0051 × 1022.4043 × 10−18.0268 × 1022.9674 × 100
RDWOA6.2296 × 1023.2376 × 1007.0097 × 1022.3043 × 10−18.4662 × 1021.2443 × 101
ACWOA6.3380 × 1022.8192 × 1007.4705 × 1022.6949 × 1019.9173 × 1022.8423 × 101
CCMWOA6.3421 × 1023.1895 × 1009.1058 × 1026.8146 × 1011.0329 × 1032.5834 × 101
CWOA6.3619 × 1022.3328 × 1007.1987 × 1021.9833 × 1019.8919 × 1023.5017 × 101
BMWOA6.3209 × 1023.4550 × 1007.0298 × 1027.9463 × 10−19.6429 × 1022.2995 × 101
BWOA6.3659 × 1022.7733 × 1007.0210 × 1024.7824 × 10−19.6653 × 1022.0133 × 101
LWOA6.2990 × 1023.7057 × 1007.0071 × 1021.0660 × 10−18.7689 × 1021.4956 × 101
IWOA6.2837 × 1023.5182 × 1007.0086 × 1021.8091 × 10−19.1853 × 1022.3903 × 101
F22F23F24
a v g s t d a v g s t d a v g s t d
DECCWOA1.0349 × 1033.5053 × 1011.0502 × 1037.2638 × 1013.9773 × 1035.2239 × 102
RDWOA1.0862 × 1033.9406 × 1011.6401 × 1032.1508 × 1024.8765 × 1034.8011 × 102
ACWOA1.1353 × 1032.7084 × 1014.6113 × 1037.8646 × 1026.0951 × 1038.4619 × 102
CCMWOA1.1585 × 1032.0571 × 1015.7676 × 1034.6957 × 1027.0634 × 1038.3597 × 102
CWOA1.1502 × 1035.9550 × 1015.0935 × 1038.0866 × 1026.4607 × 1038.0167 × 102
BMWOA1.1247 × 1033.0558 × 1014.7543 × 1037.0975 × 1027.1260 × 1039.0188 × 102
BWOA1.1033 × 1032.3404 × 1014.8599 × 1037.9435 × 1026.5557 × 1031.0588 × 103
LWOA1.1231 × 1034.1332 × 1012.1055 × 1035.0404 × 1025.3203 × 1035.2375 × 102
IWOA1.1290 × 1035.0219 × 1012.6021 × 1034.6117 × 1025.5791 × 1037.2655 × 102
F25F26F27
a v g s t d a v g s t d a v g s t d
DECCWOA1.2002 × 1035.1670 × 10−21.3005 × 1031.1585 × 10−11.4003 × 1034.7444 × 10−2
RDWOA1.2005 × 1031.8157 × 10−11.3005 × 1031.0242 × 10−11.4002 × 1033.7231 × 10−2
ACWOA1.2017 × 1035.3455 × 10−11.3011 × 1038.3617 × 10−11.4239 × 1031.2976 × 101
CCMWOA1.2018 × 1034.5129 × 10−11.3041 × 1038.3728 × 10−11.4661 × 1031.6380 × 101
CWOA1.2018 × 1035.2022 × 10−11.3006 × 1031.2049 × 10−11.4102 × 1031.2849 × 101
BMWOA1.2023 × 1034.1490 × 10−11.3005 × 1031.1904 × 10−11.4003 × 1031.0699 × 10−1
BWOA1.2019 × 1034.8775 × 10−11.3005 × 1031.3303 × 10−11.4003 × 1034.2027 × 10−2
LWOA1.2008 × 1033.0020 × 10−11.3005 × 1031.1102 × 10−11.4003 × 1039.9959 × 10−2
IWOA1.2010 × 1032.9781 × 10−11.3005 × 1039.8276 × 10−21.4003 × 1035.2298 × 10−2
F28F29F30
a v g s t d a v g s t d a v g s t d
DECCWOA1.5195 × 1035.8976 × 1001.6103 × 1037.8355 × 10−11.4951 × 1061.0794 × 106
RDWOA1.5215 × 1037.2912 × 1001.6116 × 1035.9134 × 10−11.1935 × 1061.0797 × 106
ACWOA1.8396 × 1034.0931 × 1021.6121 × 1034.8464 × 10−11.3124 × 1078.0308 × 106
CCMWOA7.0062 × 1034.0693 × 1031.6130 × 1033.2081 × 10−12.6816 × 1071.9260 × 107
CWOA1.9731 × 1038.2350 × 1021.6127 × 1035.6484 × 10−19.8463 × 1068.8774 × 106
BMWOA1.5828 × 1033.6612 × 1011.6126 × 1032.1626 × 10−16.9174 × 1064.9113 × 106
BWOA1.6258 × 1034.8685 × 1011.6124 × 1034.8342 × 10−17.5640 × 1065.4938 × 106
LWOA1.5213 × 1034.9669 × 1001.6125 × 1035.6375 × 10−14.9220 × 1052.9566 × 105
IWOA1.5506 × 1031.6210 × 1011.6125 × 1035.1867 × 10−12.7873 × 1062.0454 × 106
F31F32F33
a v g s t d a v g s t d a v g s t d
DECCWOA9.2541 × 1032.1036 × 1041.9198 × 1032.4744 × 1018.8237 × 1035.3819 × 103
RDWOA4.8557 × 1033.4855 × 1031.9194 × 1032.6942 × 1016.7743 × 1033.5180 × 103
ACWOA4.4984 × 1074.3109 × 1072.0047 × 1033.3162 × 1013.7129 × 1041.9130 × 104
CCMWOA9.8440 × 1071.2615 × 1082.0824 × 1035.0281 × 1015.7205 × 1042.2855 × 104
CWOA3.9424 × 1061.2057 × 1072.0018 × 1036.3131 × 1015.7907 × 1045.9437 × 104
BMWOA1.1037 × 1051.2099 × 1051.9467 × 1034.0178 × 1013.3436 × 1041.7890 × 104
BWOA1.1889 × 1053.5142 × 1051.9593 × 1033.8145 × 1013.2143 × 1041.6907 × 104
LWOA1.0695 × 1045.9845 × 1031.9230 × 1032.4187 × 1013.0576 × 1037.5160 × 102
IWOA5.4855 × 1034.2910 × 1031.9348 × 1033.5960 × 1011.6411 × 1041.0072 × 104
Overall rankF34F35overall
a v g s t d a v g s t d +/−/=rank
DECCWOA1.0426 × 1068.4796 × 1052.8721 × 1032.1610 × 102~1
RDWOA4.2175 × 1053.3446 × 1052.7874 × 1032.1665 × 10216/6/132
ACWOA4.2559 × 1063.6243 × 1063.0278 × 1032.2024 × 10226/3/66
CCMWOA8.7004 × 1065.9791 × 1063.2984 × 1034.4928 × 10228/2/59
CWOA3.1633 × 1062.9730 × 1063.1092 × 1032.3259 × 10229/0/68
BMWOA1.0736 × 1069.0915 × 1053.0014 × 1032.7107 × 10232/1/27
BWOA1.9551 × 1061.5899 × 1062.9774 × 1032.8735 × 10223/3/94
LWOA2.0517 × 1051.6837 × 1052.9007 × 1032.4887 × 10226/4/55
IWOA9.3081 × 1057.7249 × 1052.9329 × 1031.7696 × 10224/1/103
Table A5. Comparison results for the DECCWOA with advanced algorithms.
Table A5. Comparison results for the DECCWOA with advanced algorithms.
F1F2F3
a v g s t d a v g s t d a v g s t d
DECCWOA0.0000 × 1000.0000 × 1000.0000 × 1000.0000 × 1001.0221 × 10−184.2975 × 10−18
IGWO0.0000 × 1000.0000 × 1003.6328 × 10−2610.0000 × 1001.3124 × 10−867.1881 × 10−86
OBLGWO0.0000 × 1000.0000 × 1003.6589 × 10−1422.004 × 10−1416.2014 × 10−2930.0000 × 100
CGPSO2.3583 × 10−87.7088 × 10−83.9726 × 10−52.8781 × 10−56.3491 × 10−25.1833 × 10−2
ALPSO1.1539 × 10−1840.0000 × 1002.5959 × 10−87.1555 × 10−82.2102 × 10−112.9723 × 10−11
RCBA8.9446 × 10−32.9769 × 10−35.8765 × 10−18.4909 × 10−22.1948 × 1005.2552 × 10−1
CBA7.2954 × 10−83.8213 × 10−74.1161 × 1011.3912 × 1021.3118 × 1016.5496 × 100
OBSCA1.0911 × 10−1035.5402 × 10−1034.3833 × 10−911.1161 × 10−903.1617 × 10−241.1702 × 10−23
SCADE0.0000 × 1000.0000 × 1000.0000 × 1000.0000 × 1000.0000 × 1000.0000 × 100
F4F5F6
a v g s t d a v g s t d a v g s t d
DECCWOA1.0221 × 10−184.2975 × 10−182.6083 × 1013.1418 × 10−10.0000 × 1000.0000 × 100
IGWO1.3124 × 10−867.1881 × 10−862.3216 × 1011.8144 × 10−11.2448 × 10−53.5159 × 10−6
OBLGWO6.2014 × 10−2930.0000 × 1002.6052 × 1013.8656 × 10−13.9085 × 10−51.4498 × 10−5
CGPSO6.3491 × 10−25.1833 × 10−21.0747 × 10−71.4040 × 10−71.5149 × 10−82.7356 × 10−8
ALPSO2.2102 × 10−112.9723 × 10−113.5496 × 1013.2473 × 1015.9288 × 10−312.2626 × 10−30
RCBA2.1948 × 1005.2552 × 10−13.6041 × 1014.0444 × 1018.7533 × 10−32.4284 × 10−3
CBA1.3118 × 1016.5496 × 1007.3423 × 1011.2319 × 1024.4526 × 10−72.4194 × 10−6
OBSCA3.1617 × 10−241.1702 × 10−232.7647 × 1013.8007 × 10−13.8321 × 1002.7513 × 10−1
SCADE0.0000 × 1000.0000 × 1001.5398 × 1011.3017 × 1011.7996 × 10−71.6508 × 10−7
F7F8F9
a v g s t d a v g s t d a v g s t d
DECCWOA1.1896 × 10−41.4262 × 10−4−1.3066 × 1042.6313 × 1030.0000 × 1000.0000 × 100
IGWO2.9290 × 10−42.6976 × 10−4−7.4319 × 1036.6317 × 1020.0000 × 1000.0000 × 100
OBLGWO2.4381 × 10−52.9727 × 10−5−1.2561 × 1044.4545 × 1010.0000 × 1000.0000 × 100
CGPSO1.4906 × 10−51.4183 × 10−5−3.7698 × 1046.6756 × 1033.0143 × 10−96.2053 × 10−9
ALPSO7.8389 × 10−23.1754 × 10−2−1.1531 × 1042.8700 × 1021.9471 × 1017.9710 × 100
RCBA1.1712 × 10−15.5739 × 10−2−7.3244 × 1035.4651 × 1022.0111 × 1014.6024 × 100
CBA1.5885 × 10−13.4560 × 10−1−7.3445 × 1036.5505 × 1021.2498 × 1024.7753 × 101
OBSCA8.1175 × 10−45.3137 × 10−4−4.1274 × 1032.4305 × 1020.0000 × 1000.0000 × 100
SCADE2.9509 × 10−42.0997 × 10−4−1.2569 × 1041.1550 × 10−20.0000 × 1000.0000 × 100
F10F11F12
a v g s t d a v g s t d a v g s t d
DECCWOA8.8818 × 10−160.0000 × 1000.0000 × 1000.0000 × 1001.5705 × 10−325.5674 × 10−48
IGWO4.9146 × 10−151.2283 × 10−150.0000 × 1000.0000 × 1001.1169 × 10−63.8305 × 10−7
OBLGWO8.8818 × 10−160.0000 × 1000.0000 × 1000.0000 × 1003.8858 × 10−41.1452 × 10−3
CGPSO1.8069 × 10−51.2953 × 10−54.3701 × 10−87.1267 × 10−86.2743 × 10−111.4249 × 10−10
ALPSO8.0156 × 10−18.3429 × 10−11.6465 × 10−21.5344 × 10−23.0222 × 10−28.1300 × 10−2
RCBA1.0853 × 10−12.7602 × 10−21.0473 × 10−21.0208 × 10−29.1885 × 1002.8806 × 100
CBA1.5880 × 1012.1141 × 1001.3514 × 10−21.8331 × 10−21.4396 × 1014.7131 × 100
OBSCA4.3225 × 10−156.4863 × 10−160.0000 × 1000.0000 × 1003.8964 × 10−14.5185 × 10−2
SCADE8.8818 × 10−160.0000 × 1000.0000 × 1000.0000 × 1005.6904 × 10−94.8080 × 10−9
F13F14F15
a v g s t d a v g s t d a v g s t d
DECCWOA1.3498 × 10−325.5674 × 10−484.2212 × 1063.5710 × 1061.6057 × 1051.7381 × 105
IGWO1.4838 × 10−22.6985 × 10−21.7924 × 1076.8885 × 1062.3989 × 1061.4218 × 106
OBLGWO5.7997 × 10−27.7859 × 10−21.7531 × 1071.0402 × 1071.3307 × 1071.0251 × 107
CGPSO3.1353 × 10−99.6561 × 10−99.8321 × 1062.5274 × 1061.5880 × 1081.6828 × 107
ALPSO2.8346 × 10−29.8785 × 10−25.7145 × 1065.4783 × 1062.9466 × 1033.6264 × 103
RCBA5.1201 × 10−34.6593 × 10−31.0422 × 1063.8825 × 1052.5206 × 1041.0389 × 104
CBA3.1616 × 1012.6961 × 1014.7886 × 1061.8780 × 1061.2467 × 1041.0840 × 104
OBSCA2.1646 × 1001.1588 × 10−13.9908 × 1081.1211 × 1082.4969 × 10103.6691 × 109
SCADE8.3767 × 10−86.6478 × 10−84.7479 × 1089.8759 × 1072.9269 × 10104.2012 × 109
F16F17F18
a v g s t d a v g s t d a v g s t d
DECCWOA7.8122 × 1035.4762 × 1035.1647 × 1024.8965 × 1015.2007 × 1025.1181 × 10−2
IGWO7.2399 × 1032.0340 × 1035.2142 × 1023.0682 × 1015.2050 × 1021.4090 × 10−1
OBLGWO1.0074 × 1043.8144 × 1035.4284 × 1023.5930 × 1015.2095 × 1025.4001 × 10−2
CGPSO2.3365 × 1035.0383 × 1024.6884 × 1023.1903 × 1015.2098 × 1024.2868 × 10−2
ALPSO3.7450 × 1021.3166 × 1025.4221 × 1025.6842 × 1015.2080 × 1025.8119 × 10−2
RCBA3.2947 × 1021.2959 × 1014.7036 × 1023.7390 × 1015.2010 × 1029.5615 × 10−2
CBA4.7703 × 1039.2720 × 1034.9781 × 1024.4714 × 1015.2009 × 1021.3697 × 10−1
OBSCA5.3939 × 1046.9272 × 1032.2087 × 1035.3362 × 1025.2096 × 1025.8056 × 10−2
SCADE5.4785 × 1046.7546 × 1032.2800 × 1034.7955 × 1025.2094 × 1025.3187 × 10−2
F19F20F21
a v g s t d a v g s t d a v g s t d
DECCWOA6.1885 × 1022.4155 × 1007.0061 × 1023.1716 × 10−18.0279 × 1028.0509 × 100
IGWO6.1887 × 1022.6487 × 1007.0099 × 1025.1420 × 10−28.8181 × 1021.6752 × 101
OBLGWO6.1968 × 1024.3347 × 1007.0117 × 1029.6122 × 10−29.2963 × 1023.9241 × 101
CGPSO6.2402 × 1022.9481 × 1007.0241 × 1022.0187 × 10−19.8743 × 1022.5413 × 101
ALPSO6.1705 × 1022.4439 × 1007.0001 × 1028.9890 × 10−38.2142 × 1029.5753 × 100
RCBA6.3882 × 1023.5284 × 1007.0007 × 1021.8671 × 10−21.0209 × 1033.9995 × 101
CBA6.4033 × 1022.8154 × 1007.0003 × 1023.4856 × 10−21.0228 × 1036.1207 × 101
OBSCA6.3161 × 1021.3106 × 1009.0597 × 1023.6858 × 1011.0643 × 1031.7737 × 101
SCADE6.3355 × 1022.2424 × 1008.9018 × 1023.3322 × 1011.0695 × 1031.2949 × 101
F22F23F24
a v g s t d a v g s t d a v g s t d
DECCWOA1.0366 × 1033.6638 × 1011.0472 × 1035.2652 × 1013.6010 × 1034.5441 × 102
IGWO1.0087 × 1031.9673 × 1013.3271 × 1034.7812 × 1024.6073 × 1037.5057 × 102
OBLGWO1.0661 × 1034.0353 × 1014.0667 × 1031.0107 × 1035.5480 × 1031.0343 × 103
CGPSO1.1225 × 1032.5722 × 1015.5982 × 1035.0945 × 1026.0825 × 1035.5185 × 102
ALPSO1.0021 × 1032.9422 × 1011.6121 × 1033.2630 × 1024.0735 × 1035.3691 × 102
RCBA1.1638 × 1036.3597 × 1015.6153 × 1036.4055 × 1025.8506 × 1038.1461 × 102
CBA1.1526 × 1037.2911 × 1015.7931 × 1037.2017 × 1025.9590 × 1037.1736 × 102
OBSCA1.1929 × 1031.5671 × 1016.1341 × 1033.2876 × 1027.2777 × 1034.0271 × 102
SCADE1.2049 × 1031.8580 × 1017.4883 × 1032.3162 × 1028.2006 × 1032.9486 × 102
F25F26F27
a v g s t d a v g s t d a v g s t d
DECCWOA1.2002 × 1037.1972 × 10−21.3005 × 1031.4836 × 10−11.4003 × 1034.2207 × 10−2
IGWO1.2008 × 1033.5285 × 10−11.3006 × 1031.2395 × 10−11.4004 × 1032.5832 × 10−1
OBLGWO1.2023 × 1036.8209 × 10−11.3005 × 1031.1878 × 10−11.4005 × 1032.3451 × 10−1
CGPSO1.2025 × 1032.0362 × 10−11.3004 × 1031.0032 × 10−11.4003 × 1031.2353 × 10−1
ALPSO1.2013 × 1035.4330 × 10−11.3005 × 1037.9368 × 10−21.4006 × 1032.8021 × 10−1
RCBA1.2006 × 1033.7833 × 10−11.3005 × 1031.3700 × 10−11.4003 × 1039.7996 × 10−2
CBA1.2011 × 1037.3537 × 10−11.3005 × 1031.4823 × 10−11.4003 × 1031.5708 × 10−1
OBSCA1.2023 × 1034.4892 × 10−11.3036 × 1032.6704 × 10−11.4695 × 1031.1814 × 101
SCADE1.2026 × 1032.4794 × 10−11.3039 × 1032.9836 × 10−11.4881 × 1031.3091 × 101
F28F29F30
a v g s t d a v g s t d a v g s t d
DECCWOA1.5202 × 1036.6341 × 1001.6102 × 1037.9146 × 10−11.8690 × 1061.1246 × 106
IGWO1.5176 × 1033.7863 × 1001.6116 × 1035.8466 × 10−19.2251 × 1055.5675 × 105
OBLGWO1.5150 × 1035.7646 × 1001.6120 × 1036.3233 × 10−11.3955 × 1061.0330 × 106
CGPSO1.5176 × 1031.3084 × 1001.6117 × 1033.2922 × 10−13.3985 × 1051.7015 × 105
ALPSO1.5115 × 1034.1448 × 1001.6118 × 1033.2864 × 10−15.5179 × 1054.6710 × 105
RCBA1.5371 × 1039.0984 × 1001.6135 × 1033.4738 × 10−11.2165 × 1057.5279 × 104
CBA1.5589 × 1031.7899 × 1011.6133 × 1035.2338 × 10−11.8619 × 1051.2340 × 105
OBSCA1.4085 × 1048.8848 × 1031.6129 × 1032.5975 × 10−11.1278 × 1075.7586 × 106
SCADE1.8666 × 1046.8024 × 1031.6127 × 1031.7040 × 10−11.5787 × 1078.3755 × 106
F31F32F33
a v g s t d a v g s t d a v g s t d
DECCWOA4.3650 × 1033.0442 × 1031.9120 × 1031.2480 × 1017.8097 × 1034.1959 × 103
IGWO1.7080 × 1042.1685 × 1041.9180 × 1031.4497 × 1013.0438 × 1036.5561 × 102
OBLGWO8.3234 × 1041.7925 × 1051.9215 × 1032.3356 × 1015.5656 × 1032.6114 × 103
CGPSO2.4871 × 1067.6618 × 1051.9170 × 1032.9535 × 1002.4762 × 1031.6062 × 102
ALPSO7.8595 × 1037.3812 × 1031.9170 × 1032.0884 × 1013.0087 × 1034.2177 × 102
RCBA6.9919 × 1037.0401 × 1031.9292 × 1032.9262 × 1012.4379 × 1031.3813 × 102
CBA9.7529 × 1039.7686 × 1031.9246 × 1032.6288 × 1012.9663 × 1031.2059 × 103
OBSCA1.5585 × 1081.0228 × 1082.0091 × 1031.5224 × 1013.1925 × 1041.3827 × 104
SCADE1.9277 × 1089.7379 × 1072.0133 × 1031.3639 × 1012.7694 × 1041.1641 × 104
Overall rankF34F35overall
a v g s t d a v g s t d +/−/=rank
DECCWOA5.6266 × 1055.3759 × 1052.8005 × 1032.0373 × 102~1
IGWO2.5893 × 1052.2750 × 1052.5846 × 1031.4319 × 10220/8/72
OBLGWO5.1886 × 1053.8300 × 1052.6930 × 1031.9962 × 10219/5/115
CGPSO1.2464 × 1056.8764 × 1042.9020 × 1032.0995 × 10223/9/34
ALPSO1.1929 × 1052.9474 × 1052.7316 × 1032.0662 × 10219/9/73
RCBA8.3440 × 1043.8322 × 1043.3862 × 1033.5129 × 10223/9/36
CBA1.2013 × 1057.8959 × 1043.4067 × 1032.6854 × 10224/6/57
OBSCA1.9523 × 1069.0846 × 1053.1622 × 1031.4760 × 10232/1/29
SCADE2.4532 × 1061.2033 × 1063.1167 × 1031.2839 × 10228/2/57
Table A6. Description of each attribute for the talent stability data.
Table A6. Description of each attribute for the talent stability data.
AttributesNameDescription
F1Sex1 for male and 2 for female.
F2Political affiliationThere are five categories: Communist Party members, reserve party members, democratic party members, Communist Youth League members and the masses, denoted by 1, 2, 3, 4 and 13, respectively.
F3Professional attributes1 indicates arts, 2 indicates science and 3 indicates less than junior college (junior college not divided into arts and science subjects)
F4AgeAges 25–30, 31–35, 36–40, 41–45, 46–50, 51–55 and 56–60 are indicated by 1, 2, 3, 4, 5, 6 and 7, respectively. Young and middle-aged people have a strong level of competence and a strong tendency to move because of upward mobility, life pressures, etc.
F5Household RegistrationThere are three categories: in-city, in-province and out-of-province, indicated by 0, 1 and 2, respectively.
F6Type of place of originThere are three categories: urban, township and rural, denoted by 1, 2 and 3, respectively.
F7City-level and above talent categoriesThere are categories A, B, C, D and E, denoted by 1, 2, 3, 4 and 5, respectively. 6 is for talent category F and no talent category is denoted by 10.
F8Nature of previous unit0 indicating pending employment, 10 indicating state institutions, 20 indicating scientific research institutions, 21 indicating higher education institutions, 22 indicating secondary and junior education institutions, 23 indicating health and medical institutions, 29 indicating other institutions, 31 indicating state-owned enterprises, 32 indicating foreign-funded enterprises, 39 indicating private enterprises, 40 indicating the army, 55 indicating rural organizations, and 99 indicating self-employment. No previous unit is denoted by 100.
F9Wenzhou colleges and university’s location typePrefectural level cities, denoted by 2.
F10Year of employment at Wenzhou colleges and universitiesThis is a measure of stability in the unit of employment. 1 is used for entry before 2000 (merger), 2 for entry from 2001–2006 (preparation), 3 for entry from 2007–2008 (de-preparation), 4 for entry from 2009–2014 (school introduction policy), 5 for entry from 2015–2017 (city introduction policy) and 6 for entry from 2018. To date (increased introduction by the school) entry is indicated by 6. (It can also be described in terms of stable years 3, 4–6, 7–10, 11+ years).
F11Types of positions at Wenzhou colleges and universitiesTeaching staff are represented by 24, PhD students and research staff by 11, professional and technical staff by 29, administrative staff by 101 and counsellors by 102.
F12Professional relevance of employment at Wenzhou colleges and universitiesIt is used to measure the relevance of the major studied to the job, with higher percentages indicating higher relevance.
F13Monthly salary level for employment at Wenzhou colleges and universities: RMBIt is used to measure the average monthly salary received, with higher values indicating higher salary levels.
F14Current employmentCurrent employment is indicated by 1 for Wenzhou undergraduate institutions; 2 for civil servants or institutions; 3 for undergraduate institutions (including doctoral studies); 4 for vocational institutions in other cities; 5 for vocational institutions in the city, 6 for enterprises, 7 for going abroad and 8 for pending employment.
F15Time of introduction at current employmentIndicated by 1 for entry before 2000 (merger), 2 for entry from 2001–2006 (preparation), 3 for entry from 2007–2008 (de-preparation), 4 for entry from 2009–2014 (school introduction policy), 5 for entry from 2015–2017 (city introduction policy) and 6 for entry from 2018-present (increased school introduction).
F16Nature of current employment0 indicating pending employment, 10 indicating state institutions, 20 indicating scientific research institutions, 21 indicating higher education institutions, 22 indicating secondary and junior education institutions, 23 indicating health and medical institutions, 29 indicating other institutions, 31 indicating state-owned enterprises, 32 indicating foreign-funded enterprises, 39 indicating private enterprises, 40 indicating the army, 55 indicating rural organizations and 99 indicating self-employment.
F17Type of location of current employment unitPending employment is represented by 0, sub-provincial and large cities by 1, prefecture-level cities by 2 and counties and villages by 3.
F18Type of current employmentThe type of position currently employed is expressed in the same way as the type of position in the previous employment unit indicated in F11. Pending employment is indicated by 0, civil servants by 10, doctoral students and researchers by 11, engineers and technicians by 13, teaching staff by 24, professional and technical staff by 29, commercial service staff and clerks by 30, military personnel by 80, administrative staff by 101 and counsellors by 102.
F19Relevance of current employment professionThe professional relevance of current employment is expressed in the same way as the type of position in the previous employment unit indicated by F11.
F20Monthly salary level in current employment unit: RMBThe current employment monthly salary level is expressed in the same way as the previous employment monthly salary level in F13.
F21Salary differentialIt is used to measure the change in the monthly salary of the current employment unit from that of the previous employment unit, that is, the difference between the monthly salary level of the current employment unit expressed in F21 and the monthly salary level of the previous employment unit expressed in F13, with a larger value indicating a larger increase in monthly salary.
F22Professional and technical position at the time of leavingPositive senior, deputy senior, intermediate, primary and none are represented by 1, 2, 3, 4, and 5, respectively.
F23Double first-rate1 means double first-rate, 2 means not.
F24Highest EducationCollege, university and postgraduate are denoted by 0, 1 and 2, respectively. Below junior college, it is denoted by 5.
F25Highest degreesTertiary, bachelor, master and doctoral degrees are denoted by 0, 1, 2 and 3, respectively. Below the tertiary level, they are denoted by 5.
F26Change in place of employmentA variation is indicated by 1 and no variation is indicated by 0.

References

  1. Yang, J. The Theory of Planned Behavior and Prediction of Entrepreneurial Intention Among Chinese Undergraduates. Soc. Behav. Pers. Int. J. 2013, 41, 367–376. [Google Scholar] [CrossRef]
  2. González-Serrano, M.H.; Moreno, F.C.; Hervás, J.C. Prediction model of the entrepreneurial intentions in pre-graduated and post-graduated Sport Sciences students. Cult. Cienc. Y Deporte 2018, 13, 219–230. [Google Scholar] [CrossRef]
  3. Gorgievski, M.J.; Stephan, U.; Laguna, M.; Moriano, J.A. Predicting Entrepreneurial Career Intentions: Values and the theory of planned behavior. J. Career Assess. 2018, 26, 457–475. [Google Scholar] [CrossRef] [PubMed]
  4. Nawaz, T.; Khattak, B.K.; Rehman, K. New look of predicting entrepreneurial intention: A serial mediation analysis. Dilemas Contemp. Educ. Polit. Y Valor. 2019, 6, 126. [Google Scholar]
  5. Yang, F. Decision Tree Algorithm Based University Graduate Employment Trend Prediction. Informatica 2019, 43. [Google Scholar] [CrossRef] [Green Version]
  6. Djordjevic, D.; Cockalo, D.; Bogetic, S.; Bakator, M. Predicting Entrepreneurial Intentions among the Youth in Serbia with a Classification Decision Tree Model with the QUEST Algorithm. Mathematics 2021, 9, 1487. [Google Scholar] [CrossRef]
  7. Wei, Y.; Lv, H.; Chen, M.; Wang, M.; Heidari, A.A.; Chen, H.; Li, C. Predicting Entrepreneurial Intention of Students: An Extreme Learning Machine with Gaussian Barebone Harris Hawks Optimizer. IEEE Access 2020, 8, 76841–76855. [Google Scholar] [CrossRef]
  8. Bhagavan, K.S.; Thangakumar, J.; Subramanian, D.V. RETRACTED ARTICLE: Predictive analysis of student academic performance and employability chances using HLVQ algorithm. J. Ambient. Intell. Humaniz. Comput. 2020, 12, 3789–3797. [Google Scholar] [CrossRef]
  9. Huang, Z.; Liu, G. Prediction model of college students entrepreneurship ability based on artificial intelligence and fuzzy logic model. J. Intell. Fuzzy Syst. 2021, 40, 2541–2552. [Google Scholar] [CrossRef]
  10. Li, X.; Yang, T. Forecast of the Employment Situation of College Graduates Based on the LSTM Neural Network. Comput. Intell. Neurosci. 2021, 2021, 5787355. [Google Scholar] [CrossRef]
  11. Mirjalili, S.; Lewis, A. The Whale Optimization Algorithm. Adv. Eng. Softw. 2016, 95, 51–67. [Google Scholar] [CrossRef]
  12. Li, J.; Guo, L.; Li, Y.; Liu, C.; Wang, L.; Hu, H. Enhancing Whale Optimization Algorithm with Chaotic Theory for Permutation Flow Shop Scheduling Problem. Int. J. Comput. Intell. Syst. 2021, 14, 651–675. [Google Scholar] [CrossRef]
  13. Luan, F.; Cai, Z.; Wu, S.; Jiang, T.; Li, F.; Yang, J. Improved Whale Algorithm for Solving the Flexible Job Shop Scheduling Problem. Mathematics 2019, 7, 384. [Google Scholar] [CrossRef] [Green Version]
  14. Navarro, M.A.; Oliva, D.; Ramos-Michel, A.; Zaldívar, D.; Morales-Castañeda, B.; Pérez-Cisneros, M.; Valdivia, A.; Chen, H. An improved multi-population whale optimization algorithm. Int. J. Mach. Learn. Cybern. 2022, 13, 2447–2478. [Google Scholar] [CrossRef]
  15. Abbas, S.; Jalil, Z.; Javed, A.R.; Batool, I.; Khan, M.Z.; Noorwali, A.; Gadekallu, T.R.; Akbar, A. BCD-WERT: A novel approach for breast cancer detection using whale optimization based efficient features and extremely randomized tree algorithm. PeerJ Comput. Sci. 2021, 7, e390. [Google Scholar] [CrossRef]
  16. Elaziz, M.A.; Nabil, N.; Moghdani, R.; Ewees, A.A.; Cuevas, E.; Lu, S. Multilevel thresholding image segmentation based on improved volleyball premier league algorithm using whale optimization algorithm. Multimed. Tools Appl. 2021, 80, 12435–12468. [Google Scholar] [CrossRef]
  17. Abdel-Basset, M.; El-Shahat, D.; El-Henawy, I. A modified hybrid whale optimization algorithm for the scheduling problem in multimedia data objects. Concurr. Comput. Pr. Exp. 2020, 32, e5137. [Google Scholar] [CrossRef]
  18. Qiao, S.; Yu, H.; Heidari, A.A.; El-Saleh, A.A.; Cai, Z.; Xu, X.; Mafarja, M.; Chen, H. Individual disturbance and neighborhood mutation search enhanced whale optimization: Performance design for engineering problems. J. Comput. Des. Eng. 2022, 9, 1817–1851. [Google Scholar] [CrossRef]
  19. Peng, L.; He, C.; Heidari, A.A.; Zhang, Q.; Chen, H.; Liang, G.; Aljehane, N.O.; Mansour, R.F. Information sharing search boosted whale optimizer with Nelder-Mead simplex for parameter estimation of photovoltaic models. Energy Convers. Manag. 2022, 270, 116246. [Google Scholar] [CrossRef]
  20. Abderazek, H.; Hamza, F.; Yildiz, A.R.; Sait, S.M. Comparative investigation of the moth-flame algorithm and whale optimization algorithm for optimal spur gear design. Mater. Test. 2021, 63, 266–271. [Google Scholar] [CrossRef]
  21. Ahmadianfar, I.; Asghar Heidari, A.; Gandomi, A.H.; Chu, X.; Chen, H. RUN Beyond the Metaphor: An Efficient Optimization Algorithm Based on Runge Kutta Method. Expert Syst. Appl. 2021, 181, 115079. [Google Scholar] [CrossRef]
  22. Zhang, H.; Li, R.; Cai, Z.; Gu, Z.; Heidari, A.A.; Wang, M.; Chen, H.; Chen, M. Advanced orthogonal moth flame optimization with Broyden–Fletcher–Goldfarb–Shanno algorithm: Framework and real-world problems. Expert Syst. Appl. 2020, 159, 113617. [Google Scholar] [CrossRef]
  23. Heidari, A.A.; Mirjalili, S.; Faris, H.; Aljarah, I.; Mafarja, M.; Chen, H. Harris hawks optimization: Algorithm and applications. Futur. Gener. Comput. Syst. 2019, 97, 849–872. [Google Scholar] [CrossRef]
  24. Yang, Y.; Chen, H.; Heidari, A.A.; Gandomi, A.H. Hunger games search: Visions, conception, implementation, deep analysis, perspectives, and towards performance shifts. Expert Syst. Appl. 2021, 177, 114864. [Google Scholar] [CrossRef]
  25. Ahmadianfar, I.; Asghar Heidari, A.; Noshadian, S.; Chen, H.; Gandomi, A.H. INFO: An Efficient Optimization Algorithm based on Weighted Mean of Vectors. Expert Syst. Appl. 2022, 195, 116516. [Google Scholar] [CrossRef]
  26. Tu, J.; Chen, H.; Wang, M.; Gandomi, A.H. The Colony Predation Algorithm. J. Bionic Eng. 2021, 18, 674–710. [Google Scholar] [CrossRef]
  27. Hu, J.; Gui, W.; Heidari, A.A.; Cai, Z.; Liang, G.; Chen, H.; Pan, Z. Dispersed foraging slime mould algorithm: Continuous and binary variants for global optimization and wrapper-based feature selection. Knowl. Based Syst. 2022, 237, 107761. [Google Scholar] [CrossRef]
  28. Liu, Y.; Heidari, A.A.; Cai, Z.; Liang, G.; Chen, H.; Pan, Z.; Alsufyani, A.; Bourouis, S. Simulated annealing-based dynamic step shuffled frog leaping algorithm: Optimal performance design and feature selection. Neurocomputing 2022, 503, 325–362. [Google Scholar] [CrossRef]
  29. Hussien, A.G.; Heidari, A.A.; Ye, X.; Liang, G.; Chen, H.; Pan, Z. Boosting whale optimization with evolution strategy and Gaussian random walks: An image segmentation method. Eng. Comput. 2022, 1–45. [Google Scholar] [CrossRef]
  30. Yu, H.; Song, J.; Chen, C.; Heidari, A.A.; Liu, J.; Chen, H.; Zaguia, A.; Mafarja, M. Image segmentation of Leaf Spot Diseases on Maize using multi-stage Cauchy-Enabled grey wolf algorithm. Eng. Appl. Artif. Intell. 2022, 109, 104653. [Google Scholar] [CrossRef]
  31. Xu, Y.; Chen, H.; Heidari, A.A.; Luo, J.; Zhang, Q.; Zhao, X.; Li, C. An efficient chaotic mutative moth-flame-inspired optimizer for global optimization tasks. Expert Syst. Appl. 2019, 129, 135–155. [Google Scholar] [CrossRef]
  32. Zhang, Y.; Liu, R.; Heidari, A.A.; Wang, X.; Chen, Y.; Wang, M.; Chen, H. Towards augmented kernel extreme learning models for bankruptcy prediction: Algorithmic behavior and comprehensive analysis. Neurocomputing 2021, 430, 185–212. [Google Scholar] [CrossRef]
  33. Yu, H.; Cheng, X.; Chen, C.; Heidari, A.A.; Liu, J.; Cai, Z.; Chen, H. Apple leaf disease recognition method with improved residual network. Multimed. Tools Appl. 2022, 81, 7759–7782. [Google Scholar] [CrossRef]
  34. Wang, M.; Chen, H.; Yang, B.; Zhao, X.; Hu, L.; Cai, Z.; Huang, H.; Tong, C. Toward an optimal kernel extreme learning machine using a chaotic moth-flame optimization strategy with applications in medical diagnoses. Neurocomputing 2017, 267, 69–84. [Google Scholar] [CrossRef]
  35. Chen, H.L.; Wang, G.; Ma, C.; Cai, Z.N.; Liu, W.B.; Wang, S.J. An efficient hybrid kernel extreme learning machine approach for early diagnosis of Parkinson’s disease. Neurocomputing 2016, 184, 131–144. [Google Scholar] [CrossRef] [Green Version]
  36. Dong, R.; Chen, H.; Heidari, A.A.; Turabieh, H.; Mafarja, M.; Wang, S. Boosted kernel search: Framework, analysis and case studies on the economic emission dispatch problem. Knowl. Based Syst. 2021, 233, 107529. [Google Scholar] [CrossRef]
  37. He, Z.; Yen, G.G.; Ding, J. Knee-Based Decision Making and Visualization in Many-Objective Optimization. IEEE Trans. Evol. Comput. 2020, 25, 292–306. [Google Scholar] [CrossRef]
  38. He, Z.; Yen, G.G.; Lv, J. Evolutionary Multiobjective Optimization with Robustness Enhancement. IEEE Trans. Evol. Comput. 2019, 24, 494–507. [Google Scholar] [CrossRef]
  39. Wu, S.-H.; Zhan, Z.-H.; Zhang, J. SAFE: Scale-Adaptive Fitness Evaluation Method for Expensive Optimization Problems. IEEE Trans. Evol. Comput. 2021, 25, 478–491. [Google Scholar] [CrossRef]
  40. Li, J.Y.; Zhan, Z.H.; Wang, C.; Jin, H.; Zhang, J. Boosting data-driven evolutionary algorithm with localized data generation. IEEE Trans. Evol. Comput. 2020, 24, 923–937. [Google Scholar] [CrossRef]
  41. Deng, W.; Zhang, X.; Zhou, Y.; Liu, Y.; Zhou, X.; Chen, H.; Zhao, H. An enhanced fast non-dominated solution sorting genetic algorithm for multi-objective problems. Inf. Sci. 2022, 585, 441–453. [Google Scholar] [CrossRef]
  42. Hua, Y.; Liu, Q.; Hao, K.; Jin, Y. A Survey of Evolutionary Algorithms for Multi-Objective Optimization Problems with Irregular Pareto Fronts. IEEE/CAA J. Autom. Sin. 2021, 8, 303–318. [Google Scholar] [CrossRef]
  43. Han, X.; Han, Y.; Chen, Q.; Li, J.; Sang, H.; Liu, Y.; Pan, Q.; Nojima, Y. Distributed Flow Shop Scheduling with Se-quence-Dependent Setup Times Using an Improved Iterated Greedy Algorithm. Complex Syst. Model. Simul. 2021, 1, 198–217. [Google Scholar] [CrossRef]
  44. Gao, D.; Wang, G.-G.; Pedrycz, W. Solving Fuzzy Job-Shop Scheduling Problem Using DE Algorithm Improved by a Selection Mechanism. IEEE Trans. Fuzzy Syst. 2020, 28, 3265–3275. [Google Scholar] [CrossRef]
  45. Wang, G.-G.; Gao, D.; Pedrycz, W. Solving Multiobjective Fuzzy Job-Shop Scheduling Problem by a Hybrid Adaptive Differential Evolution Algorithm. IEEE Trans. Ind. Informatics 2022, 18, 8519–8528. [Google Scholar] [CrossRef]
  46. Chen, H.L.; Yang, B.; Wang, S.J.; Wang, G.; Liu, D.Y.; Li, H.Z.; Liu, W. Towards an optimal support vector machine classifier using a parallel particle swarm optimization strategy. Appl. Math. Comput. 2014, 239, 180–197. [Google Scholar] [CrossRef]
  47. Deng, W.; Xu, J.; Zhao, H.; Song, Y. A Novel Gate Resource Allocation Method Using Improved PSO-Based QEA. IEEE Trans. Intell. Transp. Syst. 2020, 23, 1737–1745. [Google Scholar] [CrossRef]
  48. Deng, W.; Xu, J.; Song, Y.; Zhao, H. An effective improved co-evolution ant colony optimisation algorithm with multi-strategies and its application. Int. J. Bio Inspir. Comput. 2020, 16, 158–170. [Google Scholar] [CrossRef]
  49. Ye, X.; Liu, W.; Li, H.; Wang, M.; Chi, C.; Liang, G.; Chen, H.; Huang, H. Modified Whale Optimization Algorithm for Solar Cell and PV Module Parameter Identification. Complexity 2021, 2021, 8878686. [Google Scholar] [CrossRef]
  50. Yu, H.; Yuan, K.; Li, W.; Zhao, N.; Chen, W.; Huang, C.; Chen, H.; Wang, M. Improved Butterfly Optimizer-Configured Extreme Learning Machine for Fault Diagnosis. Complexity 2021, 2021, 6315010. [Google Scholar] [CrossRef]
  51. Agrawal, R.; Kaur, B.; Sharma, S. Quantum based Whale Optimization Algorithm for wrapper feature selection. Appl. Soft Comput. 2020, 89, 106092. [Google Scholar] [CrossRef]
  52. Bai, L.; Han, Z.; Ren, J.; Qin, X. Research on feature selection for rotating machinery based on Supervision Kernel Entropy Component Analysis with Whale Optimization Algorithm. Appl. Soft Comput. 2020, 92, 106245. [Google Scholar] [CrossRef]
  53. Bahiraei, M.; Foong, L.K.; Hosseini, S.; Mazaheri, N. Predicting heat transfer rate of a ribbed triple-tube heat exchanger working with nanofluid using neural network enhanced by advanced optimization algorithms. Powder Technol. 2021, 381, 459–476. [Google Scholar] [CrossRef]
  54. Qi, A.; Zhao, D.; Yu, F.; Heidari, A.A.; Chen, H.; Xiao, L. Directional mutation and crossover for immature performance of whale algorithm with application to engineering optimization. J. Comput. Des. Eng. 2022, 9, 519–563. [Google Scholar] [CrossRef]
  55. Bui, D.T.; Abdullahi, M.M.; Ghareh, S.; Moayedi, H.; Nguyen, H. Fine-tuning of neural computing using whale optimization algorithm for predicting compressive strength of concrete. Eng. Comput. 2021, 37, 701–712. [Google Scholar] [CrossRef]
  56. Butti, D.; Mangipudi, S.K.; Rayapudi, S. Model Order Reduction Based Power System Stabilizer Design Using Improved Whale Optimization Algorithm. IETE J. Res. 2021, 1–20. [Google Scholar] [CrossRef]
  57. Cao, Y.; Li, Y.; Zhang, G.; Jermsittiparsert, K.; Nasseri, M. An efficient terminal voltage control for PEMFC based on an improved version of whale optimization algorithm. Energy Rep. 2020, 6, 530–542. [Google Scholar] [CrossRef]
  58. Çerçevik, A.E.; Avşar, Ö.; Hasançebi, O. Optimum design of seismic isolation systems using metaheuristic search methods. Soil Dyn. Earthq. Eng. 2019, 131, 106012. [Google Scholar] [CrossRef]
  59. Zhao, S.; Song, J.; Du, X.; Liu, T.; Chen, H.; Chen, H. Intervention-Aware Epidemic Prediction by Enhanced Whale Optimization. In International Conference on Knowledge Science, Engineering and Management; Memmi, G., Yang, B., Kong, L., Zhang, T., Qiu, M., Eds.; Springer: Berlin/Heidelberg, Germany, 2022; pp. 457–468. [Google Scholar]
  60. Fan, Y.; Wang, P.; Heidari, A.A.; Wang, M.; Zhao, X.; Chen, H.; Li, C. Boosted hunting-based fruit fly optimization and advances in real-world problems. Expert Syst. Appl. 2020, 159, 113502. [Google Scholar] [CrossRef]
  61. Raj, S.; Bhattacharyya, B. Optimal placement of TCSC and SVC for reactive power planning using Whale optimization algorithm. Swarm Evol. Comput. 2018, 40, 131–143. [Google Scholar] [CrossRef]
  62. Guo, Y.; Shen, H.; Chen, L.; Liu, Y.; Kang, Z. Improved whale optimization algorithm based on random hopping update and random control parameter. J. Intell. Fuzzy Syst. 2021, 40, 363–379. [Google Scholar] [CrossRef]
  63. Jiang, R.; Yang, M.; Wang, S.; Chao, T. An improved whale optimization algorithm with armed force program and strategic adjustment. Appl. Math. Model. 2020, 81, 603–623. [Google Scholar] [CrossRef]
  64. Tu, J.; Chen, H.; Liu, J.; Heidari, A.A.; Zhang, X.; Wang, M.; Ruby, R.; Pham, Q.V. Evolutionary biogeography-based whale optimization methods with communication structure: Towards measuring the balance. Knowl. Based Syst. 2021, 212, 106642. [Google Scholar] [CrossRef]
  65. Wang, G.; Gui, W.; Liang, G.; Zhao, X.; Wang, M.; Mafarja, M.; Turabieh, H.; Xin, J.; Chen, H.; Ma, X. Spiral Motion Enhanced Elite Whale Optimizer for Global Tasks. Complexity 2021, 2021, 1–33. [Google Scholar] [CrossRef]
  66. Abd Elazim, S.M.; Ali, E.S. Optimal network restructure via improved whale optimization approach. Int. J. Commun. Syst. 2021, 34, e4617. [Google Scholar] [CrossRef]
  67. Abdel-Basset, M.; Chang, V.; Mohamed, R. HSMA_WOA: A hybrid novel Slime mould algorithm with whale optimization algorithm for tackling the image segmentation problem of chest X-ray images. Appl. Soft Comput. 2020, 95, 106642. [Google Scholar] [CrossRef]
  68. Chai, Q.-W.; Chu, S.-C.; Pan, J.-S.; Hu, P.; Zheng, W.-M. A parallel WOA with two communication strategies applied in DV-Hop localization method. EURASIP J. Wirel. Commun. Netw. 2020, 2020, 1–10. [Google Scholar] [CrossRef]
  69. Heidari, A.A.; Aljarah, I.; Faris, H.; Chen, H.; Luo, J.; Mirjalili, S. An enhanced associative learning-based exploratory whale optimizer for global optimization. Neural Comput. Appl. 2020, 32, 5185–5211. [Google Scholar] [CrossRef]
  70. Jin, Q.; Xu, Z.; Cai, W. An Improved Whale Optimization Algorithm with Random Evolution and Special Reinforcement Dual-Operation Strategy Collaboration. Symmetry 2021, 13, 238. [Google Scholar] [CrossRef]
  71. Qin, A.K.; Huang, V.L.; Suganthan, P.N. Differential Evolution Algorithm with Strategy Adaptation for Global Numerical Optimization. IEEE Trans. Evol. Comput. 2008, 13, 398–417. [Google Scholar] [CrossRef]
  72. Wan, X.; Zuo, X.; Zhao, X. A differential evolution algorithm combined with linear programming for solving a closed loop facility layout problem. Appl. Soft Comput. 2022, 108725. [Google Scholar] [CrossRef]
  73. Yuan, Y.; Cao, J.; Wang, X.; Zhang, Z.; Liu, Y. Economic-effectiveness analysis of micro-fins helically coiled tube heat exchanger and optimization based on multi-objective differential evolution algorithm. Appl. Therm. Eng. 2022, 201, 117764. [Google Scholar] [CrossRef]
  74. Liu, D.; Hu, Z.; Su, Q.; Liu, M. A niching differential evolution algorithm for the large-scale combined heat and power economic dispatch problem. Appl. Soft Comput. 2021, 113, 108017. [Google Scholar] [CrossRef]
  75. He, Z.; Ning, D.; Gou, Y.; Zhou, Z. Wave energy converter optimization based on differential evolution algorithm. Energy 2022, 246, 123433. [Google Scholar] [CrossRef]
  76. Meng, A.-B.; Chen, Y.-C.; Yin, H.; Chen, S.-Z. Crisscross optimization algorithm and its application. Knowl. Based Syst. 2014, 67, 218–229. [Google Scholar] [CrossRef]
  77. Luo, J.; Chen, H.; Heidari, A.A.; Xu, Y.; Zhang, Q.; Li, C. Multi-strategy boosted mutative whale-inspired optimization approaches. Appl. Math. Model. 2019, 73, 109–123. [Google Scholar] [CrossRef]
  78. Yousri, D.; Allam, D.; Eteiba, M. Chaotic whale optimizer variants for parameters estimation of the chaotic behavior in Permanent Magnet Synchronous Motor. Appl. Soft Comput. 2019, 74, 479–503. [Google Scholar] [CrossRef]
  79. Ling, Y.; Zhou, Y.; Luo, Q. Lévy Flight Trajectory-Based Whale Optimization Algorithm for Global Optimization. IEEE Access 2017, 5, 6168–6186. [Google Scholar] [CrossRef]
  80. Tubishat, M.; Abushariah, M.A.M.; Idris, N.; Aljarah, I. Improved whale optimization algorithm for feature selection in Arabic sentiment analysis. Appl. Intell. 2018, 49, 1688–1707. [Google Scholar] [CrossRef]
  81. Cai, Z.; Gu, J.; Luo, J.; Zhang, Q.; Chen, H.; Pan, Z.; Li, Y.; Li, C. Evolving an optimal kernel extreme learning machine by using an enhanced grey wolf optimization strategy. Expert Syst. Appl. 2019, 138, 112814. [Google Scholar] [CrossRef]
  82. Heidari, A.A.; Ali Abbaspour, R.; Chen, H. Efficient boosted grey wolf optimizers for global search and kernel extreme learning machine training. Appl. Soft Comput. 2019, 81, 105521. [Google Scholar] [CrossRef]
  83. Sun, T.-Y.; Liu, C.-C.; Tsai, S.-J.; Hsieh, S.-T.; Li, K.-Y. Cluster Guide Particle Swarm Optimization (CGPSO) for Underdetermined Blind Source Separation with Advanced Conditions. IEEE Trans. Evol. Comput. 2010, 15, 798–811. [Google Scholar] [CrossRef]
  84. Nenavath, H.; Jatoth, R.K. Hybridizing sine cosine algorithm with differential evolution for global optimization and object tracking. Appl. Soft Comput. 2018, 62, 1019–1043. [Google Scholar] [CrossRef]
  85. Singh, R.P.; Mukherjee, V.; Ghoshal, S.P. Optimal power flow by particle swarm optimization with an aging leader and challengers. Int. J. Eng. 2015, 7, 123–132. [Google Scholar] [CrossRef]
  86. Liang, H.; Liu, Y.; Shen, Y.; Li, F.; Man, Y. A Hybrid Bat Algorithm for Economic Dispatch with Random Wind Power. IEEE Trans. Power Syst. 2018, 33, 5052–5061. [Google Scholar] [CrossRef]
  87. Adarsh, B.R.; Raghunathan, T.; Jayabarathi, T.; Yang, X.-S. Economic dispatch using chaotic bat algorithm. Energy 2016, 96, 666–675. [Google Scholar] [CrossRef]
  88. Abd Elaziz, M.; Oliva, D.; Xiong, S. An improved Opposition-Based Sine Cosine Algorithm for global optimization. Expert Syst. Appl. 2017, 90, 484–500. [Google Scholar] [CrossRef]
  89. Wu, Z.; Li, R.; Xie, J.; Zhou, Z.; Guo, J.; Jiang, J.; Su, X. A user sensitive subject protection approach for book search service. J. Assoc. Inf. Sci. Technol. 2020, 71, 183–195. [Google Scholar] [CrossRef]
  90. Wu, Z.; Shen, S.; Zhou, H.; Li, H.; Lu, C.; Zou, D. An effective approach for the protection of user commodity viewing privacy in e-commerce website. Knowl. Based Syst. 2021, 220, 106952. [Google Scholar] [CrossRef]
  91. Yang, Z.; Chen, H.; Zhang, J.; Chang, Y. Context-aware Attentive Multilevel Feature Fusion for Named Entity Recognition. IEEE Trans. Neural Netw. Learn. Syst. 2022. [Google Scholar] [CrossRef]
  92. Huang, L.; Yang, Y.; Chen, H.; Zhang, Y.; Wang, Z.; He, L. Context-aware road travel time estimation by coupled tensor decomposition based on trajectory data. Knowl. Based Syst. 2022, 245. [Google Scholar] [CrossRef]
  93. Hu, K.; Zhao, L.; Feng, S.; Zhang, S.; Zhou, Q.; Gao, X.; Guo, Y. Colorectal polyp region extraction using saliency detection network with neutrosophic enhancement. Comput. Biol. Med. 2022, 147, 105760. [Google Scholar] [CrossRef] [PubMed]
  94. Zhang, X.; Zheng, J.; Wang, D.; Zhao, L. Exemplar-Based Denoising: A Unified Low-Rank Recovery Framework. IEEE Trans. Circuits Syst. Video Technol. 2020, 30, 2538–2549. [Google Scholar] [CrossRef]
  95. Qi, A.; Zhao, D.; Yu, F.; Heidari, A.A.; Wu, Z.; Cai, Z.; Alenezi, F.; Mansour, R.F.; Chen, H.; Chen, M. Directional mutation and crossover boosted ant colony optimization with application to COVID-19 X-ray image segmentation. Comput. Biol. Med. 2022, 148, 105810. [Google Scholar] [CrossRef]
  96. Ren, L.; Zhao, D.; Zhao, X.; Chen, W.; Li, L.; Wu, T.; Liang, G.; Cai, Z.; Xu, S. Multi-level thresholding segmentation for pathological images: Optimal performance design of a new modified differential evolution. Comput. Bio. Med. 2022, 148, 105910. [Google Scholar] [CrossRef]
  97. Su, H.; Zhao, D.; Elmannai, H.; Heidari, A.A.; Bourouis, S.; Wu, Z.; Cai, Z.; Gui, W.; Chen, M. Multilevel threshold image segmentation for COVID-19 chest radiography: A framework using horizontal and vertical multiverse optimization. Comput. Biol. Med. 2022, 146, 105618. [Google Scholar] [CrossRef]
  98. Cao, X.; Wang, J.; Zeng, B. A Study on the Strong Duality of Second-Order Conic Relaxation of AC Optimal Power Flow in Radial Networks. IEEE Trans. Power Syst. 2021, 37, 443–455. [Google Scholar] [CrossRef]
Figure 1. Schematic of horizontal crossover.
Figure 1. Schematic of horizontal crossover.
Electronics 11 04224 g001
Figure 2. Schematic of vertical crossover.
Figure 2. Schematic of vertical crossover.
Electronics 11 04224 g002
Figure 3. Flow chart of the DECCWOA framework.
Figure 3. Flow chart of the DECCWOA framework.
Electronics 11 04224 g003
Figure 4. Convergence curves of the comparison results for the introduced mechanisms.
Figure 4. Convergence curves of the comparison results for the introduced mechanisms.
Electronics 11 04224 g004
Figure 5. Convergence curves of comparison with improved WOA versions.
Figure 5. Convergence curves of comparison with improved WOA versions.
Electronics 11 04224 g005
Figure 6. Convergence curves of the DECCWOA and advanced algorithms.
Figure 6. Convergence curves of the DECCWOA and advanced algorithms.
Electronics 11 04224 g006
Figure 7. Mean value and standard deviation of four metrics for the DECCWOA and others methods.
Figure 7. Mean value and standard deviation of four metrics for the DECCWOA and others methods.
Electronics 11 04224 g007
Figure 8. Feature selection results of the proposed model.
Figure 8. Feature selection results of the proposed model.
Electronics 11 04224 g008
Table 1. The latest research status of prediction issues for students.
Table 1. The latest research status of prediction issues for students.
AuthorsMethodsOverview
Yang et al. [1]The theory of planned behaviorThey suggested that attitudes, subjective norms, perceived behavior, gender and parental experience have a significant impact on students’ entrepreneurial intentions.
Gonzalez-Serrano et al. [2]Questionnaire methodThey demonstrated that attitudes and perceived behaviors were statistically significant.
Gorgievski et al. [3] Values theory and planned behavior theoryThey found a strong link between personal values and entrepreneurial career intentions.
Nawaz et al. [4]Partial least squares structural equation modeling (PLS-SEM)They found emotional intelligence, entrepreneurial self-efficacy and self-regulation also directly affect college students’ entrepreneurial intentions.
Yang et al. [5]Decision treeThey extracted four key attributes that affect students’ intentions to start a career.
Djordjevic et al. [6]Data analysis approachThey predicted the entrepreneurial intentions of youth in Serbia based on demographic characteristics, social environment, attitudes, awareness of incentives and environmental assessment.
Wei et al. [7]Kernel extreme learning machineThey provided a reasonable reference for the formulation of talent training programs and guidance for the entrepreneurial intention of students.
Bhagavan et al. [8]Data mining tools and methodsThey predicted the current performance of students through their early performance and awareness, and identified students’ expected abilities.
Huang et al. [9]Artificial intelligence algorithms and fuzzy logic modelsThey designed a diversified employment recommendation system, combined with students’ personal interests, and provided employment plans.
Li et al. [10]The cluster analysis technology modelThey achieved accurate predictions of the employment situation of graduates.
Table 2. Names of different algorithm versions when p 2 is different.
Table 2. Names of different algorithm versions when p 2 is different.
AlgorithmDECCWOA1DECCWOA2DECCWOA3DECCWOA4DECCWOA5DECCWOA6DECCWOA7DECCWOA8DECCWOA9DECCWOA10
p 2 0.10.20.30.40.50.60.70.80.91.0
Table 3. Experimental results for analysis of different versions.
Table 3. Experimental results for analysis of different versions.
AlgorithmsOverall
+/−/=Rank
DECCWOA1~2
DECCWOA24/3/281
DECCWOA314/3/186
DECCWOA412/2/215
DECCWOA514/4/173
DECCWOA614/5/164
DECCWOA714/4/177
DECCWOA815/4/168
DECCWOA917/2/169
DECCWOA1016/2/1710
Table 4. Comparison results for the introduced mechanisms.
Table 4. Comparison results for the introduced mechanisms.
AlgorithmsOverall
+/−/=Rank
DECCWOA~1
DEWOA31/1/34
CCWOA18/4/132
WOA25/1/93
Table 5. Comparison results for DECCWOAs with improved WOA versions.
Table 5. Comparison results for DECCWOAs with improved WOA versions.
AlgorithmsOverall
+/−/=Rank
DECCWOA~1
RDWOA16/6/132
ACWOA26/3/66
CCMWOA28/2/59
CWOA29/0/68
BMWOA32/1/27
BWOA23/3/94
LWOA26/4/55
IWOA24/1/103
Table 6. Comparison results for the DECCWOA and advanced algorithms.
Table 6. Comparison results for the DECCWOA and advanced algorithms.
AlgorithmsOverall
+/−/=Rank
DECCWOA~1
IGWO20/8/72
OBLGWO19/5/115
CGPSO23/9/34
ALPSO19/9/73
RCBA23/9/36
CBA24/6/57
OBSCA32/1/29
SCADE28/2/57
Table 7. Four avg metrics results of the proposed model and other models.
Table 7. Four avg metrics results of the proposed model and other models.
ModelsACCSensitivitySpecificityMCC
DECCWOA-KELM-FS95.87%94.64%96.59%91.64%
DECCWOA-KELM92.57%94.05%92.50%86.27%
WOA-KELM90.32%89.39%91.05%81.10%
ANN88.96%87.58%90.51%77.16%
RF92.67%92.85%91.01%85.33%
SVM89.30%91.92%86.96%79.75%
Table 8. Four std metrics results of the proposed model and other models.
Table 8. Four std metrics results of the proposed model and other models.
ModelsACCSensitivitySpecificityMCC
DECCWOA-KELM-FS3.19 × 10−26.85 × 10−24.25 × 10−26.66 × 10−2
DECCWOA-KELM5.60 × 10−28.31 × 10−28.93 × 10−21.01 × 10−1
WOA-KELM4.33 × 10−29.06 × 10−21.02 × 10−18.80 × 10−2
ANN4.16 × 10−25.61 × 10−25.91 × 10−29.50 × 10−2
RF4.17 × 10−21.08 × 10−16.74 × 10−28.59 × 10−2
SVM6.72 × 10−21.12 × 10−11.07 × 10−11.18 × 10−1
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Li, H.; Ke, S.; Rao, X.; Li, C.; Chen, D.; Kuang, F.; Chen, H.; Liang, G.; Liu, L. An Improved Whale Optimizer with Multiple Strategies for Intelligent Prediction of Talent Stability. Electronics 2022, 11, 4224. https://doi.org/10.3390/electronics11244224

AMA Style

Li H, Ke S, Rao X, Li C, Chen D, Kuang F, Chen H, Liang G, Liu L. An Improved Whale Optimizer with Multiple Strategies for Intelligent Prediction of Talent Stability. Electronics. 2022; 11(24):4224. https://doi.org/10.3390/electronics11244224

Chicago/Turabian Style

Li, Hong, Sicheng Ke, Xili Rao, Caisi Li, Danyan Chen, Fangjun Kuang, Huiling Chen, Guoxi Liang, and Lei Liu. 2022. "An Improved Whale Optimizer with Multiple Strategies for Intelligent Prediction of Talent Stability" Electronics 11, no. 24: 4224. https://doi.org/10.3390/electronics11244224

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop