# An Alternate Iterative Differential Evolution Algorithm for Parameter Identification of Chaotic Systems

Authors: Wanli Xiang; Xuelei Meng; Meiqing An
Journal: Discrete Dynamics in Nature and Society
 (2015)

---

## Abstract

Parameter estimation of chaotic systems plays a key role for control and synchronization of chaotic systems. At first, the parameter estimation of chaotic systems is mathematically formulated as a global continuous optimization problem. Then through integrating two differential mutation strategies, an improved greedy selection mechanism and a population diversity balance scheme, an alternate iterative differential algorithm, called AIDE, is presented to solve the problem in this paper. Subsequently, experiments are tested on a set of cases of parameter estimation of chaotic systems and the results show that AIDE is better than or at least equal to DE/rand/1/bin, DE/best/1/bin, and other four well-known algorithms in all cases.


---

## Body

## 1. Introduction

In 1963, Lorenz first found the classical chaotic attractor during the process of simulating the change of atmosphere through a three-dimensional autonomous system [1]. After that, the chaos theory is studied in detail by many researchers. In particular, control and synchronization of chaotic systems have a promising prospect in various fields like information science, medicine, biology, engineering, and so on. However, the chaotic systems to be controlled usually have some unknown parameters. Thus, the parameter estimation problem becomes the first key issue for solving the control and synchronization of chaotic systems.Recently, numerous researchers had given much attention to the parameter estimation of chaotic systems [2–18]. In particular, great achievements over the parameter estimation of chaotic systems have been obtained by intelligent algorithms recently. For example, Dai et al. [19] transformed the problem of parameter estimation of chaotic systems into a global optimization problem through designing a suitable objective function and solved the optimization problem using genetic algorithm. Likewise, Chang [3] employed the differential evolution (DE) algorithm to estimate the unknown parameters of Rossler’s chaotic system. Next, Chang [4] proposed an improved differential evolution algorithm to estimate the unknown parameters of Chen and Lü systems. He et al. [16] employed particle swarm optimization (PSO) algorithm for solving the problem of parameter estimation of Lorenz system and found that PSO is better than genetic algorithm (GA). Gao and Tong [20] also proposed an improved particle swarm optimization algorithm to effectively estimate the unknown parameters of Lorenz system and Lorenz system with noise. Meanwhile, a novel chaotic ant swarm (CAS for short) algorithm was developed to estimate the unknown parameters of Logistic and Lorenz systems by Li et al. [5]. Later, Chang et al. [6] introduced an evolutionary programming (EP) algorithm to solve the problem of parameter estimation of the unified chaotic systems including Lorenz, Lü, and Chen systems. Furthermore, some problems of parameter estimation of chaotic systems with time delay or other characteristics were also solved by some intelligent optimization algorithms [7–9]. In order to increasingly improve the accuracy of parameter estimation of chaotic systems, there are still some researchers who have proposed some improved PSO [10, 11], improved DE [2], and hybrid evolutionary algorithms [12–14, 21] to identify the unknown parameters of chaotic systems. In particular, Wang et al. [14] skillfully hybridize Nelder-Mead Simplex Search (NM for short) and differential evolution (DE) to propose a hybrid algorithm, called NMDE. NMDE was successfully used to identify the unknown parameters of chaotic systems and obtained a better convergence performance.In order to further improve the accuracy of the parameter estimation of chaotic systems, inspired by the existence of a few big evolution eras and small evolution eras in nature, we propose an alternate iterative differential evolution algorithm, in which two mutation strategies with different search abilities (exploration and exploitation) are employed to imitate the evolutionary behaviour of big evolution era and small evolution era, respectively.The rest of the paper is organized as follows. In Section2, the problem description over parameter estimation is described. In Section 3, the traditional differential evolution algorithm is briefly described. Subsequently, an alternate iterative differential evolution, called AIDE, is presented in detail in Section 4. Nextly, comprehensive experiments are conducted in Section 5 to validate the performance of AIDE. Finally, a conclusion is drawn in Section 6.


## 2. Problem Description

In this paper, the followingn-dimensional chaotic system is considered:(1)X˙=FX,X0,θ0,where X∈Rn represents the state vector of chaotic systems, X0∈Rn is an initial state, namely, the start point of evolution of chaotic systems, θ0∈RD is the real parameters values of chaotic systems, and D is the number of the parameters [14, 16, 21, 22].When estimating the unknown parameters of chaotic systems, often suppose that the structure of the systems is known in advance [12] and further suppose that all states of the systems can be measured. Thus, the estimated system can be described as follows:(2)Y˙=FY,X0,θ,where Y∈Rn denotes a state vector of the estimated system and θ∈RD is a parameter vector of the estimated system.In this way, the problem of parameter estimation of chaotic systems is to find a set of suitable parameters ofθ and make them very close to real values of θ0. The corresponding objective function is to minimize the error between the state vector Y of the estimated system and the state vector X of the original system. Accordingly, the problem can be converted into an optimization problem. Generally, its objective can be described by (3). The specific principle of parameter estimation of chaotic systems is shown in Figure 1:(3)minθ⁡J=1M∑k=1MXk-Yk2,where M represents the length of the sampled data for parameters estimation, Xk and Yk denote the state vector of the original system and the estimated system at time k, respectively, and · represents the 2-norm or the Euclidean norm.Figure 1
The principle of parameters estimation of chaotic systems.


## 3. Canonical Differential Evolution

In 1995, Storn and Price [23, 24] first proposed the differential evolution (DE) algorithm, which is simple yet powerful population-based and direct search algorithm. According to the mutation strategies and the crossover operators (bin and exp) of DE [24], it is very flexible and can be formed into many variants. In order to classify the different variants, the notation DE/x/y/z was introduced by Storn and Price [24]. Among a variety of variants, DE/best/1/bin is one of the most popular variants and its exploitation ability is relatively good. To some extent, it may speed up the convergence speed of DE/best/1/bin. Like other population-based metaheuristics, DE also first randomly produces an initial population, which is composed of NpD-dimensional vector, so-called individuals, which encode the candidate solutions; that is, xi=(xi1,…,xiD),i=1,…,Np. Thereafter, DE/best/1/bin enters a loop of evolutionary operations: mutation, crossover, and selection.


### 3.1. Mutation

For each target vectorxi, a mutant vector vi is generated according to the following equation:(4)vi=xbest+F·xa-xb,where i=1,2,…,Np, best is the index of the best individual with the best fitness value, a,b∈[1,Np] are mutually different random integer numbers and they are also different from current index i, and the scale factor F is a real constant in the range of [0,2] and it is used to control the amplification of the differential variation (xa-xb) [24].


### 3.2. Crossover

At this phase, DE/best/1/bin employs a binomial crossover operator to generate a trial vectorui according to the following equation:(5)uij=vij,ifrand⁡0,1j⩽Cr∨j==jrand,xij,otherwise,where i=1,2,…,Np, j=1,2,…,D, rand⁡[0,1]j is a random real number between [0,1], and jrand∈{1,2,…,D} is a randomly chosen index to make sure that the trial vector ui gets at least one parameter from the mutant vector vi. The crossover rate Cr is a predefined constant within the range [0,1], which controls the fraction of parameter values copied from mutant vector [24].


### 3.3. Selection

After crossover operation, the trial vectorui is compared to the target vector xi using the greedy selection mechanism. To be specific, the selection process can be described by the following equation:(6)xi⋆=ui,iffui<fxi,xi,otherwise,where f(x) denotes the objective of a solution x and xi⋆ represents a parent vector used to replace the target vector xi in the next generation.


## 3.1. Mutation

For each target vectorxi, a mutant vector vi is generated according to the following equation:(4)vi=xbest+F·xa-xb,where i=1,2,…,Np, best is the index of the best individual with the best fitness value, a,b∈[1,Np] are mutually different random integer numbers and they are also different from current index i, and the scale factor F is a real constant in the range of [0,2] and it is used to control the amplification of the differential variation (xa-xb) [24].


