An asynchronous parallel simulated annealing algorithm for function optimization problems
Tang Guo-jin · Kongzhi yu juece · 2005
To complex function optimization problems with multi-minimize in practice, an asynchronous parallel simulated annealing algorithm is (developed,) which splits one Markov chain into several Markov chains, and combines other enhanced method. The (performance) of algorithm scales up with the increase of processors, and the character of asynchronous makes algorithm more suitable for all kinds of processor. The numerical computation results indicate that the proposed algorithm can significantly improve the convergence speed.