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 Congress on Evolutionary Computation (CEC)

A Random search and Greedy selection based Genetic Quantum Algorithm for combinatorial optimization

R. S. Pavithr, Gursaran

Published Jun 1, 2013• 4 citations
Publisher

Abstract

Genetic Quantum Algorithm (GQA) is an evolutionary algorithm in the class of quantum inspired evolutionary algorithms inspired by the principles of quantum computing such as Q-bits, super position, quantum gates, interference and coherence. GQA adopts Q-bit representation and applies quantum rotation gate (QR gate) as genetic operator. The performance of the quantum inspired evolutionary algorithms largely depends upon the effectiveness of quantum gates applied as the genetic operator. Researchers have attempted to improve the performance of quantum inspired evolutionary algorithms by designing various quantum evolutionary operators using different strategies. In this paper, an effort is made to study the impact of Random search based QR gate strategy in GQA, and subsequently a Random search and greedy selection based Genetic Quantum Algorithm (RSGS-GQA) is proposed. The performance of RSGS-GQA algorithm is compared with the standard quantum inspired evolutionary algorithms (QIEA) on knapsack problem. The results indicate that, the RSGS-GQA algorithm performs better than the standard QIEA variants in terms of the quality of the solution and convergence.

DOI
10.1109/cec.2013.6557859

Related papers

Genetic quantum algorithm and its application to combinatorial optimization problem

Kuk-Hyun Han, Jong-Hwan Kim

This paper proposes a novel evolutionary computing method called a genetic quantum algorithm (GQA). GQA is based on the concept and principles of quantum computing such as qubits and superposition of states. Instead of binary, numeric, or symbolic representation, by adopting qubit chromosome as a representation GQA can represent a linear superposition of solutions due to its probabilistic representation. As genetic operators, quantum gates are employed for the search of the best solution. Rapid convergence and good global search capability characterize the performance of GQA. The effectiveness and the applicability of GQA are demonstrated by experimental results on the knapsack problem, which is a well-known combinatorial optimization problem. The results show that GQA is superior to other genetic algorithms using penalty functions, repair methods and decoders.

IEEE Congress on Evolutionary Computation (CEC)•Nov 7, 2002•679 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

Toward a more Generalized Quantum-Inspired Evolutionary Algorithm for Combinatorial Optimization Problems

Julio Manuel Alegria Reymer, Yván Jesús Túpac Valdivia

In this paper, a generalization of the original Quantum-Inspired Evolutionary Algorithm (QIEA): the Generalized Quantum-Inspired Evolutionary Algorithm (GQIEA) is proposed. Like QIEA, GQIEA is also based on the quantum computing principle of superposition of states, but extending it not only to be used for binary values {0, 1}, but for any finite set of values {1, n}. GQIEA, as any other quantum inspired evolutionary algorithm, defines an own quantum individual, an evaluation function and population operators. As in QIEA, GQIEA also defines a generalized Q-gate operator, which is a variation operator to drive the individuals toward better solutions. To demonstrate its effectiveness and applicability, the proposal will be applied to the Knapsack Problem (KP), a classic combinatorial optimization problem. Results show that GQIEA has a good performance even with a small population.

International Conference of the Chilean Computer Science Society (SCCC)•Nov 1, 2013•0 citations

Quantum Gate Optimization in a Meta-Level Genetic Quantum Algorithm

A.-R. Khorsand, Mohammad-R. Akbarzadeh-T

Genetic quantum algorithms (GQA) are population based evolutionary algorithms that imitate quantum physics by introducing quantum bits for a basic probabilistic genotypic representation and hence better population diversity, and quantum gates for evolving the population of solutions. While quantum inspired gates play an important role in the evolutionary process, there is no specific method for their design, i.e. they are mostly developed through ad hoc procedures. Here, we propose a multi-objective meta-level GQA in order to determine parameters of QG which is applicable for a wide variety of optimization problems. Specifically, a two-layer GQA is constructed, in which the lower layer's objective is to optimize the four junction types: Dejong, Peak, Easoms, and Griewank. And the higher layer's objective is to determine optimal parameters for QG that helps the proposed algorithm find best solutions. GQA optimization performance, with optimized parameter of QG is compared with GA on several benchmark problems and the superiority of the proposed method is statistically shown.

Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics•Jan 18, 2006•39 citations

A novel quantum-inspired evolutionary algorithm for solving combinatorial optimization problems

Parvaz Mahdabi, Mahdi Abadi, Saeed Jalili

In this paper, we propose a novel quantum-inspired evolutionary algorithm, called NQEA, for solving combinatorial optimization problems. NQEA uses a new Q-bit update operator to increase the balance between the exploration and exploitation of the search space. In the operator, first, the Q-bits of each individual in the population are updated based on the personal best measurement of that individual and the best measurement of current generation. Then, a restriction is applied to each Q-bit to prevent the premature convergence of its values. The results of experiments on the 0-1 knapsack and NK-landscapes problems show that NQEA performs better than a classical genetic algorithm, CGA, and two quantum-inspired evolutionary algorithms, QEA and vQEA, in terms of convergence speed and accuracy.

Genetic and Evolutionary Computation Conference (GECCO)•Jul 8, 2009•6 citations

Parallel quantum-inspired genetic algorithm for combinatorial optimization problem

Kuk-Hyun Han, Kui-Hong Park, Ci-Ho Lee +1 more