## 3.2. Crossover

At this phase, DE/best/1/bin employs a binomial crossover operator to generate a trial vectorui according to the following equation:(5)uij=vij,ifrand⁡0,1j⩽Cr∨j==jrand,xij,otherwise,where i=1,2,…,Np, j=1,2,…,D, rand⁡[0,1]j is a random real number between [0,1], and jrand∈{1,2,…,D} is a randomly chosen index to make sure that the trial vector ui gets at least one parameter from the mutant vector vi. The crossover rate Cr is a predefined constant within the range [0,1], which controls the fraction of parameter values copied from mutant vector [24].


## 3.3. Selection

After crossover operation, the trial vectorui is compared to the target vector xi using the greedy selection mechanism. To be specific, the selection process can be described by the following equation:(6)xi⋆=ui,iffui<fxi,xi,otherwise,where f(x) denotes the objective of a solution x and xi⋆ represents a parent vector used to replace the target vector xi in the next generation.


## 4. Alternate Iterative Differential Evolution

### 4.1. Motivation

In view of pseudorandomness and sensitivity to initial state values of chaotic systems, all these chaotic behaviours may result in the objective function shown in (3) having complex landscape, which is the biggest challenge for parameter identification. Hence, better and robust evolutionary algorithm is needed to solve it.In order to balance the exploration and exploitation ability of DE, two different mutation strategies with different searching abilities are employed in AIDE. Inspired by the existence of a few big evolution eras and small evolution eras in nature, together with the diversity of mutation strategy of DE, we use two mutation strategies with different searching abilities to simulate evolutionary behaviour of big evolution era and small evolution era, respectively. In other words, DE/best/1/bin with better exploitation ability is used to simulate the evolution behavior of big evolution era. Inspired by PSO, we presented a new mutation strategy, called DE/pbest/1/bin, where pbest represents its own previous best individual for each target individualxi. In this way, the exploration ability of DE/pbest/1/bin may be better than that of DE/best/1/bin. For each target vector xi, its own previous best individual instead of the global best one is used to guide the population evolution in DE/pbest/1/bin, which partially prevents population from rapidly clustering in the vicinity of the global best individual and avoids evolution stagnation. DE/pbest/1/bin is employed to simulate evolutionary behaviour of the small evolution era. Based on the analysis mentioned above, an alternate iterative differential evolution is presented to identify the unknown parameter of chaotic systems.


### 4.2. Population Initialization Based on Opposition-Based Learning

In order to further improve the performance of evolutionary algorithm, an opposition-based learning (OBL) technique proposed by Rahnamayan et al. [25, 26] is used to initialize a population. The specific procedure is given as the following steps.Step 1.
Randomly produce an initial populationP of Np individuals.Step 2.
Generate the opposite-populationOP of Np opposite individuals according to OBL.Step 3.
SelectNp fittest individuals from P⋃‍OP as initial population.


### 4.3. Improved Greedy Selection Mechanism

Inspired by harmony search (HS) algorithm [27, 28], the selection mechanism of standard DE is changed according to the following criteria:(i)
In the canonical differential evolution, the greedy selection operation is carried out until the corresponding trial vectorui for each target vector xi(i=1,2,…,Np) is generated. In AIDE, the greedy selection operation is immediately conducted between the trial vector and the target vector when some trial vector is generated. In this way, the global best individual or the personal best individual (the previous best individual for each target vector) may be updated more rapidly than ever; namely, their new information helps to better guide the population to evolve towards better solutions.(ii)
Different from the canonical differential evolution, in AIDE, the new generated trial vectorui is first compared with the target vector xi; if individual ui is not inferior to individual xi, then ui will replace xi, or else, the worst individual xw of current population is substituted with ui directly, which is taking a cue from the greedy selection scheme of HS. It should be noted that a greedy selection between new generated ui and xw is performed in HS. But here ui directly replaces xw in order to maintain a good population diversity.In the presented AIDE algorithm, the improved greedy selection mechanism is employed.


### 4.4. Constraint Handling

When thejth variable of the ith individual xi violates the boundary constraints, the corresponding jth component will be reset to a suitable value according to the following criterion: (7)xij=xjmin+rand⁡0,1·xjmax-xjmin,ifxij<xjmin,xjmax-rand⁡0,1·xjmax-xjmin,ifxij>xjmax.


### 4.5. Alternate Iterative Differential Evolution

According to the aforementioned analysis, two mutation strategies are employed in AIDE. One is DE/best/1, which is given in (4). Inspired by PSO, a new mutation strategy, called DE/pbest/1, is presented in AIDE. The mutation strategy DE/pbest/1 can be described as follows:(8)v=xipbest+F·xa-xb,where pbest is similar to that of PSO and denotes the index of personal best individual for each target vector xi and the other variables are the same as those of (4).From (4), the first term of the equation is the global best individual, which means that the population evolves under the guidance of the global best individual and it owns extremely strong exploitation ability. The search equation is used to simulate the evolution behavior of big evolution era in nature. In big evolution era, species in nature evolve very rapidly from the low level to high level, from simplicity to complexity, and from barbarity to civilization.From (8), the first term of the equation is the personal best individual of the corresponding target vector, which means that the population will be directed by the previous best one of each individual rather than the global best individual. Under such circumstance, the evolution speed of population slows down in contrast to the situation of guidance of (4). Equation (8) is used to simulate the evolution behaviour of the small evolution era in nature, which helps to further prevent the population from clustering around the global best individual. It should be noted that species in nature evolve slowly over a period of time due to the effects of environmental change, natural disaster, and so on.As far as the time periods of the big evolution era and the small evolution era are concerned, two constant numbers,limitA and limitB, are introduced to denote them. Namely, the DE/pbest/1/bin is carried out limitB times after the DE/best/1/bin is performed limitA times; then the two procedures are run alternately. Generally, the value of limitA is bigger than that of limitB.In order to further improve the diversity of AIDE, inspired by the scout bees operation of artificial bee colony (ABC) algorithm proposed by Karaboga and Basturk [29], changed scout bees operation is introduced into AIDE. To be specific, if the global best individual is not further improved through a predetermined number of generations called limit, then the first top (1/5)Np individuals are replaced by randomly generated new individuals in order to maintain the population diversity and avoid the stagnation of evolution.According to the above improvements, the main procedure of presented hybrid algorithm AIDE can be summarized in Algorithm1.Algorithm 1:The procedure of AIDE.
(1)    Initialize the population X using opposition-based learning
(2)    Let Xpbest={xipbest,i=1,2,…,Np} represent the population composed of the best one of each individual (xipbest) in
history
(3)    Set iteration=1 //Iterative variable
(4)    while  iteration⩽MCN  do
(5)    for  i=1 to Np  do
(6)     Choose the best individual from the current population, and let best represent its index
(7)     Generate two random integer numbers a,b∈[1⋯Np]∧a≠b≠i
(8)     if  trueA==0  then
(9)      Perform differential mutation according to (4)
(10)   Set limitA=limitA-1
(11)  else
(12)   Perform differential mutation according to (8)
(13)   Set limitB=limitB-1
(14)  end if
(15)  Do bound constraints handling according to (7)
(16)  Generate trial vector u according to (5) and compute its objective value
(17)  if  f(u) is better than f(xi)  then
(18)   Replace xi with u immediately
(19)  else
(20)   Substitute the worst individual xw in current population with u immediately and w is the index of the worst
individual
(21)   if  f(u) is better than f(xwpbest)  then
(22)    xwpbest=u and f(xwpbest)=f(u)
(23)   end if
(24)  end if
(25)  if  limitB==0  then
(26)   Set trueA=0 and limitA=1000; //Big evolution
(27)  else
(28)   Set trueA=1 and limitB=500; //Small evolution
(29)  end if
(30) end for
(31) //Disaster mutation
(32) if  limit2>limit  then
(33)  Sort the population according to objective value order by ascent and replace the first (1/5)Np individuals with
randomly generated individuals
(34)  Set limit2=0
(35) end if
(36) Record the best solution found so far
(37) if  the best solution is updated  then
(38)  Set limit2=0
(39) else
(40)  Set limit2=limit2+1
(41) end if
(42) Set iteration=iteration+1
(43) end while


