Learn More
We present discrete stochastic mathematical models for the growth curves of synchronous and synchronous evolutionary algorithms with populations structured ccording to a random graph. We show that, to good approximation, randomly structured and panmictic populations have the some growth behavior. Furthermore, we show that global selection intensity depends(More)
—In this paper, we present quantitative models for the selection pressure of cellular evolutionary algorithms on regular one-and two-dimensional (2-D) lattices. We derive models based on probabilistic difference equations for synchronous and several asynchronous cell update policies. The models are validated using two customary selection methods: binary(More)
We explore the Hawk-Dove game on networks with topologies ranging from regular lattices to random graphs with small-world networks in between. This is done by means of computer simulations using several update rules for the population evolutionary dynamics. We find the overall result that cooperation is sometimes inhibited and sometimes enhanced in those(More)
In this paper we investigate the properties of CEAs with populations structured as Watts–Strogatz small-world graphs and Albert–Barabási scale-free graphs as problem solvers, using several standard discrete optimization problems as a benchmark. The EA variants employed include self-adaptation of mutation rates. Results are compared with the corresponding(More)
We study an extension of cellular automata to arbitrary interconnection topologies for the majority and the synchronization problems. By using an evolutionary algorithm, we show that small-world type network topologies consistently evolve from regular and random structures without being designed beforehand. These topologies have better performance than(More)
We investigate the performances of collective task-solving capabilities and the robust-ness of complex networks of automata using the density and synchronization problems as typical cases. We show by computer simulations that evolved Watts–Strogatz small-world networks have superior performance with respect to several kinds of scale-free graphs. In(More)
This paper presents a comparative study of several asyn-chronous policies for updating the population in a cellular genetic algorithm (cGA). Cellular GA's are regular GA's with the important exception that individuals are placed in a given geographical distribution (usually a 2-d grid). Operators are applied locally on a set made of each individual and the(More)
In this chapter we study cellular evolutionary algorithms, a kind of decentralized heuristics, and the importance of their induced explo-ration/exploitation balance on different problems. It is shown that, by choosing synchronous or asynchronous update policies, the selection pressure, and thus the exploration/exploitation tradeoff, can be influenced(More)