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

Authors:
J. L. Laredo;A. E. Eiben;M. Steen;P. A. Castillo;A. M. Mora;J. J. Merelo
Affiliations:
Department of Architecture and Computer Technology, University of Granada, Spain;Department of Computer Science, Vrije Universiteit Amsterdam, The Netherlands;Department of Computer Science, Vrije Universiteit Amsterdam, The Netherlands;Department of Architecture and Computer Technology, University of Granada, Spain;Department of Architecture and Computer Technology, University of Granada, Spain;Department of Architecture and Computer Technology, University of Granada, Spain
Venue:
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Year:
2008

Citing 8
Cited 2

A Framework for Distributed Evolutionary Algorithms

PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Introduction to Evolutionary Computing

Introduction to Evolutionary Computing
Spatially Structured Evolutionary Algorithms: Artificial Evolution in Space and Time (Natural Computing Series)

Spatially Structured Evolutionary Algorithms: Artificial Evolution in Space and Time (Natural Computing Series)
Gossip-based aggregation in large dynamic networks

ACM Transactions on Computer Systems (TOCS)
Exploring selection mechanisms for an agent-based distributed evolutionary algorithm

Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Peer-to-peer evolutionary algorithms with adaptive autonomous selection

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Effects of scale-free and small-world topologies on binary coded self-adaptive CEA

EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Selection intensity in cellular evolutionary algorithms for regular lattices

IEEE Transactions on Evolutionary Computation

Peer-to-Peer Optimization in Large Unreliable Networks with Branch-and-Bound and Particle Swarms

EvoWorkshops '09 Proceedings of the EvoWorkshops 2009 on Applications of Evolutionary Computing: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG
The state of peer-to-peer network simulators

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a distributed Evolutionary Algorithm (EA) whose population is structured using newscast, a gossiping protocol. This algorithm has been designed to deal with computationally expensive problems via massive scalability; therefore, we analyse the response time of the model using large instances of well-known hard optimization problems that require from EAs a (sometimes exponentially) bigger computational effort as these problems scale. Our approach has been matched against a sequential Genetic Algorithm (sGA) applied to the same set of problems, and we found that it needs less computational effort than the sGA in yielding success. Furthermore, the response time scales logarithmically with respect to the problem size, which makes it suitable to tackle large instances.