## 4.1. Motivation

In view of pseudorandomness and sensitivity to initial state values of chaotic systems, all these chaotic behaviours may result in the objective function shown in (3) having complex landscape, which is the biggest challenge for parameter identification. Hence, better and robust evolutionary algorithm is needed to solve it.In order to balance the exploration and exploitation ability of DE, two different mutation strategies with different searching abilities are employed in AIDE. Inspired by the existence of a few big evolution eras and small evolution eras in nature, together with the diversity of mutation strategy of DE, we use two mutation strategies with different searching abilities to simulate evolutionary behaviour of big evolution era and small evolution era, respectively. In other words, DE/best/1/bin with better exploitation ability is used to simulate the evolution behavior of big evolution era. Inspired by PSO, we presented a new mutation strategy, called DE/pbest/1/bin, where pbest represents its own previous best individual for each target individualxi. In this way, the exploration ability of DE/pbest/1/bin may be better than that of DE/best/1/bin. For each target vector xi, its own previous best individual instead of the global best one is used to guide the population evolution in DE/pbest/1/bin, which partially prevents population from rapidly clustering in the vicinity of the global best individual and avoids evolution stagnation. DE/pbest/1/bin is employed to simulate evolutionary behaviour of the small evolution era. Based on the analysis mentioned above, an alternate iterative differential evolution is presented to identify the unknown parameter of chaotic systems.


## 4.2. Population Initialization Based on Opposition-Based Learning

In order to further improve the performance of evolutionary algorithm, an opposition-based learning (OBL) technique proposed by Rahnamayan et al. [25, 26] is used to initialize a population. The specific procedure is given as the following steps.Step 1.
Randomly produce an initial populationP of Np individuals.Step 2.
Generate the opposite-populationOP of Np opposite individuals according to OBL.Step 3.
SelectNp fittest individuals from P⋃‍OP as initial population.


## 4.3. Improved Greedy Selection Mechanism

Inspired by harmony search (HS) algorithm [27, 28], the selection mechanism of standard DE is changed according to the following criteria:(i)
In the canonical differential evolution, the greedy selection operation is carried out until the corresponding trial vectorui for each target vector xi(i=1,2,…,Np) is generated. In AIDE, the greedy selection operation is immediately conducted between the trial vector and the target vector when some trial vector is generated. In this way, the global best individual or the personal best individual (the previous best individual for each target vector) may be updated more rapidly than ever; namely, their new information helps to better guide the population to evolve towards better solutions.(ii)
Different from the canonical differential evolution, in AIDE, the new generated trial vectorui is first compared with the target vector xi; if individual ui is not inferior to individual xi, then ui will replace xi, or else, the worst individual xw of current population is substituted with ui directly, which is taking a cue from the greedy selection scheme of HS. It should be noted that a greedy selection between new generated ui and xw is performed in HS. But here ui directly replaces xw in order to maintain a good population diversity.In the presented AIDE algorithm, the improved greedy selection mechanism is employed.


## 4.4. Constraint Handling

When thejth variable of the ith individual xi violates the boundary constraints, the corresponding jth component will be reset to a suitable value according to the following criterion: (7)xij=xjmin+rand⁡0,1·xjmax-xjmin,ifxij<xjmin,xjmax-rand⁡0,1·xjmax-xjmin,ifxij>xjmax.


## 4.5. Alternate Iterative Differential Evolution

According to the aforementioned analysis, two mutation strategies are employed in AIDE. One is DE/best/1, which is given in (4). Inspired by PSO, a new mutation strategy, called DE/pbest/1, is presented in AIDE. The mutation strategy DE/pbest/1 can be described as follows:(8)v=xipbest+F·xa-xb,where pbest is similar to that of PSO and denotes the index of personal best individual for each target vector xi and the other variables are the same as those of (4).From (4), the first term of the equation is the global best individual, which means that the population evolves under the guidance of the global best individual and it owns extremely strong exploitation ability. The search equation is used to simulate the evolution behavior of big evolution era in nature. In big evolution era, species in nature evolve very rapidly from the low level to high level, from simplicity to complexity, and from barbarity to civilization.From (8), the first term of the equation is the personal best individual of the corresponding target vector, which means that the population will be directed by the previous best one of each individual rather than the global best individual. Under such circumstance, the evolution speed of population slows down in contrast to the situation of guidance of (4). Equation (8) is used to simulate the evolution behaviour of the small evolution era in nature, which helps to further prevent the population from clustering around the global best individual. It should be noted that species in nature evolve slowly over a period of time due to the effects of environmental change, natural disaster, and so on.As far as the time periods of the big evolution era and the small evolution era are concerned, two constant numbers,limitA and limitB, are introduced to denote them. Namely, the DE/pbest/1/bin is carried out limitB times after the DE/best/1/bin is performed limitA times; then the two procedures are run alternately. Generally, the value of limitA is bigger than that of limitB.In order to further improve the diversity of AIDE, inspired by the scout bees operation of artificial bee colony (ABC) algorithm proposed by Karaboga and Basturk [29], changed scout bees operation is introduced into AIDE. To be specific, if the global best individual is not further improved through a predetermined number of generations called limit, then the first top (1/5)Np individuals are replaced by randomly generated new individuals in order to maintain the population diversity and avoid the stagnation of evolution.According to the above improvements, the main procedure of presented hybrid algorithm AIDE can be summarized in Algorithm1.Algorithm 1:The procedure of AIDE.
(1)    Initialize the population X using opposition-based learning
(2)    Let Xpbest={xipbest,i=1,2,…,Np} represent the population composed of the best one of each individual (xipbest) in
history
(3)    Set iteration=1 //Iterative variable
(4)    while  iteration⩽MCN  do
(5)    for  i=1 to Np  do
(6)     Choose the best individual from the current population, and let best represent its index
(7)     Generate two random integer numbers a,b∈[1⋯Np]∧a≠b≠i
(8)     if  trueA==0  then
(9)      Perform differential mutation according to (4)
(10)   Set limitA=limitA-1
(11)  else
(12)   Perform differential mutation according to (8)
(13)   Set limitB=limitB-1
(14)  end if
(15)  Do bound constraints handling according to (7)
(16)  Generate trial vector u according to (5) and compute its objective value
(17)  if  f(u) is better than f(xi)  then
(18)   Replace xi with u immediately
(19)  else
(20)   Substitute the worst individual xw in current population with u immediately and w is the index of the worst
individual
(21)   if  f(u) is better than f(xwpbest)  then
(22)    xwpbest=u and f(xwpbest)=f(u)
(23)   end if
(24)  end if
(25)  if  limitB==0  then
(26)   Set trueA=0 and limitA=1000; //Big evolution
(27)  else
(28)   Set trueA=1 and limitB=500; //Small evolution
(29)  end if
(30) end for
(31) //Disaster mutation
(32) if  limit2>limit  then
(33)  Sort the population according to objective value order by ascent and replace the first (1/5)Np individuals with
randomly generated individuals
(34)  Set limit2=0
(35) end if
(36) Record the best solution found so far
(37) if  the best solution is updated  then
(38)  Set limit2=0
(39) else
(40)  Set limit2=limit2+1
(41) end if
(42) Set iteration=iteration+1
(43) end while


## 5. Experimental Study and Discussion

### 5.1. Typical Systems and Parameter Settings

