Abstract
This paper presents an archive maintenance scheme that can be used within an evaluation scheme for finding robust optima when dealing with expensive objective functions. This archive maintenance scheme aims to select the additional sampling points such that locally well-spread distributions of archive points will be generated. By doing so, the archive will contain better predictive information about the robustness of candidate solutions. Experiments on 10D test problems show that this scheme can be used for accurate local search for robust solutions. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Kruisselbrink, J., Emmerich, M., & Bäck, T. (2010). An archive maintenance scheme for finding robust solutions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6238 LNCS, pp. 214–223). https://doi.org/10.1007/978-3-642-15844-5_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
