Research Article  Open Access
An Allele RealCoded Quantum Evolutionary Algorithm Based on Hybrid Updating Strategy
Abstract
For improving convergence rate and preventing prematurity in quantum evolutionary algorithm, an allele realcoded quantum evolutionary algorithm based on hybrid updating strategy is presented. The real variables are coded with probability superposition of allele. A hybrid updating strategy balancing the global search and local search is presented in which the superior allele is defined. On the basis of superior allele and inferior allele, a guided evolutionary process as well as updating allele with variable scale contraction is adopted. And gate is introduced to prevent prematurity. Furthermore, the global convergence of proposed algorithm is proved by Markov chain. Finally, the proposed algorithm is compared with genetic algorithm, quantum evolutionary algorithm, and double chains quantum genetic algorithm in solving continuous optimization problem, and the experimental results verify the advantages on convergence rate and search accuracy.
1. Introduction
Quantum computing is a new class of computing algorithms based on the concepts and principles of quantum theory, such as superposition of quantum states, entanglement, and intervention. Quantum evolutionary algorithm (QEA) is proposed by combining quantum theory with evolutionary theory. It is a kind of evolutionary algorithm with the form of quantum chromosome; the random observation which simulates the quantum collapse can bring diverse individuals [1]. In QEA, the quantum bits (Qbits) and quantum gate (Qgate) have been used to update the individuals to realize evolutionary search. QEA has advantages, including the diversity of population, global search performance, and convergence rate, compared with other evolutionary algorithms due to Qbits coding and the updating of rotation gate. Since then, QEA were developed, including different operators [2–5] and novel update strategy for Qgates [6–9]. QEA has been applied in many optimization problems [10, 11]. However, frequent encoding and decoding in QEA will slow down convergence rate. In addition, the magnitude and the direction of the rotational angle of quantum rotation gates cannot be determined during optimization.
Recently, numerous literatures on QEA have been reported. Han and Kim [12] proposed a quantuminspired evolutionary algorithm with gate in which the probability amplitudes of rotation gate converge to and . Chen et al. [13] proposed a rotation gate with chaos in QEA. It applied generated chaotic sequence beforehand at the updating of rotation gate to improve the computational speed. Yang et al. [14] proposed a rotation gate based on arithmetic guidance. In the proposed algorithm, the current optimal individuals transfer to next generation. S. Y. Li and P. C. Li [15] proposed the double chains quantum genetic algorithm (DCQGA) which mapped the real variables to the probability amplitude on Qbit by transforming the solution space; in particular, a real Qbit encoding can be used to avoid binary coding. da Cruz et al. [16] proposed a realcoded quantum evolutionary algorithm in which the solution space is expressed by rectangular region. Its outstanding performance in solving high dimensional continuous optimization problems was verified. P. Li and S. Li [17] proposed a Bloch spherical coding for QEA which can avoid local optimization in solving continuous optimization problems. Gao et al. [18] proposed a realcoded quantum evolutionary algorithm based on triploid coding. Zhang et al. [19] proposed fourchain quantuminspired evolutionary algorithm in which a chromosome contains four gene chains. The above quantum evolutionary algorithms introduce Qbit encoding and increase diversity of population but spend much time on encoding and decoding; meanwhile, the search process may fall into local minimum and prematurity. So it is very important for us to employ a novel updating strategy in order to improve convergence rate and prevent the premature.
In this paper, we presented an allele realcoded quantum evolutionary algorithm (ARQEA) based on hybrid updating strategy. The proposed algorithm employs a realcoding to maintain the diversity of allele and introduces a hybrid updating strategy to balance performance between global search and local search in order to improve the convergence rate. The convergence of ARQEA is verified by Markov chain. The numerical examples verify the advantages of ARQEA on convergence rate and search accuracy.
The remainder of this paper is organized as follows: in Section 2, an allele realcoded quantum evolutionary algorithm is proposed in which the real coding as well as hybrid update strategy is presented; in Section 3, the global convergence of proposed algorithm is verified by Markov chain. Finally, the numerical experiments are demonstrated and the advantages are verified in Section 4.
2. An Allele RealCoded Quantum Evolutionary Algorithm
In ARQEA, the real variables are coding with probability superposition of allele. A hybrid evolutionary strategy balancing the global search and local search is presented in which the superior allele is defined. The supervised evolution as well as variable scale contraction is adopted, and gate is introduced to prevent the premature convergence.
2.1. Real Coding for Allele
We present an allele real coding which will generate two continuous variables and ( and are defined as the th alleles) to replace 0 and 1 gene of Qbit coding in QEA. The real coding iswhere is the number of variables.
The probability amplitudes of allele are expressed as trigonometric functions and :where and are the probability amplitudes of and ; the initial value of is , .
Then the observed probability of and is and , respectively. So
We employ the probability superposition to maintain the diversity for individual in real coding. And the proposed real coding prevents overlong chromosome length and saves time spent on encoding and decoding.
2.2. Hybrid Updating Strategy
In ARQEA, we adopt hybrid updating strategy to update allele and its probability amplitudes.
2.2.1. Updating Alleles
Firstly, we encode initial population on the basis of allele real coding scheme, compute the fitness of chromosomes, and recode the superior individual . Then we compare the distances between the th alleles and and define the allele corresponding to the shorter distance with as “superior allele,” the other one as “inferior allele.” Figure 1 shows the superior and inferior alleles, in which and are the th alleles of chromosome, is the th allele of the current optimal individual, and then we define as the superior allele and as the inferior allele.
Next, we will update the alleles. The updating strategy is described as follows:
(a) For the superior allele, we employ the updating strategy, such as reasonable choice of the initial step length and dynamic adjustment of the search step length, to guide superior allele to search optimal solution.
In the early search stage, the updating strategy is accelerated by directing the search directionwhere is a superior allele, is the updated allele, is the search step length, usually , and is a sign function; it decides the search direction of superior allele.
When is less than , we adopt a variable scale contraction to search the optimal solutionwhere is the number of current generation, is the number of max generation, is a random distribution between −1 and 1, is a change from 1 to 0 with the number of generation , and is the range of contraction. When is a negative number, .
In this search stage, the superior allele will randomly search the optimal solution in a certain region, and the searching scale will change with the number of generation .
(b) For the inferior allele , the allele will be substituted to in (4) and (5) and alternate operation every two generations using (4) and (5).
However, considering the randomness of the evolutionary algorithm, the inferior allele has the ability to escape from local optimum and approach the global optimum in the evolution stage.
2.2.2. Updating Probability Amplitudes
After updating the allele, gate is used to update the corresponding probability amplitudes [20, 21]. We employ gate operation to prevent the premature convergence. The rotation angle of gate iswhere is the range of and its direction depends on the superior allele.
If the superior allele corresponds to , then (6) is subtracting. Instead, it is adding. The gate operation will increase the observed probability for the superior allele and decrease the observed probability for the inferior allele.
The operation rule of gate is the following:(a)if and , then ;(b)if and , then ;(c)else ,where is a real number between 0 and 1, are the probability amplitudes after the gate operation, and are the probability amplitudes after the gate operation.
The steps of hybrid evolutionary strategy are described as follows.
Step 1. Judge the relative superior allele.
Step 2. For the superior allele, adopt supervised evolution by (4) to find current optimal allele , and employ variable scale contraction by (5) approach to local search when is less than .
Step 3. For the inferior allele, search alternately by (4) and (5) in every two generations.
Step 4. Update the probability amplitudes of alleles by (6).
In hybrid updating strategy, we employ different evolutionary mode for superior and inferior allele in order to balance global search and local search. The superior allele affects local search stage, and inferior allele plays important role in global search by the variable scale contraction to search unknown space and maintain the diversity of population. As generation goes on, superior allele and inferior allele exchange position in next generation dynamically. The hybrid updating strategy proposed has two mechanisms for superior and inferior allele to maintain diversity of population. In addition, the hybrid updating strategy in ARQEA balances the global search and local search by dynamic updating strategy of alleles.
2.3. Process of ARQEA
ARQEA employs allele real coding with probability superposition which generates a random number between 0 and 1 and compares with the probability amplitudes for each allele and adopts hybrid updating strategy to balance global search and local search. At the early search stage, the scale of mutation is large, the step size in search is long, and the algorithm approaches to the global search. With the increasing of generations, the scale of mutation becomes smaller and the performance of local search is strengthened. The process of ARQEA is shown in Figure 2.
3. Convergence Analyses
In this section, we analyze the global convergence of ARQEA by Markov chain. The ARQEA is described as follows.
Consider ARQEA:where is search space, is the evolutionary operator of superior allele, is the evolutionary operator of inferior allele, is the operator of probability selection, is the dimension of , is initial population, , , and are the superior allele, the inferior allele, and the observed allele in th generation, respectively, is the fitness function, is the optimal solution and is optimal value of the fitness function, and is the termination criterion.
According to the hybrid update strategy, the population sequence of ARQEA can be expressed as follows:
In (8), relates to the state of generations .
Then, the state space of ARQEA can be expressed aswhere ; and are the upper bound and lower bound of the th variable. So ARQEA can be regarded as a finite Markov process.
Then the state space is divided into two search spaces according to the termination criteria:(a);(b).
We define as the transition probability from to , as the transition probability from to , and as the transition probability from to . And .
Lemma A (see [22]). Assume are the event sequence in probability space, and let ; if , then ; if and all are mutually independent, then .
Theorem A. , make in ARQEA.
Proof. , when and , then , in which ; if , then .
The variable scale contraction in ARQEA is Gaussian distribution. If the individual in performs variable scale contraction operation and obtained , then Since is Gaussian distribution , the probability density isBecausethenBecause depends on Gaussian distribution and is continuous, thenLet ; we can obtain following equation by (11) and (14):
Theorem B. If onestep transition probability in ARQEA , then ARQEA is global convergence.
Proof. For the termination criterion , when the probability , cannot satisfy the termination criterion after generations; we can obtain (16) by Theorem A:and , so ; we can get (17) by Lemma A:So . That is, ARQEA can converge to the optimal solution with probability 1.
4. Experiments and Results Analysis
In this section, we investigate the search ability of ARQEA by eight test functions and compare the results with GA, QEA, and DCQGA. And the above optimization algorithms are encoded in MATLAB 2010b and implemented on computer with Intel T3200 CPU and 2 G DDR3 memory using Windows XP.
The test functions are listed in Table 1. The test functions contain trigonometric function, polynomial function, and exponential function in the list. And , , and are twodimension multiple hump functions; , , , , and are high dimension functions. Each test function has only one optimal solution in feasible region, in which the minimum of and is 0 at , the minimum of is 0 at , and the minimum of test functions , , , , and is 0 at . However, the test functions with high dimension will bring more difficulty in global and local search process.

