Since its early heuristic development, Direct Search Methods (DSM) have proved to be robust and reliable, both from theoretical and practical perspectives. Some of these algorithms are now able to solve noisy, nonsmooth or nonconvex problems and its algorithmic structure favours parallelization, drawing the attention of the structural optimization community as a promising alternative to the use of Meta-Heuristics.
In the present work, the performance of DSM is compared to Genetic Algorithms, when solving hard or expensive structural optimization problems. Parallel implementations are considered when large computational times are involved in function evaluation.
|Title of host publication||PARENG 2011|
|Publication status||Published - 1 Jan 2011|
|Event||The Second International Conference on Parallel, Distributed, Grid and Cloud Computing for Engineering - |
Duration: 1 Jan 2011 → …
|Conference||The Second International Conference on Parallel, Distributed, Grid and Cloud Computing for Engineering|
|Period||1/01/11 → …|