[3L4-GS-1] Fundamental AI, theory, algorithm:

[3L4-GS-1-04] Global Solution Search with Temperature Parallel Simulated Annealing

〇Eiji Kawase¹, Hideaki Tamai¹ (1. Oki Electric Industry Co., Ltd.)

Keywords:Simulated Annealing, Ising model, Combinatorial Optimization Problems

Simulated Annealing (SA) is a metaheuristic algorithm applicable to various combinatorial optimization problems. SA begins its search from an arbitrary initial state and gradually changes the state. If the changed state is better than the current state, it is adopted; if it is worse, the changes state is accepted probabilistically. This process is repeated for a certain period, after which the final state is determined. However, SA's performance heavily depends on parameters especially the temperature, requiring trial-and-error adjustments. To enhance SA's performance, numerous improvement methods have been proposed. One such method is called Temperature Parallel Simulated Annealing (TPSA). TPSA runs different initial state at various temperatures, exchanging state at specific intervals. This paper reports the results of evaluation experiments based on the initial state given to TPSA.