Haiku - A Scala combinator toolkit for semi-automated composition of metaheuristics

3Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

There is an emerging trend towards the automated design of metaheuristics at the software component level. In principle, metaheuristics have a relatively clean decomposition, where well-known frameworks such as ILS and EA are parametrised by variant components for acceptance, perturbation etc. Automated generation of these frameworks is not so simple in practice, since the coupling between components may be implementation specific. Compositionality is the ability to freely express a space of designs ‘bottom up’ in terms of elementary components: previous work in this area has used combinators, a modular and functional approach to componentisation arising from foundational Computer Science. In this article, we describe Haiku, a combinator tool-kit written in the Scala language, which builds upon previous work to further automate the process by automatically composing the external dependencies of components. We provide examples of use and give a case study in which a programatically-generated heuristic is applied to the Travelling Salesman Problem within an Evolutionary Strategies framework.

Cite

CITATION STYLE

APA

Kocsis, Z. A., Brownlee, A. E. I., Swan, J., & Senington, R. (2015). Haiku - A Scala combinator toolkit for semi-automated composition of metaheuristics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9275, pp. 125–140). Springer Verlag. https://doi.org/10.1007/978-3-319-22183-0_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free