In this section, comprehensive experiments are conducted to verify the effectiveness of AIDE. As a typical chaotic system, Lorenz system is taken as an example. The Lorenz system is mathematically formulated as follows:(9)x˙1=a·x2-x1,x˙2=b·x1-x1·x3-x2,x˙3=x1·x2-c·x3,where a=10, b=28, and c=8/3 are the original parameters and the system displays a chaotic attractor as shown in Figure 2.Figure 2
The chaotic attractor of Lorenz system.During the process of parameter estimation for Lorenz system, the fourth order Runge-Kutta algorithm is employed to obtain state vector in our simulation, where the step sizeh is set to 0.01 and the length of samples is selected as M=300. At first, let Lorenz system evolve freely from a random initial state and choose any point as the initial state X0 of system after a period of transient process. Next, successive M state vectors of both the original system and the estimated system are used to calculate the objective J as shown in (3). Last, the aim of minimizing the objective J is to search a suitable set of parameters θ.For a fair comparison, the searching ranges are set as follows:a∈[9,11], b∈[20,30], and c∈[2,3], which are also used in [14, 16, 21, 22]. In addition, the maximum cycle number MCN is taken as 100, and the population size Np is set as 20, 40, and 120 when the number of unknown parameters is 1, 2, and 3, respectively, in the literature [14]. That is, the maximum number of function evaluations (maxFEs) is 2000 (20∗100), 4000 (40∗100), and 12000 (120∗100) when the number of unknown parameters is 1, 2, and 3, respectively. That is, for fixed population size in AIDE, that is, Np=40, the MCN is set as 50 (2000/40), 100 (4000/40), and 300 (12000/40) when the number of unknown parameters is 1, 2, and 3, respectively.In order to further demonstrate the effectiveness of AIDE, it is first compared with DE/best/1/bin and DE/rand/1/bin. The population sizeNp is set to 40 for all cases of the three algorithms. The maximum cycle number of the three algorithms is the same as aforementioned. Some other common parameters settings of the three algorithms are also similar to each other; that is, Cr=0.9 and F=0.5. What is more, in AIDE, the parameter limit is set to 10, the parameter limitA is set to 1000, and the parameter limitB is set to 500 by trial and error.


### 5.2. Comparison between AIDE, DE/best/1/bin, and DE/rand/1/bin

#### 5.2.1. Simulation on One-Dimensional Parameter Estimation

First, experiments tested on three one-dimensional parameter estimation cases are conducted. That is, only one parameter among parametersa, b, and c is unknown and needs to be identified at a time. In addition, each algorithm is run twenty times independently for each case, respectively. The statistical results obtained by AIDE, DE/best/1/bin, and DE/rand/1/bin for the three cases are listed in Table 1. Meanwhile, the evolution process of unknown parameters (a, b, and c) and average of objective function values J are plotted in Figure 3.Table 1
Statistical results of different approaches for one-dimensional parameter estimation.
Approaches
Index
Best
Mean
Worst
DE_rand
a
^
10.000000000000009
9.999999999999984
10.000000000001773
J
2.2985
e
-
027
1.6365
e
-
024
1.6950
e
-
023
DE_best
a
^
10.000000000000000
10.000000000000000
10.000000000000000
J
0.000000000000000
0.000000000000000
0.000000000000000
AIDE
a
^
10.000000000000000
10.000000000000000
10.000000000000000
J
0.000000000000000
0.000000000000000
0.000000000000000
DE_rand
b
^
27.999999999999936
28.000000000005393
27.999999999965191
J
1.3657
e
-
024
1.0048
e
-
019
5.8964
e
-
019
DE_best
b
^
28.000000000000000
28.000000000000000
28.000000000000000
J
0.000000000000000
0.000000000000000
0.000000000000000
AIDE
b
^
28.000000000000000
28.000000000000000
28.000000000000000
J
0.000000000000000
0.000000000000000
0.000000000000000
DE_rand
c
^
2.666666666666673
2.666666666666710
2.666666666666033
J
4.4737
e
-
025
4.9702
e
-
022
3.7970
e
-
021
DE_best
c
^
2.666666666666667
2.666666666666667
2.666666666666667
J
0.000000000000000
0.000000000000000
0.000000000000000
AIDE
c
^
2.666666666666667
2.666666666666667
2.666666666666667
J
0.000000000000000
0.000000000000000
0.000000000000000
DE_rand stands for DE/rand/1/bin and DE_best means DE/best/1/bin.Figure 3
The evolution process of Lorenz system with one unknown parameter.
(a)
(b)
(c)
(d)
(e)
(f)From Table1, it can be seen that DE/rand/1/bin is worse than both DE/best/1/bin and AIDE, which shows that the convergence speed of DE/rand/1/bin is slow. Furthermore, the objective values obtained by AIDE and DE/best/1/bin are all zero, which means that the estimated value of a, b, and c identified by AIDE and DE/best/1/bin is exactly equal to the true value of the corresponding parameter, respectively. Nevertheless, the convergence speed of DE/best/1/bin is slower than that of AIDE, which can be found from Figure 3, which indicates that the combination of the two mutation strategies is more favourable to speed up the convergence of AIDE than DE/best/1/bin itself. That is, sometimes the mutation strategy DE/pbest/1/bin may work better than DE/best/1bin.


#### 5.2.2. Simulation on Two-Dimensional Parameter Estimation

Second, Experimental study about three two-dimensional parameter estimation cases is carried out. At this time, two of the three parameters are unknown and need to be identified. The corresponding statistical results are listed in Tables2–4, respectively. The corresponding evolution processes of both unknown parameters and objective values are illustrated in Figures 4–6, respectively.Table 2
Statistical results of different approaches for two-dimensional parameter identification (a and b are unknown).
Index
DE/rand/1/bin
DE/best/1/bin
AIDE
Best
a
^
9.999999999999080
10.000000000000000
10.000000000000000
b
^
28.000000000000142
28.000000000000000
28.000000000000000
J
8.4800
e
-
024
0.000000000000000
0.000000000000000
Mean
a
^
9.999999999992522
9.999999999999996
10.000000000000000
b
^
28.000000000000107
28.000000000000000
28.000000000000000
J
7.2633
e
-
021
1.0373
e
-
028
0.000000000000000
Worst
a
^
9.999999999950955
9.999999999999954
10.000000000000000
b
^
28.000000000009916
28.000000000000011
28.000000000000000
J
3.7208
e
-
020
1.2561
e
-
027
0.000000000000000Table 3
Statistical results of different approaches for two-dimensional parameter identification (a and c are unknown).
Index
DE/rand/1/bin
DE/best/1/bin
AIDE
Best
a
^
10.000000000000011
10.000000000000000
10.000000000000000
c
^
2.666666666666698
2.666666666666667
2.666666666666667
J
8.8682
e
-
024
0.000000000000000
0.000000000000000
Mean
a
^
9.999999999999748
10.000000000000011
10.000000000000000
c
^
2.666666666666668
2.666666666666665
2.666666666666667
J
3.8628
e
-
022
2.0355
e
-
028
0.000000000000000
Worst
a
^
10.000000000007114
10.000000000000023
10.000000000000000
c
^
2.666666666666092
2.666666666666663
2.666666666666667
J
3.7443
e
-
021
5.6290
e
-
028
0.000000000000000Table 4
Statistical results of different approaches for two-dimensional parameter identification (b and c are unknown).
Index
DE/rand/1/bin
DE/best/1/bin
AIDE
Best
b
^
27.999999999994451
28.000000000000000
28.000000000000000
c
^
2.666666666664585
2.666666666666667
2.666666666666667
J
8.7373
e
-
021
0.000000000000000
0.000000000000000
Mean
b
^
28.000000000004341
28.000000000000000
28.000000000000000
c
^
2.666666666667481
2.666666666666666
2.666666666666667
J
4.2924
e
-
019
8.8037
e
-
029
0.000000000000000
Worst
b
^
28.000000000194063
28.000000000000000
28.000000000000000
c
^
2.666666666707930
2.666666666666666
2.666666666666667
J
1.6599
e
-
018
8.8037
e
-
028
0.000000000000000Figure 4
The evolution process of Lorenz system when parametersa and b are unknown.Figure 5
The evolution process of Lorenz system when parametersa and c are unknown.Figure 6
The evolution process of Lorenz system when parametersb and c are unknown.From Tables2–4, it can be seen that high-quality solutions are obtained by AIDE and their values are all equal to the corresponding true values. Although the best results found by DE/best/1/bin are also equal to the true values, the worst results obtained by DE/best/1/bin are all worse than those of AIDE for the three cases, which shows that sometimes DE/best/1/bin may result in premature convergence and AIDE can achieve a good compromise between the exploration and the exploitation. In contrast, the performance of DE/rand/1/bin is the worst among the three methods. All these can also be confirmed from Figures 4–6, respectively.


