10.5120/18743-9996 |
Jyoti Chaturvedi. Article: Adaptive Quantum Inspired Genetic Algorithm for Combinatorial Optimization Problems. International Journal of Computer Applications 107(4):34-42, December 2014. Full text available. BibTeX
@article{key:article, author = {Jyoti Chaturvedi}, title = {Article: Adaptive Quantum Inspired Genetic Algorithm for Combinatorial Optimization Problems}, journal = {International Journal of Computer Applications}, year = {2014}, volume = {107}, number = {4}, pages = {34-42}, month = {December}, note = {Full text available} }
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.