Exploring selection mechanisms for an agent-based distributed evolutionary algorithm

Authors:
E. A. Eiben;M. Schoenauer;J. L. J. Laredo;P. A. Castillo;A. M. Mora;J. J. Merelo
Affiliations:
Vrije Universiteit Amsterdam;University of Paris-Sud;University of Granada;University of Granada;University of Granada;University of Granada
Venue:
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Year:
2007

Citing 10
Cited 7

The blackboard model of problem solving

AI Magazine
Efficient and Accurate Parallel Genetic Algorithms

Efficient and Accurate Parallel Genetic Algorithms
A Framework for Distributed Evolutionary Algorithms

PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Genetic Algorithms in a Multi-Agent System

INTSYS '98 Proceedings of the IEEE International Joint Symposia on Intelligence and Systems
A Comparative Study of Five Parallel Genetic Algorithms using the Traveling Salesman Problem

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Overlay Networks: A Scalable Alternative for P2P

IEEE Internet Computing
Introduction to Evolutionary Computing

Introduction to Evolutionary Computing
Gossip-based aggregation in large dynamic networks

ACM Transactions on Computer Systems (TOCS)
G2DGA: an adaptive framework for internet-based distributed genetic algorithms

GECCO '05 Proceedings of the 7th annual workshop on Genetic and evolutionary computation
A robust and scalable peer-to-peer gossiping protocol

AP2PC'03 Proceedings of the Second international conference on Agents and Peer-to-Peer Computing

P2P Evolutionary Algorithms: A Suitable Approach for Tackling Large Instances in Hard Optimization Problems

Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
On the Run-Time Dynamics of a Peer-to-Peer Evolutionary Algorithm

Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Evolvable Agents in Static and Dynamic Optimization Problems

Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
EP-MAS.Lib: A MAS-Based Evolutionary Program Approach

HAIS '09 Proceedings of the 4th International Conference on Hybrid Artificial Intelligence Systems
Open-ended on-board evolutionary robotics for robot swarms

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
What is situated evolution?

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Resilience to churn of a peer-to-peer evolutionary algorithm

International Journal of High Performance Systems Architecture

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose an agent-based model of evolutionary algorithms (EAs) which extends seamlessly from concurrent single-host to distributed multi-host installations. Since the model is based on locally executable selection, we focus on the comparison of two selection mechanisms which accomplish with such a restriction: the classical tournament method and a new one called autonomous selection. Using the latter method the population size changes during runtime, hence it is not only interesting as a new selection mechanism, but also from the perspective of scalable networks.