#### 5.2.3. Simulation on Three-Dimensional Parameter Estimation

In this section, three-dimensional parameter estimation of Lorenz system is considered. In the case, the three parametersa, b, and c are all unknown and need to be identified. The results are shown in Table 5 in terms of best, mean, and worst of the results obtained in 20 independent runs by each algorithm. The evolution processes of unknown parameters and objective value are illustrated in Figure 7, respectively.Table 5
Statistical results of different approaches for three-dimensional parameter identification (a, b, and c are unknown).
Index
DE/rand/1/bin
DE/best/1/bin
AIDE
Best
a
^
10.000000000000000
10.000000000000000
10.000000000000000
b
^
28.000000000000000
28.000000000000000
28.000000000000000
c
^
2.666666666666667
2.666666666666667
2.666666666666667
J
0.000000000000000
0.000000000000000
0.000000000000000
Mean
a
^
10.000000000000000
9.999999999999996
10.000000000000000
b
^
28.000000000000000
28.000000000000000
28.000000000000000
c
^
2.666666666666666
2.666666666666666
2.666666666666667
J
2.6737
e
-
029
2.7318
e
-
028
0.000000000000000
Worst
a
^
10.000000000000007
9.999999999999941
10.000000000000000
b
^
27.999999999999996
28.000000000000014
28.000000000000000
c
^
2.666666666666665
2.666666666666674
2.666666666666667
J
1.4778
e
-
028
2.2160
e
-
027
0.000000000000000Figure 7
The evolution process of Lorenz system when parametersa, b, and c are unknown.As shown in Table5, all the results obtained by AIDE are still equal to the true values. AIDE is superior to both DE/rand/1/bin and DE/best/1/bin according to the mean value. Comparatively, DE/rand/1/bin is slightly better than DE/best/1/bin in terms of the mean and worst values. Namely, as parameter dimension increases, the performance of DE/best/1/bin is not consistently better than that of DE/rand/1/bin as before. This may be the reason that the guidance of the global best individual leads to the premature convergence of DE/best/1/bin. Instead, DE/rand/1/bin obtains a good convergence performance as the iterative generation increases. All in all, AIDE is more effective and robust than other two algorithms, which can also be seen from Figure 7. All these also demonstrate that the modifications of AIDE are effective for balancing the exploration and exploitation ability of it.


#### 5.2.4. Simulation on Lorenz System with Noise

Subsequently, the three-dimensional parameter estimation of Lorenz system with noise is considered again. As shown in Figure1, each system state vector (x1,x2,x3) is added with white noise in the range of [-0.1,0.1] in the experiment. Then AIDE was independently executed 20 times and the statistical results are given in Table 6. The parameter settings of AIDE in the case are the same as the aforementioned in Section 5.1.Table 6
Statistical results of AIDE for three-dimensional parameter identification of Lorenz system with noise.
Methods
Index
Best
Mean
Worst
AIDE
a
^
9.990801271058711
9.998131753034325
9.989687785636363
b
^
28.003818708942255
28.000608072179272
28.002414544105758
c
^
2.667512761713986
2.666799322681526
2.667073063185854
J
0.0077
0.0082
0.0085From Table6, it can also be observed that AIDE achieves good results when noise exists. In addition, the relative errors between the estimated values and the true values of parameters a, b, and c are approximately equal to 1e-4, 1e-5, and 1e-5, respectively, in terms of the mean values.


### 5.3. Comparison between GA, PSO, NMDE, and AIDE

In order to further validate the convergence performance of AIDE, it is compared with other well-known algorithms including genetic algorithm [19], particle swarm optimization [16], and NMDE [14] again.In view of very good results obtained by NMDE, for convenience, three-dimensional parameter estimation is considered in this section. The parameter settings of AIDE are the same as the aforementioned. Namely, the population size is set to 120 and the maximum generation is set to 100 for GA, PSO, and NMDE, which is the same as those employed in the literatures [14, 16]. Thus, there are about 300 generations in AIDE when the population size is fixed to 40 for a fair comparison. Next, the comparison results are listed in Table 7, where the results of GA, PSO, and NMDE are directly taken from the literatures [14, 16] for the sake of reliability.Table 7
Statistical results of different methods for three-dimensional parameter identification of Lorenz system.
Index
GA
PSO
NMDE
AIDE
Best
a
^
10.067167
9.995332
10.000003
10.000000000000000
b
^
27.922058
28.007146
28.000002
28.000000000000000
c
^
2.663426
2.667013
2.666667
2.666666666666667
J
4.310715
0.048645
0.000000
0.000000000000000
Mean
a
^
10.139783
10.018417
10.000009
10.000000000000000
b
^
27.742735
27.993390
28.999980
28.000000000000000
c
^
2.648585
2.666281
2.666666
2.666666666666667
J
943.762894
4.182781
0.000007
0.000000000000000
Worst
a
^
10.929003
10.608212
10.000223
10.000000000000000
b
^
26.127605
27.704424
27.999848
28.000000000000000
c
^
2.560249
2.657231
2.666660
2.666666666666667
J
6461.48006
39.406026
0.000033
0.000000000000000
Bold entities mean the best results.From Table7, it can be found that the best objective value obtained by NMDE is equal to that searched by AIDE, but the quality of best solutions (a, b, and c) obtained by NMDE is worse than that of solutions obtained by AIDE. In particular, the worst results obtained by NMDE are obviously inferior to those found by AIDE. However, NMDE is obviously superior to both GA and PSO. Therefore, AIDE is the best algorithm among the four approaches for parameter identification of chaotic systems.


## 5.1. Typical Systems and Parameter Settings

In this section, comprehensive experiments are conducted to verify the effectiveness of AIDE. As a typical chaotic system, Lorenz system is taken as an example. The Lorenz system is mathematically formulated as follows:(9)x˙1=a·x2-x1,x˙2=b·x1-x1·x3-x2,x˙3=x1·x2-c·x3,where a=10, b=28, and c=8/3 are the original parameters and the system displays a chaotic attractor as shown in Figure 2.Figure 2
The chaotic attractor of Lorenz system.During the process of parameter estimation for Lorenz system, the fourth order Runge-Kutta algorithm is employed to obtain state vector in our simulation, where the step sizeh is set to 0.01 and the length of samples is selected as M=300. At first, let Lorenz system evolve freely from a random initial state and choose any point as the initial state X0 of system after a period of transient process. Next, successive M state vectors of both the original system and the estimated system are used to calculate the objective J as shown in (3). Last, the aim of minimizing the objective J is to search a suitable set of parameters θ.For a fair comparison, the searching ranges are set as follows:a∈[9,11], b∈[20,30], and c∈[2,3], which are also used in [14, 16, 21, 22]. In addition, the maximum cycle number MCN is taken as 100, and the population size Np is set as 20, 40, and 120 when the number of unknown parameters is 1, 2, and 3, respectively, in the literature [14]. That is, the maximum number of function evaluations (maxFEs) is 2000 (20∗100), 4000 (40∗100), and 12000 (120∗100) when the number of unknown parameters is 1, 2, and 3, respectively. That is, for fixed population size in AIDE, that is, Np=40, the MCN is set as 50 (2000/40), 100 (4000/40), and 300 (12000/40) when the number of unknown parameters is 1, 2, and 3, respectively.In order to further demonstrate the effectiveness of AIDE, it is first compared with DE/best/1/bin and DE/rand/1/bin. The population sizeNp is set to 40 for all cases of the three algorithms. The maximum cycle number of the three algorithms is the same as aforementioned. Some other common parameters settings of the three algorithms are also similar to each other; that is, Cr=0.9 and F=0.5. What is more, in AIDE, the parameter limit is set to 10, the parameter limitA is set to 1000, and the parameter limitB is set to 500 by trial and error.


