PSSA: Parallel Stretched Simulated Annealing | Zendy

Tiago Martins Ribeiro | Zendy; José Rufino | Zendy; Ana I. Pereira | Zendy; Theodore E. Simos | Zendy; George Psihoyios | Zendy; Ch. Tsitouras | Zendy; Zacharias Anastassi | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

PSSA: Parallel Stretched Simulated Annealing

Author(s) -

Tiago Martins Ribeiro,

José Rufino,

Ana I. Pereira,

Theodore E. Simos,

George Psihoyios,

Ch. Tsitouras,

Zacharias Anastassi

Publication year - 2011

Publication title -

aip conference proceedings

Language(s) - English

Resource type - Conference proceedings

SCImago Journal Rank - 0.177

H-Index - 75

eISSN - 1551-7616

pISSN - 0094-243X

DOI - 10.1063/1.3636849

Subject(s) - simulated annealing , computer science , bounded function , software , mathematical optimization , parallel computing , nonlinear system , set (abstract data type) , adaptive simulated annealing , nonlinear programming , computational science , algorithm , theoretical computer science , mathematics , programming language , mathematical analysis , physics , quantum mechanics

We consider the problem of finding all the global (and some local) minimizers of a given nonlinear optimization function (a class of problems also known as multi‐local programming problems), using a novel approach based on Parallel Computing. The approach, named Parallel Stretched Simulated Annealing (PSSA), combines simulated annealing with stretching function technique, in a parallel execution environment. Our PSSA software allows to increase the resolution of the search domains (thus facilitating the discovery of new solutions) while keeping the search time bounded. The software was tested with a set of well known problems and some numerical results are presented.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research