Black-box optimization benchmarking of two variants of the POEMS algorithm on the noiseless testbed

Authors:
Jiří Kubalik
Affiliations:
CTU in Prague, Prague, Czech Rep
Venue:
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Year:
2010

Citing 4
Cited 0

Solving the sorting network problem using iterative optimization with evolved hypermutations

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Black-box optimization benchmarking of prototype optimization with evolved improvement steps for noiseless function testbed

Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Solving the multiple sequence alignment problem using prototype optimization with evolved improvement steps

ICANNGA'09 Proceedings of the 9th international conference on Adaptive and natural computing algorithms
Efficient stochastic local search algorithm for solving the shortest common supersequence problem

Proceedings of the 12th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents benchmarking of a stochastic local search algorithm called Prototype Optimization with Evolved Improvement Steps (POEMS) on the BBOB 2010 noise-free functions testbed. An original version of the POEMS algorithm presented at BBOB 2009 workshop is compared to a new variant using a pool of candidate prototypes. Experiments for 2D, 3D, 5D, 10D and 20D were done. Experimental results show that the new variant of POEMS performs better on several functions for lower dimensions. Both variants perform equally on the 20D problems.