## 5.2. Comparison between AIDE, DE/best/1/bin, and DE/rand/1/bin

### 5.2.1. Simulation on One-Dimensional Parameter Estimation

First, experiments tested on three one-dimensional parameter estimation cases are conducted. That is, only one parameter among parametersa, b, and c is unknown and needs to be identified at a time. In addition, each algorithm is run twenty times independently for each case, respectively. The statistical results obtained by AIDE, DE/best/1/bin, and DE/rand/1/bin for the three cases are listed in Table 1. Meanwhile, the evolution process of unknown parameters (a, b, and c) and average of objective function values J are plotted in Figure 3.Table 1
Statistical results of different approaches for one-dimensional parameter estimation.
Approaches
Index
Best
Mean
Worst
DE_rand
a
^
10.000000000000009
9.999999999999984
10.000000000001773
J
2.2985
e
-
027
1.6365
e
-
024
1.6950
e
-
023
DE_best
a
^
10.000000000000000
10.000000000000000
10.000000000000000
J
0.000000000000000
0.000000000000000
0.000000000000000
AIDE
a
^
10.000000000000000
10.000000000000000
10.000000000000000
J
0.000000000000000
0.000000000000000
0.000000000000000
DE_rand
b
^
27.999999999999936
28.000000000005393
27.999999999965191
J
1.3657
e
-
024
1.0048
e
-
019
5.8964
e
-
019
DE_best
b
^
28.000000000000000
28.000000000000000
28.000000000000000
J
0.000000000000000
0.000000000000000
0.000000000000000
AIDE
b
^
28.000000000000000
28.000000000000000
28.000000000000000
J
0.000000000000000
0.000000000000000
0.000000000000000
DE_rand
c
^
2.666666666666673
2.666666666666710
2.666666666666033
J
4.4737
e
-
025
4.9702
e
-
022
3.7970
e
-
021
DE_best
c
^
2.666666666666667
2.666666666666667
2.666666666666667
J
0.000000000000000
0.000000000000000
0.000000000000000
AIDE
c
^
2.666666666666667
2.666666666666667
2.666666666666667
J
0.000000000000000
0.000000000000000
0.000000000000000
DE_rand stands for DE/rand/1/bin and DE_best means DE/best/1/bin.Figure 3
The evolution process of Lorenz system with one unknown parameter.
(a)
(b)
(c)
(d)
(e)
(f)From Table1, it can be seen that DE/rand/1/bin is worse than both DE/best/1/bin and AIDE, which shows that the convergence speed of DE/rand/1/bin is slow. Furthermore, the objective values obtained by AIDE and DE/best/1/bin are all zero, which means that the estimated value of a, b, and c identified by AIDE and DE/best/1/bin is exactly equal to the true value of the corresponding parameter, respectively. Nevertheless, the convergence speed of DE/best/1/bin is slower than that of AIDE, which can be found from Figure 3, which indicates that the combination of the two mutation strategies is more favourable to speed up the convergence of AIDE than DE/best/1/bin itself. That is, sometimes the mutation strategy DE/pbest/1/bin may work better than DE/best/1bin.


### 5.2.2. Simulation on Two-Dimensional Parameter Estimation

Second, Experimental study about three two-dimensional parameter estimation cases is carried out. At this time, two of the three parameters are unknown and need to be identified. The corresponding statistical results are listed in Tables2–4, respectively. The corresponding evolution processes of both unknown parameters and objective values are illustrated in Figures 4–6, respectively.Table 2
Statistical results of different approaches for two-dimensional parameter identification (a and b are unknown).
Index
DE/rand/1/bin
DE/best/1/bin
AIDE
Best
a
^
9.999999999999080
10.000000000000000
10.000000000000000
b
^
28.000000000000142
28.000000000000000
28.000000000000000
J
8.4800
e
-
024
0.000000000000000
0.000000000000000
Mean
a
^
9.999999999992522
9.999999999999996
10.000000000000000
b
^
28.000000000000107
28.000000000000000
28.000000000000000
J
7.2633
e
-
021
1.0373
e
-
028
0.000000000000000
Worst
a
^
9.999999999950955
9.999999999999954
10.000000000000000
b
^
28.000000000009916
28.000000000000011
28.000000000000000
J
3.7208
e
-
020
1.2561
e
-
027
0.000000000000000Table 3
Statistical results of different approaches for two-dimensional parameter identification (a and c are unknown).
Index
DE/rand/1/bin
DE/best/1/bin
AIDE
Best
a
^
10.000000000000011
10.000000000000000
10.000000000000000
c
^
2.666666666666698
2.666666666666667
2.666666666666667
J
8.8682
e
-
024
0.000000000000000
0.000000000000000
Mean
a
^
9.999999999999748
10.000000000000011
10.000000000000000
c
^
2.666666666666668
2.666666666666665
2.666666666666667
J
3.8628
e
-
022
2.0355
e
-
028
0.000000000000000
Worst
a
^
10.000000000007114
10.000000000000023
10.000000000000000
c
^
2.666666666666092
2.666666666666663
2.666666666666667
J
3.7443
e
-
021
5.6290
e
-
028
0.000000000000000Table 4
Statistical results of different approaches for two-dimensional parameter identification (b and c are unknown).
Index
DE/rand/1/bin
DE/best/1/bin
AIDE
Best
b
^
27.999999999994451
28.000000000000000
28.000000000000000
c
^
2.666666666664585
2.666666666666667
2.666666666666667
J
8.7373
e
-
021
0.000000000000000
0.000000000000000
Mean
b
^
28.000000000004341
28.000000000000000
28.000000000000000
c
^
2.666666666667481
2.666666666666666
2.666666666666667
J
4.2924
e
-
019
8.8037
e
-
029
0.000000000000000
Worst
b
^
28.000000000194063
28.000000000000000
28.000000000000000
c
^
2.666666666707930
2.666666666666666
2.666666666666667
J
1.6599
e
-
018
8.8037
e
-
028
0.000000000000000Figure 4
The evolution process of Lorenz system when parametersa and b are unknown.Figure 5
The evolution process of Lorenz system when parametersa and c are unknown.Figure 6
The evolution process of Lorenz system when parametersb and c are unknown.From Tables2–4, it can be seen that high-quality solutions are obtained by AIDE and their values are all equal to the corresponding true values. Although the best results found by DE/best/1/bin are also equal to the true values, the worst results obtained by DE/best/1/bin are all worse than those of AIDE for the three cases, which shows that sometimes DE/best/1/bin may result in premature convergence and AIDE can achieve a good compromise between the exploration and the exploitation. In contrast, the performance of DE/rand/1/bin is the worst among the three methods. All these can also be confirmed from Figures 4–6, respectively.


### 5.2.3. Simulation on Three-Dimensional Parameter Estimation

