New parallelization scheme for simulated annealing

In this paper, an approach is proposed for Parallel Simulated Annealing known as New Parallel Simulated Annealing (NPSA). This approach features coarse-granularity in parallelization, directed at message-passing systems such as clusters. It contains heuristics such as adaptive clustering with SA to achieve more efficiency in local search. Through experiments with various optimization problems and comparison with available schemes. It is shown that NPSA is a powerful general-purposed optimization method. It can also serve as a framework for meta-hevristies to gain broader application.