Experimental demonstration of a quantum annealing algorithm for the traveling salesman problem in a nuclear-magnetic-resonance quantum simulator

2011 ◽  
Vol 83 (3) ◽  
Author(s):  
Hongwei Chen ◽  
Xi Kong ◽  
Bo Chong ◽  
Gan Qin ◽  
Xianyi Zhou ◽  
...  
2004 ◽  
Vol 70 (5) ◽  
Author(s):  
Roman Martoňák ◽  
Giuseppe E. Santoro ◽  
Erio Tosatti

2016 ◽  
Vol 117 (16) ◽  
Author(s):  
Isabela A. Silva ◽  
Alexandre M. Souza ◽  
Thomas R. Bromley ◽  
Marco Cianciaruso ◽  
Raimund Marx ◽  
...  

2010 ◽  
Vol 34-35 ◽  
pp. 1180-1184
Author(s):  
Xu Hao

The traveling salesman problem (TSP) is a problem in combinatorial optimization studied in operations research and theoretical computer science. In this paper, we presented a novel heuristic simulated annealing algorithm for solving TSP. The algorithm is fully operational in the genetic role of crossover operator, and mutation operator, to achieve a balance between speed and accuracy. The experiment results show that the algorithm is better than the traditional method.


Sign in / Sign up

Export Citation Format

Share Document