In this section, three-dimensional parameter estimation of Lorenz system is considered. In the case, the three parametersa, b, and c are all unknown and need to be identified. The results are shown in Table 5 in terms of best, mean, and worst of the results obtained in 20 independent runs by each algorithm. The evolution processes of unknown parameters and objective value are illustrated in Figure 7, respectively.Table 5
Statistical results of different approaches for three-dimensional parameter identification (a, b, and c are unknown).
Index
DE/rand/1/bin
DE/best/1/bin
AIDE
Best
a
^
10.000000000000000
10.000000000000000
10.000000000000000
b
^
28.000000000000000
28.000000000000000
28.000000000000000
c
^
2.666666666666667
2.666666666666667
2.666666666666667
J
0.000000000000000
0.000000000000000
0.000000000000000
Mean
a
^
10.000000000000000
9.999999999999996
10.000000000000000
b
^
28.000000000000000
28.000000000000000
28.000000000000000
c
^
2.666666666666666
2.666666666666666
2.666666666666667
J
2.6737
e
-
029
2.7318
e
-
028
0.000000000000000
Worst
a
^
10.000000000000007
9.999999999999941
10.000000000000000
b
^
27.999999999999996
28.000000000000014
28.000000000000000
c
^
2.666666666666665
2.666666666666674
2.666666666666667
J
1.4778
e
-
028
2.2160
e
-
027
0.000000000000000Figure 7
The evolution process of Lorenz system when parametersa, b, and c are unknown.As shown in Table5, all the results obtained by AIDE are still equal to the true values. AIDE is superior to both DE/rand/1/bin and DE/best/1/bin according to the mean value. Comparatively, DE/rand/1/bin is slightly better than DE/best/1/bin in terms of the mean and worst values. Namely, as parameter dimension increases, the performance of DE/best/1/bin is not consistently better than that of DE/rand/1/bin as before. This may be the reason that the guidance of the global best individual leads to the premature convergence of DE/best/1/bin. Instead, DE/rand/1/bin obtains a good convergence performance as the iterative generation increases. All in all, AIDE is more effective and robust than other two algorithms, which can also be seen from Figure 7. All these also demonstrate that the modifications of AIDE are effective for balancing the exploration and exploitation ability of it.


### 5.2.4. Simulation on Lorenz System with Noise

Subsequently, the three-dimensional parameter estimation of Lorenz system with noise is considered again. As shown in Figure1, each system state vector (x1,x2,x3) is added with white noise in the range of [-0.1,0.1] in the experiment. Then AIDE was independently executed 20 times and the statistical results are given in Table 6. The parameter settings of AIDE in the case are the same as the aforementioned in Section 5.1.Table 6
Statistical results of AIDE for three-dimensional parameter identification of Lorenz system with noise.
Methods
Index
Best
Mean
Worst
AIDE
a
^
9.990801271058711
9.998131753034325
9.989687785636363
b
^
28.003818708942255
28.000608072179272
28.002414544105758
c
^
2.667512761713986
2.666799322681526
2.667073063185854
J
0.0077
0.0082
0.0085From Table6, it can also be observed that AIDE achieves good results when noise exists. In addition, the relative errors between the estimated values and the true values of parameters a, b, and c are approximately equal to 1e-4, 1e-5, and 1e-5, respectively, in terms of the mean values.


## 5.2.1. Simulation on One-Dimensional Parameter Estimation

First, experiments tested on three one-dimensional parameter estimation cases are conducted. That is, only one parameter among parametersa, b, and c is unknown and needs to be identified at a time. In addition, each algorithm is run twenty times independently for each case, respectively. The statistical results obtained by AIDE, DE/best/1/bin, and DE/rand/1/bin for the three cases are listed in Table 1. Meanwhile, the evolution process of unknown parameters (a, b, and c) and average of objective function values J are plotted in Figure 3.Table 1
Statistical results of different approaches for one-dimensional parameter estimation.
Approaches
Index
Best
Mean
Worst
DE_rand
a
^
10.000000000000009
9.999999999999984
10.000000000001773
J
2.2985
e
-
027
1.6365
e
-
024
1.6950
e
-
023
DE_best
a
^
10.000000000000000
10.000000000000000
10.000000000000000
J
0.000000000000000
0.000000000000000
0.000000000000000
AIDE
a
^
10.000000000000000
10.000000000000000
10.000000000000000
J
0.000000000000000
0.000000000000000
0.000000000000000
DE_rand
b
^
27.999999999999936
28.000000000005393
27.999999999965191
J
1.3657
e
-
024
1.0048
e
-
019
5.8964
e
-
019
DE_best
b
^
28.000000000000000
28.000000000000000
28.000000000000000
J
0.000000000000000
0.000000000000000
0.000000000000000
AIDE
b
^
28.000000000000000
28.000000000000000
28.000000000000000
J
0.000000000000000
0.000000000000000
0.000000000000000
DE_rand
c
^
2.666666666666673
2.666666666666710
2.666666666666033
J
4.4737
e
-
025
4.9702
e
-
022
3.7970
e
-
021
DE_best
c
^
2.666666666666667
2.666666666666667
2.666666666666667
J
0.000000000000000
0.000000000000000
0.000000000000000
AIDE
c
^
2.666666666666667
2.666666666666667
2.666666666666667
J
0.000000000000000
0.000000000000000
0.000000000000000
DE_rand stands for DE/rand/1/bin and DE_best means DE/best/1/bin.Figure 3
The evolution process of Lorenz system with one unknown parameter.
(a)
(b)
(c)
(d)
(e)
(f)From Table1, it can be seen that DE/rand/1/bin is worse than both DE/best/1/bin and AIDE, which shows that the convergence speed of DE/rand/1/bin is slow. Furthermore, the objective values obtained by AIDE and DE/best/1/bin are all zero, which means that the estimated value of a, b, and c identified by AIDE and DE/best/1/bin is exactly equal to the true value of the corresponding parameter, respectively. Nevertheless, the convergence speed of DE/best/1/bin is slower than that of AIDE, which can be found from Figure 3, which indicates that the combination of the two mutation strategies is more favourable to speed up the convergence of AIDE than DE/best/1/bin itself. That is, sometimes the mutation strategy DE/pbest/1/bin may work better than DE/best/1bin.


## 5.2.2. Simulation on Two-Dimensional Parameter Estimation

Second, Experimental study about three two-dimensional parameter estimation cases is carried out. At this time, two of the three parameters are unknown and need to be identified. The corresponding statistical results are listed in Tables2–4, respectively. The corresponding evolution processes of both unknown parameters and objective values are illustrated in Figures 4–6, respectively.Table 2
Statistical results of different approaches for two-dimensional parameter identification (a and b are unknown).
Index
DE/rand/1/bin
DE/best/1/bin
AIDE
Best
a
^
9.999999999999080
10.000000000000000
10.000000000000000
b
^
28.000000000000142
28.000000000000000
28.000000000000000
J
8.4800
e
-
024
0.000000000000000
0.000000000000000
Mean
a
^
9.999999999992522
9.999999999999996
10.000000000000000
b
^
28.000000000000107
28.000000000000000
28.000000000000000
J
7.2633
e
-
021
1.0373
e
-
028
0.000000000000000
Worst
a
^
9.999999999950955
9.999999999999954
10.000000000000000
b
^
28.000000000009916
28.000000000000011
28.000000000000000
J
3.7208
e
-
020
1.2561
e
-
027
0.000000000000000Table 3
Statistical results of different approaches for two-dimensional parameter identification (a and c are unknown).
Index
DE/rand/1/bin
DE/best/1/bin
AIDE
Best
a
^
10.000000000000011
10.000000000000000
10.000000000000000
c
^
2.666666666666698
2.666666666666667
2.666666666666667
J
8.8682
e
-
024
0.000000000000000
0.000000000000000
Mean
a
^
9.999999999999748
10.000000000000011
10.000000000000000
c
^
2.666666666666668
2.666666666666665
2.666666666666667
J
3.8628
e
-
022
2.0355
e
-
028
0.000000000000000
Worst
a
^
10.000000000007114
10.000000000000023
10.000000000000000
c
^
2.666666666666092
2.666666666666663
2.666666666666667
J
3.7443
e
-
021
5.6290
e
-
028
0.000000000000000Table 4
Statistical results of different approaches for two-dimensional parameter identification (b and c are unknown).
Index
DE/rand/1/bin
DE/best/1/bin
AIDE
Best
b
^
27.999999999994451
28.000000000000000
28.000000000000000
c
^
2.666666666664585
2.666666666666667
2.666666666666667
J
8.7373
e
-
021
0.000000000000000
0.000000000000000
Mean
b
^
28.000000000004341
28.000000000000000
28.000000000000000
c
^
2.666666666667481
2.666666666666666
2.666666666666667
J
4.2924
e
-
019
8.8037
e
-
029
0.000000000000000
Worst
b
^
28.000000000194063
28.000000000000000
28.000000000000000
c
^
2.666666666707930
2.666666666666666
2.666666666666667
J
1.6599
e
-
018
8.8037
e
-
028
0.000000000000000Figure 4
The evolution process of Lorenz system when parametersa and b are unknown.Figure 5
The evolution process of Lorenz system when parametersa and c are unknown.Figure 6
The evolution process of Lorenz system when parametersb and c are unknown.From Tables2–4, it can be seen that high-quality solutions are obtained by AIDE and their values are all equal to the corresponding true values. Although the best results found by DE/best/1/bin are also equal to the true values, the worst results obtained by DE/best/1/bin are all worse than those of AIDE for the three cases, which shows that sometimes DE/best/1/bin may result in premature convergence and AIDE can achieve a good compromise between the exploration and the exploitation. In contrast, the performance of DE/rand/1/bin is the worst among the three methods. All these can also be confirmed from Figures 4–6, respectively.


