Fig. 4: Experimental solution of 70-city TSP.
From: Energy-efficient superparamagnetic Ising machine and its application to traveling salesman problems
a Optimization algorithm for 70-city TSP. b Number of required SMTJs for various problems using different methods. Burma14, berlin52, eil76, and eil101 are TSP of 14, 52, 76, and 101 cities, respectively. c Comparison of total Ising energy (path) and total clock cycles for final solution with different SA-based algorithms, including symbiotic organisms search40, ant colony optimazation41, multi-offspring genetic algorithm42, and gene-expression programming7. Our method is tested on our Ising system and others are tested on Intel Core-i7 PC. In this comparison, our system runs at a main frequency of 10 kHz.
