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

International Journal of Computer Applications

Adaptive Quantum Inspired Genetic Algorithm for Combinatorial Optimization Problems

Jyoti Chaturvedi

Published Dec 18, 2014• 3 citations
Publisher

Abstract

The development in the field of quantum computing gives us a significant edge over classical computing in terms of time and efficiency.This is particularly useful for NP-hard problems such as graph layout problems.Since many real world problems are effectively solved by genetic algorithm (GA) and the performance of GA highly depends upon the setting of its parameters, therefore this paper focuses on a Quantum Inspired Genetic Algorithm (QIGA) and develops and evaluates adaptive strategies for the same.QIGA adapts ideas of Q-bits, superposition of Q-bits from quantum computing.The effectiveness and the applicability of adaptive QIGA is demonstrated by experimental results on the benchmark Knapsack, Maxcut and Onemax combinatorial optimization problems.The results show that adaptive QIGA is superior to QIGAs.

DOI
10.5120/18743-9996

Related papers

Quantum-Inspired Genetic Algorithm for Complex Optimization Problems

Jincheng Zhang

This paper explores the application of a quantum-inspired genetic algorithm (QIGA) for solving complex optimization problems. Traditional genetic algorithms (GAs) can struggle with the intricacies of high-dimensional and non-linear problems, often encountering issues with premature convergence and local optima. This research proposes a novel approach where a standard GA is modified to incorporate principles inspired by quantum mechanics, specifically utilizing quantum-inspired concepts such as superposition and interference, to enhance the exploration and exploitation phases. The core claim is that QIGA can effectively tackle complex optimization scenarios. The mechanism involves mapping the original problem into the fitness function of the GA, and subsequently using the QIGA to perform the optimization. The results demonstrate the potential of this hybrid approach to improve solution quality and speed, particularly in problems with challenging characteristics. The research highlights a promising direction for combining classical optimization techniques with quantum-inspired ideas, offering a new tool for tackling computationally intensive optimization tasks. ---

•Sep 3, 2026•0 citations

Quantum-Inspired Genetic Algorithms for Combinatorial Optimization Problems

A. Mansori, Sarah Key Nguyeni

Quantum-Inspired Genetic Algorithms (QIGAs) are a trailblazing force in the ever-evolving field of optimization, combining traditional genetic algorithms with quantum concepts to solve challenging combinatorial problems. By contrasting QIGAs with traditional Genetic Algorithms (GAs) in the setting of the Traveling Salesman Problem (TSP), this study explores the potential of QIGAs. The research reveals the transformational potential of quantum-inspired techniques through a thorough investigation of convergence speed, solution quality, and scalability.

Algorithm Asynchronous•Aug 29, 2023•12 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

Higher-Order Quantum-Inspired Genetic Algorithms

Robert Nowotniak, Jacek Kucharski

This paper presents a theory and an empirical evaluation of Higher-Order Quantum-Inspired Genetic Algorithms.Fundamental notions of the theory have been introduced, and a novel Order-2 Quantum-Inspired Genetic Algorithm (QIGA2) has been developed.Contrary to all QIGA algorithms which represent quantum genes as independent qubits, in higherorder QIGAs quantum registers are used to represent genes strings, which allows modelling of genes relations using quantum phenomena.Performance comparison has been conducted on a benchmark of 20 deceptive combinatorial optimization problems.It has been presented that using higher quantum orders is beneficial for genetic algorithm efficiency, and the new QIGA2 algorithm outperforms the old QIGA algorithm tuned in highly compute-intensive metaoptimization process.

Annals of Computer Science and Information Systems•Sep 29, 2014•16 citations

Higher-Order Quantum-Inspired Genetic Algorithms

Robert Nowotniak, Jacek Kucharski

This paper presents a theory and an empirical evaluation of Higher-Order Quantum-Inspired Genetic Algorithms. Fundamental notions of the theory have been introduced, and a novel Order-2 Quantum-Inspired Genetic Algorithm (QIGA2) has been presented. Contrary to all QIGA algorithms which represent quantum genes as independent qubits, in higher-order QIGAs quantum registers are used to represent genes strings which allows modelling of genes relations using quantum phenomena. Performance comparison has been conducted on a benchmark of 20 deceptive combinatorial optimization problems. It has been presented that using higher quantum orders is beneficial for genetic algorithm efficiency, and the new QIGA2 algorithm outperforms the old QIGA algorithm which was tuned in highly compute intensive metaoptimization process.

arXiv:1407.0977•Jul 2, 2014•0 citations

An adaptive quantum evolution algorithm for 0–1 knapsack problem

Valerii M. Tkachuk

