An Ising-mTSP Solver Based on the Mixed Simulated Annealing Algorithm

The min-max multiple traveling salesman problem (minmax mTSP) is one of the most well-known combinatorial optimization problems (COPs). As a non-deterministic polynomial problem, the min-max mTSP can not be efficiently solved by modern Von-Neumann architecture-based computers. In this paper, an Ising-mTSP solver is proposed to efficiently solve the min-max mTSP. A mixed simulated annealing algorithm that combining the distributed simulated annealing and the multi-objective simulated annealing is proposed to accelerate the annealing process and improve the accuracy of the solution. The two phase heuristic method is adopted to reduce the processing time and resources. Furthermore, the corresponding hardware structure is developed.