Hybrid quantum genetic algorithm with adaptive rotation angle for the 0-1 Knapsack problem in the IBM Qiskit simulator
Soft Computing, ISSN: 1433-7479, Vol: 27, Issue: 18, Page: 13321-13346
2023
- 12Citations
- 9Captures
Metric Options: CountsSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Article Description
A Hybrid Quantum Genetic Algorithm with an Adaptive Rotation Angle (HQGAAA) for the 0-1 knapsack problem is presented. This novel proposal uses the Deutsch-Jozsa quantum circuit to generate quantum populations, which synergistically works as haploid recombination and mutation operators taking advantage of quantum entanglement providing exploitative and explorative features to produce new individuals. Furthermore, the created individuals are updated using an adaptive rotation angle operator that helps refine new individuals to converge to the optimal solution. We performed comparative tests with other quantum evolutionary algorithms and the classical genetic algorithm to demonstrate that this proposal performed better with the tested problem. Results showed that quantum algorithms performed similar but better than the classic genetic algorithm regarding accuracy. Moreover, statistic tests demonstrated that our proposal is faster than the other quantum algorithms tested.
Bibliographic Details
Springer Science and Business Media LLC
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know