Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Conference on Industrial Electronics and Applications (ICIEA)

Hybrid Quantum Evolutionary Algorithms Based on Particle Swarm Theory

Yang Yu, Yafei Tian, Zhifeng Yin

Published May 1, 2006• 13 citations
Publisher

Abstract

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

DOI
10.1109/iciea.2006.257137

Related papers

Hybrid Quantum Evolutionary Algorithms and its Application

Yafei Tian

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).The main idea of the first method called PSEQEA is to embed the evolutionary equation of PSO in QEA;while the main idea of the second method called QBPSO is to apply the quantum chromosomes of QEA to binary PSO(BPSO).The experiment results of the knapsack problem 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 BPSO in terms of ability of global optimum.

Computer Engineering and Applications Journal•Jan 1, 2006•2 citations

Improved Quantum Evolutionary Computation Based on Particle Swarm Optimization and Two-Crossovers

Duan Hai-Bin, Xing Zhi-Hui

A quantum evolutionary computation (QEC) algorithm with particle swarm optimization (PSO) and two-crossovers is proposed to overcome identified limitations. PSO is adopted to update the Q-bit automatically, and two-crossovers are applied to improve the convergence quality in the basic QEC model. This hybrid strategy can effectively employ both the ability to jump out of the local minima and the capacity of searching the global optimum. The performance of the proposed approach is compared with basic QEC on the standard unconstrained scalable benchmark problem that numerous hard combinatorial optimization problems can be formulated. The experimental results show that the proposed method outperforms the basic QEC quite significantly.

Chinese Physics Letters•Dec 1, 2009•3 citations

Quantum-Inspired Differential Evolution with Particle Swarm Optimization for Knapsack Problem.

Djaafar Zouache, Abdelouahab Moussaouı

This paper presents a new hybrid algorithm called QDEPSO (Quantum inspired Differential Evolution with Particle Swarm Optimization) which combines differential evolution (DE), particle swarm optimization method (PSO) and quantum-inspired evolutionary algorithm (QEA) in order to solve the 0-1 optimization problems. In the initialization phase, the QDEPSO uses the concepts of quantum computing as the superposition state of qubits as well as the quantum measurement to represent and generate the diversity of the initial solutions. The second phase is an alternation between the DE operations (mutation, crossover and selection) and the adaptation of update formula of the velocity and the position of PSO algorithm. The effect of this step is to determine the rotation quantum angle to explore search space of solutions. To evaluate the performance of the proposed algorithm, we use the knapsack 0-1 problem as a class of combinatorial optimization NP-hard problems. The obtained results for 0-1 knapsack problem have proven the superior performance of QDEPSO compared to Quantum-

Journal of information science and engineering•Jan 1, 2015•11 citations

Hybrid quantum algorithm and its application in flow shop problem

Xie Jin-hua

Quantum Evolutionary Algorithm(QEA) is a distinctive type of algorithm for optimization currently,and the theoretical basis of QEA is quantum computation.The algorithm takes advantage of intervention and parallelism of quantum bit thoroughly,which enables QEA to solve combinatorial optimization problems.While solving scheduling problems,QEA has defects that it converges slowly and doesn’t use other immature individual.Hybrid Quantum Algorithm(HQA) is formed and it sucks Particle Swarm Optimization algorithm(PSO) and evolutionary computation into QEA.Classical flow shop problem is employed to test the algorithm,and the result shows that the hybrid algorithm overcomes the defects of QEA and it has universality to solve scheduling problems.

Computer Engineering and Applications Journal•Jan 1, 2008•0 citations

Quantum-inspired evolutionary algorithm for a class of combinatorial optimization

Kuk-Hyun Han, Jong-Hwan Kim

This paper proposes a novel evolutionary algorithm inspired by quantum computing, called a quantum-inspired evolutionary algorithm (QEA), which is based on the concept and principles of quantum computing, such as a quantum bit and superposition of states. Like other evolutionary algorithms, QEA is also characterized by the representation of the individual, evaluation function, and population dynamics. However, instead of binary, numeric, or symbolic representation, QEA uses a Q-bit, defined as the smallest unit of information, for the probabilistic representation and a Q-bit individual as a string of Q-bits. A Q-gate is introduced as a variation operator to drive the individuals toward better solutions. To demonstrate its effectiveness and applicability, experiments were carried out on the knapsack problem, which is a well-known combinatorial optimization problem. The results show that QEA performs well, even with a small population, without premature convergence as compared to the conventional genetic algorithm.