This paper proposes a new parallel evolutionary algorithm called parallel quantum-inspired genetic algorithm (PQGA). Quantum-inspired genetic algorithm (QGA) is based on the concept and principles of quantum computing such as qubits and superposition of states. Instead of binary, numeric, or symbolic representation, by adopting the qubit chromosome as a representation, QGA can represent a linear superposition of solutions due to its probabilistic representation. QGA is suitable for parallel structures because of rapid convergence and good global search capability. That is, QGA is able to possess the two characteristics of exploration and exploitation simultaneously. The effectiveness and the applicability of PQGA are demonstrated by experimental results on the knapsack problem, which is a well-known combinatorial optimization problem. The results show that PQGA is superior to QGA as well as other conventional genetic algorithms.

IEEE Congress on Evolutionary Computation (CEC)•Nov 13, 2002•192 citations
Genetic Quantum Algorithm (GQA) is an evolutionary algorithm in the class of quantum inspired evolutionary algorithms inspired by the principles of quantum computing such as Q-bits, super position, quantum gates, interference and coherence. GQA adopts Q-bit representation and applies quantum rotation gate (QR gate) as genetic operator. The performance of the quantum inspired evolutionary algorithms largely depends upon the effectiveness of quantum gates applied as the genetic operator. Researchers have attempted to improve the performance of quantum inspired evolutionary algorithms by designing various quantum evolutionary operators using different strategies. In this paper, an effort is made to study the impact of Random search based QR gate strategy in GQA, and subsequently a Random search and greedy selection based Genetic Quantum Algorithm (RSGS-GQA) is proposed. The performance of RSGS-GQA algorithm is compared with the standard quantum inspired evolutionary algorithms (QIEA) on knapsack problem. The results indicate that, the RSGS-GQA algorithm performs better than the standard QIEA variants in terms of the quality of the solution and convergence.
This paper proposes a novel evolutionary computing method called a genetic quantum algorithm (GQA). GQA is based on the concept and principles of quantum computing such as qubits and superposition of states. Instead of binary, numeric, or symbolic representation, by adopting qubit chromosome as a representation GQA can represent a linear superposition of solutions due to its probabilistic representation. As genetic operators, quantum gates are employed for the search of the best solution. Rapid convergence and good global search capability characterize the performance of GQA. The effectiveness and the applicability of GQA are demonstrated by experimental results on the knapsack problem, which is a well-known combinatorial optimization problem. The results show that GQA is superior to other genetic algorithms using penalty functions, repair methods and decoders.
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.
In this paper, a generalization of the original Quantum-Inspired Evolutionary Algorithm (QIEA): the Generalized Quantum-Inspired Evolutionary Algorithm (GQIEA) is proposed. Like QIEA, GQIEA is also based on the quantum computing principle of superposition of states, but extending it not only to be used for binary values {0, 1}, but for any finite set of values {1, n}. GQIEA, as any other quantum inspired evolutionary algorithm, defines an own quantum individual, an evaluation function and population operators. As in QIEA, GQIEA also defines a generalized Q-gate operator, which is a variation operator to drive the individuals toward better solutions. To demonstrate its effectiveness and applicability, the proposal will be applied to the Knapsack Problem (KP), a classic combinatorial optimization problem. Results show that GQIEA has a good performance even with a small population.
Genetic quantum algorithms (GQA) are population based evolutionary algorithms that imitate quantum physics by introducing quantum bits for a basic probabilistic genotypic representation and hence better population diversity, and quantum gates for evolving the population of solutions. While quantum inspired gates play an important role in the evolutionary process, there is no specific method for their design, i.e. they are mostly developed through ad hoc procedures. Here, we propose a multi-objective meta-level GQA in order to determine parameters of QG which is applicable for a wide variety of optimization problems. Specifically, a two-layer GQA is constructed, in which the lower layer's objective is to optimize the four junction types: Dejong, Peak, Easoms, and Griewank. And the higher layer's objective is to determine optimal parameters for QG that helps the proposed algorithm find best solutions. GQA optimization performance, with optimized parameter of QG is compared with GA on several benchmark problems and the superiority of the proposed method is statistically shown.
In this paper, we propose a novel quantum-inspired evolutionary algorithm, called NQEA, for solving combinatorial optimization problems. NQEA uses a new Q-bit update operator to increase the balance between the exploration and exploitation of the search space. In the operator, first, the Q-bits of each individual in the population are updated based on the personal best measurement of that individual and the best measurement of current generation. Then, a restriction is applied to each Q-bit to prevent the premature convergence of its values. The results of experiments on the 0-1 knapsack and NK-landscapes problems show that NQEA performs better than a classical genetic algorithm, CGA, and two quantum-inspired evolutionary algorithms, QEA and vQEA, in terms of convergence speed and accuracy.
This paper proposes a new parallel evolutionary algorithm called parallel quantum-inspired genetic algorithm (PQGA). Quantum-inspired genetic algorithm (QGA) is based on the concept and principles of quantum computing such as qubits and superposition of states. Instead of binary, numeric, or symbolic representation, by adopting the qubit chromosome as a representation, QGA can represent a linear superposition of solutions due to its probabilistic representation. QGA is suitable for parallel structures because of rapid convergence and good global search capability. That is, QGA is able to possess the two characteristics of exploration and exploitation simultaneously. The effectiveness and the applicability of PQGA are demonstrated by experimental results on the knapsack problem, which is a well-known combinatorial optimization problem. The results show that PQGA is superior to QGA as well as other conventional genetic algorithms.