Detalhes do Documento

Stretched Simulated Annealing (SSA) combines simulated annealing with a stretching function technique, in order to solve multilocal programming problems. This work explores an approach to the parallelization of SSA, named PSSA-HeD, based on a recursive heterogeneous decomposition of the feasible region and the dynamic distribution of the resulting subdomains by the processors involved. Three PSSAHeD variants were implemented and evaluated, with distinct limits on the recursive search depth, offering different levels of numerical and computational efficiency. Numerical results are presented and discussed.