A new algorithm for the problem of robust single objective optimization
This paper propounds a new algorithm, the Sub-Space Random Search (SSRS) for the problem of single-objective optimization, with the aim of improving the robustness and the precision of classical methods of global optimization. The new algorithm is compared with a genetic algorithm (GA), on a set...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
EDP Sciences
2008-07-01
|
Series: | International Journal for Simulation and Multidisciplinary Design Optimization |
Subjects: | |
Online Access: | https://www.ijsmdo.org/articles/smdo/pdf/2008/03/asmdo4008.pdf |