ParaDisEO is a framework dedicated to the design of parallel and distributed metaheuristics including local search methods and evolutionary algorithms. This paper focuses on the la...
In this work we study how using multiple communicating populations instead of a single panmictic one may help in maintaining diversity during GP runs. After defining suitable geno...
Marco Tomassini, Leonardo Vanneschi, Francisco Fer...
Abstract. We propose a new niching method for Evolutionary Algorithms which is able to identify and track global and local optima in a multimodal search space. To prevent the loss ...
Felix Streichert, Gunnar Stein, Holger Ulmer, Andr...
This paper addresses the problem of cooperative transport of an object by a group of two simple autonomous mobile robots called s-bots. S-bots are able to establish physical connec...
Although there are some real world applications where the use of variable length representation (VLR) in Evolutionary Algorithm is natural and suitable, an academic framework is la...
We present quantitative models for the selection pressure on cellular evolutionary algorithms structured as a ring of cells. We obtain results for synchronous and asynchronous cell...
Mario Giacobini, Marco Tomassini, Andrea Tettamanz...
This paper presents simulations of long-term co-evolution in simple artificial ecosystems composed of different plant species. Artificial plants and plant communities, evolving in ...
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
The aim of this research is to develop an adaptive agent based model of auction scenarios commonly used in auction theory to help understand how competitors in auctions reach equil...