Simulated annealing device and simulated annealing method

A simulated annealing method for solving a combinatorial optimization problem by a simulated annealing scheme, comprising:

• executing a process of confirming whether a flip is accepted or not for each of n spins from {(k−1)·n+1}-th to k·n-th (k is an integer greater than or equal to 1, n is an integer greater than or equal to 2) that constitute an energy function in the Ising model representing the combinatorial optimization problem in parallel with a parallel number n;
• when the acceptance of a flip on m-th spin (m is an integer between {(k−1)·n+1} and k·n) is confirmed first, updating change amount in energy of a spin associated with the m-th spin with the m-th spin flipped;
• and
• changing spins in which the next process of confirming is executed and the parallel number to spins from (m+1)-th to k·n-th and (n−m), respectively.

A computer-readable recording medium recording a simulated annealing program causing a computer for solving a combinatorial optimization problem by a simulated annealing scheme, to execute:

• executing a process of confirming whether a flip is accepted or not for each of n spins from {(k−1)·n+1}-th to k·n-th (k is an integer greater than or equal to 1, n is an integer greater than or equal to 2) that constitute an energy function in the Ising model representing the combinatorial optimization problem in parallel with a parallel number n;
• when the acceptance of a flip on m-th spin (m is an integer between {(k−1)·n+1} and k·n) is confirmed first, updating change amount in energy of a spin associated with the m-th spin with the m-th spin flipped;
• and
• changing spins in which the next process of confirming is executed and the parallel number to spins from (m+1)-th to k·n-th and (n−m), respectively.