@conference {34,
	title = {A Separability Prototype for Automatic Memes with Adaptive Operator Selection},
	booktitle = {Foundations of Computational Intelligence (FOCI), 2014 IEEE Symposium on},
	year = {2014},
	month = {Dec},
	abstract = {One of the main challenges in algorithmics in general, and in Memetic Computing, in particular, is the automatic design of search algorithms. A recent advance in this direction (in terms of continuous problems) is the development of a software prototype that builds up an algorithm based upon a problem analysis of its separability. This prototype has been called the Separability Prototype for Automatic Memes (SPAM). This article modifies the SPAM by incorporating within it an adaptive model used in hyper-heuristics for tackling optimization problems. This model, namely Adaptive Operator Selection (AOS), rewards at run time the most promising heuristics/memes so that they are more likely to be used in the following stages of the search process. The resulting framework, here referred to as SPAM-AOS, has been tested on various benchmark problems and compared with modern algorithms representing the-state-of-the-art of search for continuous problems. Numerical results show that the proposed SPAM-AOS is a promising framework that outperforms the original SPAM and other modern algorithms. Most importantly, this study shows how certain areas of Memetic Computing and Hyper-heuristics are very closely related topics and it also shows that their combination can lead to the development of powerful algorithmic frameworks.},
	keywords = {Adaptation models, adaptive model, adaptive operator selection, Algorithm design and analysis, algorithmics, automatic design, Benchmark testing, hyper-heuristics, memetic computing, optimisation, optimization, optimization problems, Prototypes, search algorithms, search problems, search process, separability prototype for automatic memes, Software algorithms, software prototype, software prototyping, SPAM-AOS, Unsolicited electronic mail},
	doi = {10.1109/FOCI.2014.7007809},
	author = {Epitropakis, M.G. and Caraffini, F. and Neri, F. and Burke, E.K.}
}
@conference {18,
	title = {Evolutionary Adaptation of the Differential Evolution Control Parameters},
	booktitle = {IEEE Congress on Evolutionary Computation, 2009. CEC 2009},
	year = {2009},
	month = {May},
	address = {Trondheim, Norway},
	abstract = {This paper proposes a novel self-adaptive scheme for the evolution of crucial control parameters in evolutionary algorithms. More specifically, we suggest to utilize the differential evolution algorithm to endemically evolve its own control parameters. To achieve this, two simultaneous instances of Differential Evolution are used, one of which is responsible for the evolution of the crucial user-defined mutation and recombination constants. This self-adaptive differential evolution algorithm alleviates the need of tuning these user-defined parameters while maintains the convergence properties of the original algorithm. The evolutionary self-adaptive scheme is evaluated through several well-known optimization benchmark functions and the experimental results indicate that the proposed approach is promising.},
	keywords = {adaptive control, differential evolution control parameter, evolutionary adaptation, evolutionary computation, optimisation, optimization, self-adaptive differential evolution algorithm, self-adjusting systems, user-defined parameter tuning},
	doi = {10.1109/CEC.2009.4983102},
	author = {M. G. Epitropakis and V. P. Plagianakos and M. N. Vrahatis}
}
