A Novel Quantum Dynamical Evolutionary Algorithm combined with

Qi Feng, Qianqian Feng, Xiyu Liu +1 more

Yongqiang Zhang, Guihong Li

This paper combines quantum evolutionary algorithm with the available evolutionary algorithms, uses quantum computing parallelism to search solution space efficiently, uses the traditional evolutionary algorithm to optimize the result observed by quantum population and then uses the optimized result to guide the generation of some individuals of quantum population. It maintains the population diversity of quantum evolutionary algorithm and avoids premature. Meanwhile it adopts the different evolutionary algorithms to combine with quantum evolutionary algorithm to solve different problems, which will improve the adaptability of algorithm.

Anthony Brabazon, Michael O’Neill, Seán McGarraghy

Xin Wei, Shigeru Fujimura

Abstract Based on the concept and principles of quantum computing, this paper proposes a new evolutionary algorithm called multiupdate mode quantum evolutionary algorithm (MMQEA). MMQEA, like the other classic evolutionary algorithms, is also characterized by the representation of the individual evaluation function and the population dynamics; however, instead of binary, numeric, or symbolic representation, MMQEA uses two interactional q‐bit strings as an individual. Update modes are introduced as a variational operation that evolves the individuals to make a better solution. The proposed individual structure and update modes are inspired by quantum entanglement. Update modes perform as reproducing the states of a pair of q‐bit strings of individual simultaneously. For guiding the individual evolution to maintain the population diversity and avoid prematurity, each q‐bit string of individual provides its evolutionary history information to another. To demonstrate its effectiveness and applicability, the proposed algorithm was tested on two famous combinatorial optimization problems, namely, the knapsack problem and flow shop problem. The results show that MMQEA performs very well compared to quantum evolutionary algorithm (QEA) and the conventional genetic algorithm. © 2012 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.

Zhihui Xing, Haibin Duan, Chunfang Xu

Yang Yu, Yafei Tian, Zhifeng Yin

Inspired by the idea of hybrid optimization algorithms, this paper proposes two hybrid quantum evolutionary algorithms (QEA) based on combining QEA with particle swarm optimization (PSO) to improve the performance of QEA . The main idea of the first method called PSEQEA is to embed the evolutionary equation of PSO in the evolutionary operator of QEA; while the main idea of the second method called PSSQEA is to replace the evolutionary operator of QEA using the evolutionary equation of PSO which is redefined the meanings of the original evolutionary equations. The experiment results of the knapsack problem, the function optimization problems and multiuser detection problem show that the both of the proposed methods not only have simpler algorithm structure, but also perform better than conventional QEA and PSO in terms of ability of global optimum