抄録
When applying SA to continuous optimization problems, the appropriate adjustment of the neighborhood ranges becomes necessary to obtain the good performance. In this paper, we propose a Neighborhood Parallel Simulated Annealing (NPSA) for continuous optimization problems, which provides global search using the periodic exchange of different neighborhood ranges with parallel computers. The proposed approach, NPSA, automatically determines the appropriate neighborhood range, and shows a good perforamance in solving typical test problems.
