Authors
Advisor(s)
Abstract(s)
Constrained multilocal programming optimization problems may be solved by solving a sequence of unconstrained problems. In turn, those unconstrained problems may be solved using techniques like the Stretched Simulated Annealing (SSA) method. In order to increase the solving performance and make possible the discovery of new optima, parallel approaches to SSA have been devised, like Parallel Stretched Simulated Annealing (PSSA). Recently, Constrained PSSA (coPSSA) was also proposed, coupling the penalty method with PSSA, in order to solve constrained problems. In this work, coPSSA is explored to solve four test problems using the l 1 penalty function. The effect of the variation of the reduction factor parameter of the l 1 penalty function is also studied.
Description
Keywords
Parallel computing Unconstrained optimization
Pedagogical Context
Citation
Pereira, Ana I.; Rufino, José (2015). Solving constrained multilocal optimization problems with parallel stretched simulated annealing. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ISSN 0302-9743. 9156, p. 534-548