In this experiment, the population size is 50 for GA, QEA, DCQGA, and ARQEA; the max generation is 500 for twodimension test functions , , and , and 3000 for high dimension test functions , , , , and . And the coding for GA, QEA, DCQGA, and ARQEA is implemented, respectively, as follows:(a)GA adopts real coding. The real coding is adapted to every variable in GA. The selection operation employs roulette wheel selection, crossover probability is 0.8, and mutation probability is 0.01. The real coding for chromosome is(b)QEA adopts Qbit coding. The length of every variable is 12. The updating strategy employs the rotating gate based on check table. The coding for the th individual with variables is(c)DCQGA adopts double chain realcoding scheme. The step size of rotation angle is ; mutation probability is 0.05; the coding for the th individual with variables is where and . and represent a chromosome pair that maps the unit space of dimensions to the solution space by solution space transformation.(d)ARQEA adopts real coding based on allele with (1) and (2) and employs hybrid updating strategy to update the alleles and the corresponding probability amplitude.
In this experiment, we run repeatedly the above optimization algorithms for each test function and record the running results (including the optimal values, average values, worst values, and average run times) in different optimization algorithms. The comparison results for different optimization algorithms are shown in Table 2. From the comparison results, we can find that the search accuracy of ARQEA is obviously superior to GA’s, QEA’s, and DCQGA’s in solving continuous optimization problem. In addition, the running time of ARQEA is faster than GA’s, QEA’s, and DCQGA’s as well.