Quantum Genetic Algorithm (QGA) has a number of advantages in comparison with its classical version: operating speed, small population size and auto-balance between the global search and the local search. It is based on the ideas of traditional evolutionary algorithms, applied to the quantum computations technology, which operate with quantum bits, superposition of states and quantum measurements. This paper proposes a QGA with a new adaptive quantum gate operator and a restoring technology for the quantum chromosome during the process of solving combinatorial problems with constraints. Meta-optimization of the primary algorithm parameters is used for providing the algorithm efficiency. The productiveness of the suggested approach is proven by the model studies, carried out using a wide range of test 0–1 knapsack problems.

System research and information technologies•Jun 20, 2018•2 citations
The development in the field of quantum computing gives us a significant edge over classical computing in terms of time and efficiency.This is particularly useful for NP-hard problems such as graph layout problems.Since many real world problems are effectively solved by genetic algorithm (GA) and the performance of GA highly depends upon the setting of its parameters, therefore this paper focuses on a Quantum Inspired Genetic Algorithm (QIGA) and develops and evaluates adaptive strategies for the same.QIGA adapts ideas of Q-bits, superposition of Q-bits from quantum computing.The effectiveness and the applicability of adaptive QIGA is demonstrated by experimental results on the benchmark Knapsack, Maxcut and Onemax combinatorial optimization problems.The results show that adaptive QIGA is superior to QIGAs.
This paper explores the application of a quantum-inspired genetic algorithm (QIGA) for solving complex optimization problems. Traditional genetic algorithms (GAs) can struggle with the intricacies of high-dimensional and non-linear problems, often encountering issues with premature convergence and local optima. This research proposes a novel approach where a standard GA is modified to incorporate principles inspired by quantum mechanics, specifically utilizing quantum-inspired concepts such as superposition and interference, to enhance the exploration and exploitation phases. The core claim is that QIGA can effectively tackle complex optimization scenarios. The mechanism involves mapping the original problem into the fitness function of the GA, and subsequently using the QIGA to perform the optimization. The results demonstrate the potential of this hybrid approach to improve solution quality and speed, particularly in problems with challenging characteristics. The research highlights a promising direction for combining classical optimization techniques with quantum-inspired ideas, offering a new tool for tackling computationally intensive optimization tasks. ---
Quantum-Inspired Genetic Algorithms (QIGAs) are a trailblazing force in the ever-evolving field of optimization, combining traditional genetic algorithms with quantum concepts to solve challenging combinatorial problems. By contrasting QIGAs with traditional Genetic Algorithms (GAs) in the setting of the Traveling Salesman Problem (TSP), this study explores the potential of QIGAs. The research reveals the transformational potential of quantum-inspired techniques through a thorough investigation of convergence speed, solution quality, and scalability.
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.
This paper presents a theory and an empirical evaluation of Higher-Order Quantum-Inspired Genetic Algorithms.Fundamental notions of the theory have been introduced, and a novel Order-2 Quantum-Inspired Genetic Algorithm (QIGA2) has been developed.Contrary to all QIGA algorithms which represent quantum genes as independent qubits, in higherorder QIGAs quantum registers are used to represent genes strings, which allows modelling of genes relations using quantum phenomena.Performance comparison has been conducted on a benchmark of 20 deceptive combinatorial optimization problems.It has been presented that using higher quantum orders is beneficial for genetic algorithm efficiency, and the new QIGA2 algorithm outperforms the old QIGA algorithm tuned in highly compute-intensive metaoptimization process.
This paper presents a theory and an empirical evaluation of Higher-Order Quantum-Inspired Genetic Algorithms. Fundamental notions of the theory have been introduced, and a novel Order-2 Quantum-Inspired Genetic Algorithm (QIGA2) has been presented. Contrary to all QIGA algorithms which represent quantum genes as independent qubits, in higher-order QIGAs quantum registers are used to represent genes strings which allows modelling of genes relations using quantum phenomena. Performance comparison has been conducted on a benchmark of 20 deceptive combinatorial optimization problems. It has been presented that using higher quantum orders is beneficial for genetic algorithm efficiency, and the new QIGA2 algorithm outperforms the old QIGA algorithm which was tuned in highly compute intensive metaoptimization process.
Quantum Genetic Algorithm (QGA) has a number of advantages in comparison with its classical version: operating speed, small population size and auto-balance between the global search and the local search. It is based on the ideas of traditional evolutionary algorithms, applied to the quantum computations technology, which operate with quantum bits, superposition of states and quantum measurements. This paper proposes a QGA with a new adaptive quantum gate operator and a restoring technology for the quantum chromosome during the process of solving combinatorial problems with constraints. Meta-optimization of the primary algorithm parameters is used for providing the algorithm efficiency. The productiveness of the suggested approach is proven by the model studies, carried out using a wide range of test 0–1 knapsack problems.