A Survey of Quantum Genetic Algorithm for Combinatorial Optimization Problems
2014 ◽
Vol 568-570
◽
pp. 822-826
◽
Keyword(s):
Job Shop
◽
Combined with quantum computing and genetic algorithm, quantum genetic algorithm (QGA) shows considerable ability of parallelism. Experiments have shown that QGA performs quite well on TSP, job shop problem and some other typical combinatorial optimization problems. The other problems like nutritional diet which can be transformed into specific combinational optimization problem also can be solved through QGA smoothly. This paper sums up the main points of QGA for general combinatorial optimization problems. These points such as modeling of the problem, qubit decoding and rotation strategy are useful to enhance the convergence speed of QGA and avoid premature at the same time.
2021 ◽
Vol 10
(9)
◽
pp. 125-131
2017 ◽
Vol 4
(1)
◽
pp. 1-18
◽
2012 ◽
Vol 217-219
◽
pp. 1444-1448
2007 ◽
Vol E90-A
(1)
◽
pp. 287-294
◽
2013 ◽
Vol 411-414
◽
pp. 1904-1910
2016 ◽
pp. 214-218
2011 ◽
pp. 506-513