## 5.2.3. Simulation on Three-Dimensional Parameter Estimation

In this section, three-dimensional parameter estimation of Lorenz system is considered. In the case, the three parametersa, b, and c are all unknown and need to be identified. The results are shown in Table 5 in terms of best, mean, and worst of the results obtained in 20 independent runs by each algorithm. The evolution processes of unknown parameters and objective value are illustrated in Figure 7, respectively.Table 5
Statistical results of different approaches for three-dimensional parameter identification (a, b, and c are unknown).
Index
DE/rand/1/bin
DE/best/1/bin
AIDE
Best
a
^
10.000000000000000
10.000000000000000
10.000000000000000
b
^
28.000000000000000
28.000000000000000
28.000000000000000
c
^
2.666666666666667
2.666666666666667
2.666666666666667
J
0.000000000000000
0.000000000000000
0.000000000000000
Mean
a
^
10.000000000000000
9.999999999999996
10.000000000000000
b
^
28.000000000000000
28.000000000000000
28.000000000000000
c
^
2.666666666666666
2.666666666666666
2.666666666666667
J
2.6737
e
-
029
2.7318
e
-
028
0.000000000000000
Worst
a
^
10.000000000000007
9.999999999999941
10.000000000000000
b
^
27.999999999999996
28.000000000000014
28.000000000000000
c
^
2.666666666666665
2.666666666666674
2.666666666666667
J
1.4778
e
-
028
2.2160
e
-
027
0.000000000000000Figure 7
The evolution process of Lorenz system when parametersa, b, and c are unknown.As shown in Table5, all the results obtained by AIDE are still equal to the true values. AIDE is superior to both DE/rand/1/bin and DE/best/1/bin according to the mean value. Comparatively, DE/rand/1/bin is slightly better than DE/best/1/bin in terms of the mean and worst values. Namely, as parameter dimension increases, the performance of DE/best/1/bin is not consistently better than that of DE/rand/1/bin as before. This may be the reason that the guidance of the global best individual leads to the premature convergence of DE/best/1/bin. Instead, DE/rand/1/bin obtains a good convergence performance as the iterative generation increases. All in all, AIDE is more effective and robust than other two algorithms, which can also be seen from Figure 7. All these also demonstrate that the modifications of AIDE are effective for balancing the exploration and exploitation ability of it.


## 5.2.4. Simulation on Lorenz System with Noise

Subsequently, the three-dimensional parameter estimation of Lorenz system with noise is considered again. As shown in Figure1, each system state vector (x1,x2,x3) is added with white noise in the range of [-0.1,0.1] in the experiment. Then AIDE was independently executed 20 times and the statistical results are given in Table 6. The parameter settings of AIDE in the case are the same as the aforementioned in Section 5.1.Table 6
Statistical results of AIDE for three-dimensional parameter identification of Lorenz system with noise.
Methods
Index
Best
Mean
Worst
AIDE
a
^
9.990801271058711
9.998131753034325
9.989687785636363
b
^
28.003818708942255
28.000608072179272
28.002414544105758
c
^
2.667512761713986
2.666799322681526
2.667073063185854
J
0.0077
0.0082
0.0085From Table6, it can also be observed that AIDE achieves good results when noise exists. In addition, the relative errors between the estimated values and the true values of parameters a, b, and c are approximately equal to 1e-4, 1e-5, and 1e-5, respectively, in terms of the mean values.


## 5.3. Comparison between GA, PSO, NMDE, and AIDE

In order to further validate the convergence performance of AIDE, it is compared with other well-known algorithms including genetic algorithm [19], particle swarm optimization [16], and NMDE [14] again.In view of very good results obtained by NMDE, for convenience, three-dimensional parameter estimation is considered in this section. The parameter settings of AIDE are the same as the aforementioned. Namely, the population size is set to 120 and the maximum generation is set to 100 for GA, PSO, and NMDE, which is the same as those employed in the literatures [14, 16]. Thus, there are about 300 generations in AIDE when the population size is fixed to 40 for a fair comparison. Next, the comparison results are listed in Table 7, where the results of GA, PSO, and NMDE are directly taken from the literatures [14, 16] for the sake of reliability.Table 7
Statistical results of different methods for three-dimensional parameter identification of Lorenz system.
Index
GA
PSO
NMDE
AIDE
Best
a
^
10.067167
9.995332
10.000003
10.000000000000000
b
^
27.922058
28.007146
28.000002
28.000000000000000
c
^
2.663426
2.667013
2.666667
2.666666666666667
J
4.310715
0.048645
0.000000
0.000000000000000
Mean
a
^
10.139783
10.018417
10.000009
10.000000000000000
b
^
27.742735
27.993390
28.999980
28.000000000000000
c
^
2.648585
2.666281
2.666666
2.666666666666667
J
943.762894
4.182781
0.000007
0.000000000000000
Worst
a
^
10.929003
10.608212
10.000223
10.000000000000000
b
^
26.127605
27.704424
27.999848
28.000000000000000
c
^
2.560249
2.657231
2.666660
2.666666666666667
J
6461.48006
39.406026
0.000033
0.000000000000000
Bold entities mean the best results.From Table7, it can be found that the best objective value obtained by NMDE is equal to that searched by AIDE, but the quality of best solutions (a, b, and c) obtained by NMDE is worse than that of solutions obtained by AIDE. In particular, the worst results obtained by NMDE are obviously inferior to those found by AIDE. However, NMDE is obviously superior to both GA and PSO. Therefore, AIDE is the best algorithm among the four approaches for parameter identification of chaotic systems.


## 6. Conclusion

Through designing an appropriate objective function, parameter identification of chaotic systems is mathematically formulated as a global multidimensional optimization problem. Then, an alternate iterative differential algorithm, AIDE for short, is presented to solve the global optimization problem. First, a new mutation strategy DE/pbest/1 is proposed in AIDE. Second, the new mutation strategy and DE/best/1 are run alternately in AIDE. Meanwhile, a greedy selection mechanism is improved and employed. Last, a mutation mechanism like scout bees operation of artificial bee colony algorithm is introduced in order to better keep the population diversity. When compared with two variants of DE, that is, DE/rand/1/bin and DE/best/1/bin, the experimental results show that AIDE is better than both DE/rand/1/bin and DE/best/1/bin, which means that AIDE is effective to achieve a compromise between the exploration and exploitation. Subsequently, a comparison between AIDE and other four famous metaheuristics is conducted. The comparison results demonstrate that AIDE outperforms GA, PSO, and NMDE. All these show that AIDE is an efficient and powerful tool for parameter identification of chaotic systems.



---

*Source: 740721-2015-10-04.xml*