IEEE Transactions on Evolutionary Computation•Dec 1, 2002•1,619 citations

Hybrid quantum particle swarm optimization algorithm for combinatorial optimization problem

Jiahai Wang, Yanlan Zhou

In this paper, a framework of hybrid PSO is proposed by reasonablycombining the Q-bit evolutionary search of quantum PSO and binary bit evolutionary search of genetic PSO.

Genetic and Evolutionary Computation Conference (GECCO)•Jul 7, 2007•2 citations
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
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).The main idea of the first method called PSEQEA is to embed the evolutionary equation of PSO in QEA;while the main idea of the second method called QBPSO is to apply the quantum chromosomes of QEA to binary PSO(BPSO).The experiment results of the knapsack problem 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 BPSO in terms of ability of global optimum.
A quantum evolutionary computation (QEC) algorithm with particle swarm optimization (PSO) and two-crossovers is proposed to overcome identified limitations. PSO is adopted to update the Q-bit automatically, and two-crossovers are applied to improve the convergence quality in the basic QEC model. This hybrid strategy can effectively employ both the ability to jump out of the local minima and the capacity of searching the global optimum. The performance of the proposed approach is compared with basic QEC on the standard unconstrained scalable benchmark problem that numerous hard combinatorial optimization problems can be formulated. The experimental results show that the proposed method outperforms the basic QEC quite significantly.
This paper presents a new hybrid algorithm called QDEPSO (Quantum inspired Differential Evolution with Particle Swarm Optimization) which combines differential evolution (DE), particle swarm optimization method (PSO) and quantum-inspired evolutionary algorithm (QEA) in order to solve the 0-1 optimization problems. In the initialization phase, the QDEPSO uses the concepts of quantum computing as the superposition state of qubits as well as the quantum measurement to represent and generate the diversity of the initial solutions. The second phase is an alternation between the DE operations (mutation, crossover and selection) and the adaptation of update formula of the velocity and the position of PSO algorithm. The effect of this step is to determine the rotation quantum angle to explore search space of solutions. To evaluate the performance of the proposed algorithm, we use the knapsack 0-1 problem as a class of combinatorial optimization NP-hard problems. The obtained results for 0-1 knapsack problem have proven the superior performance of QDEPSO compared to Quantum-
Quantum Evolutionary Algorithm(QEA) is a distinctive type of algorithm for optimization currently,and the theoretical basis of QEA is quantum computation.The algorithm takes advantage of intervention and parallelism of quantum bit thoroughly,which enables QEA to solve combinatorial optimization problems.While solving scheduling problems,QEA has defects that it converges slowly and doesn’t use other immature individual.Hybrid Quantum Algorithm(HQA) is formed and it sucks Particle Swarm Optimization algorithm(PSO) and evolutionary computation into QEA.Classical flow shop problem is employed to test the algorithm,and the result shows that the hybrid algorithm overcomes the defects of QEA and it has universality to solve scheduling problems.
This paper proposes a novel evolutionary algorithm inspired by quantum computing, called a quantum-inspired evolutionary algorithm (QEA), which is based on the concept and principles of quantum computing, such as a quantum bit and superposition of states. Like other evolutionary algorithms, QEA is also characterized by the representation of the individual, evaluation function, and population dynamics. However, instead of binary, numeric, or symbolic representation, QEA uses a Q-bit, defined as the smallest unit of information, for the probabilistic representation and a Q-bit individual as a string of Q-bits. A Q-gate is introduced as a variation operator to drive the individuals toward better solutions. To demonstrate its effectiveness and applicability, experiments were carried out on the knapsack problem, which is a well-known combinatorial optimization problem. The results show that QEA performs well, even with a small population, without premature convergence as compared to the conventional genetic algorithm.