coPSSA - constrained parallel stretched simulated annealing

Rufino, José; Pereira, Ana I.; Pidanic, Jan

http://hdl.handle.net/10198/11892

Utilize este identificador para referenciar este registo.

Nome:	Descrição:	Tamanho:	Formato:
v9.4-PID3629265.pdf		457.29 KB	Adobe PDF	Ver/Abrir

Contacte-nos

Autores

Rufino, José

Pereira, Ana I.

Pidanic, Jan

Resumo(s)

Parallel Stretched Simulated Annealing (PSSA) solves unconstrained multilocal programming optimization problems in distributed memory clusters, by applying the Stretched Simulated Annealing optimization method, in parallel, to multiple sub-domains of the original feasible region. This work presents coPSSA (constrained Parallel Stretched Simulated Annealing), an hybrid application that combines shared memory based parallelism with PSSA, in order to efficiently solve constrained multilocal programming problems. We devise and evaluate two different parallel strategies for the search of solutions to these problems. Evaluation results from a small set of test problems often reach superlinear speedup in the solution search time, thus proving the merit of the coPSSA parallelization approach.

Palavras-chave

Unconstrained optimization Parallel computing

URI

http://hdl.handle.net/10198/11892

Citação

Rufino, José Pereira, Ana I. Pidanic, Jan (2015). coPSSA - constrained parallel stretched simulated annealing. In the 25th International Conference Radioeletronika 2015. p. 435-439. ISBN 978-1-4799-8117-5

Editora

Jan Pidanic

Coleções

ESTiG - Publicações em Proceedings Indexadas à WoS/Scopus

Ver registo completo