In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...
Abstract. They appeared in our life some years ago with the awakening of the PC and now the are everywhere : computers have become ubiquitous and, almost, irreplaceable. Classical ...
Rich vehicle routing problems try to represent situations that can be found in reality. Starting from a case study, in this paper a rich vehicle routing problem is analyzed. The e...
Paola Pellegrini, Daniela Favaretto, Elena Moretti
This paper proposes a clustering method SOMAK, which is composed by Self-Organizing Maps (SOM) followed by the Ant K-means (AK) algorithm. The aim of this method is not to find an...
Jefferson R. Souza, Teresa Bernarda Ludermir, Lean...
Hyper-heuristics are new approaches which aim at raising the level of abstraction when solving combinatorial optimisation problems. In this paper we introduce a new hyper-heuristi...