| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 287.68 KB | Adobe PDF |
Orientador(es)
Resumo(s)
This paper presents a new simulated annealing algorithm to solve constrained multi-global optimization problems. To compute all global solutions in a sequential manner, we combine the function stretching technique with the adaptive simulated annealing variant. Constraint-handling is carried out through a nondifferentiable penalty function. To benchmark our penalty stretched simulated annealing algorithm we solve a set of well-known problems. Our preliminary numerical results show that the algorithm is promising.
Descrição
Palavras-chave
Multi-global optimization Penalty function Simulated annealing
Contexto Educativo
Citação
Pereira, Ana I.; Fernandes, Edite M.G.P. (2009). Constrained multi-global optimization using a penalty stretched simulated annealing framework. Numerical analysis and applied mathematics. Vol. 1168, p.1354-1357.
Editora
American Institute of Physics
