The surprising little effectiveness of cooperative algorithms in parallel problem solving

12/06/2019
by   Sandro M. Reia, et al.
0

Biological and cultural inspired optimization algorithms are nowadays part of the basic toolkit of a great many research domains. By mimicking processes in nature and animal societies, these general-purpose search algorithms promise to deliver optimal or near-optimal solutions using hardly any information on the optimization problems they are set to tackle. Here we study the performances of a cultural-inspired algorithm – the imitative learning search – as well as of asexual and sexual variants of evolutionary algorithms in finding the global maxima of NK-fitness landscapes. The main performance measure is the total number of agent updates required by the algorithms to find those global maxima and the baseline performance, which establishes the worth of the cooperative algorithms, is set by the blind search in which the agents explore the problem space (binary strings) by flipping randomly chosen bits. We find that even for smooth landscapes that exhibit a single maximum, the evolutionary algorithms do not perform much better than the blind search due to the stochastic effects of the genetic roulette. The imitative learning is immune to this effect thanks to the deterministic choice of the fittest string in the population, which is used as a model for imitation. The tradeoff is that it is more prone to be trapped in local maxima than the evolutionary algorithms in the case of mildly rugged landscapes. In fact, in the case of rugged landscapes with a not too low density of local maxima, the blind search beats the cooperative algorithms regardless of whether the task is to find the global maximum or to find the fittest state within a given runtime.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/30/2020

Hybridization of interval methods and evolutionary algorithms for solving difficult optimization problems

Reliable global optimization is dedicated to finding a global minimum in...
research
03/27/2019

Tree Search vs Optimization Approaches for Map Generation

Search-based procedural content generation uses stochastic global optimi...
research
10/16/2015

Hybridization of Interval CP and Evolutionary Algorithms for Optimizing Difficult Problems

The only rigorous approaches for achieving a numerical proof of optimali...
research
01/09/2007

Cooperative Optimization for Energy Minimization: A Case Study of Stereo Matching

Often times, individuals working together as a team can solve hard probl...
research
01/24/2014

The Sampling-and-Learning Framework: A Statistical View of Evolutionary Algorithms

Evolutionary algorithms (EAs), a large class of general purpose optimiza...
research
02/18/2021

Modeling epigenetic evolutionary algorithms: An approach based on the epigenetic regulation process

Many biological processes have been the source of inspiration for heuris...
research
08/21/2021

Searching for a practical evidence of the No Free Lunch theorems

According to the No Free Lunch (NFL) theorems all black-box algorithms p...

Please sign up or login with your details

Forgot password? Click here to reset