Modular Differential Evolution

arXiv (Cornell University)

Abstract

New contributions in the field of iterative optimisation heuristics are often made in an iterative manner. Novel algorithmic ideas are not proposed in isolation, but usually as an extension of a preexisting algorithm. Although these contributions are often compared to the base algorithm, it is challenging to make fair comparisons between larger sets of algorithm variants. This happens because even small changes in the experimental setup, parameter settings, or implementation details can cause results to become incomparable. Modular algorithms offer a way to overcome these challenges. By implementing the algorithmic modifications into a common framework, many algorithm variants can be compared, while ensuring that implementation details match in all versions. In this work, we propose a version of a modular framework for the popular Differential Evolution (DE) algorithm. We show that this modular approach not only aids in comparison, but also allows for a much more detailed exploration of the space of possible DE variants. This is illustrated by showing that tuning the settings of modular DE vastly outperforms a set of commonly used DE versions which have been recreated in our framework. We then investigate these tuned algorithms in detail, highlighting the relation between modules and performance on particular problems.

Authors 4

1. Diederick Vermetten Aachen Leiden Institute for Advanced Computer Science Leiden

   Leiden University

   Affiliation as printed

   Leiden Institute for Advanced Computer Science Leiden , The Netherlands

2. Fabio Caraffini

   Swansea University

   Affiliation as printed

   Swansea University Swansea , United Kingdom

3. Anna V. Kononova Aachen Leiden Institute for Advanced Computer Science Leiden

   Leiden University

   Affiliation as printed

   Leiden Institute for Advanced Computer Science Leiden , The Netherlands

4. Thomas Bäck