We present methods to answer two basic questions that arise when benchmarking optimization algorithms. The first one is: which algorithm is the `best' one? and the second one:...
Abstract. We axiomatically characterise a class of algorithms for making sequential decisions in situations of complete ignorance. These algorithms assume that a decision maker (DM...
In recent years, optimization in dynamic environments has attracted a growing interest from the genetic algorithm community due to the importance and practicability in real world a...
We deepen the theoretical analysis of the genetic algorithm for the all-pairs shortest path problem proposed by Doerr, Happ and Klein (GECCO 2008). We show that the growth of the ...
Abstract. The paper provides an insight into the improved novel metaheuristics of the Firefly Algorithm for constrained continuous optimization tasks. The presented technique is in...