Mathematical Analysis of Evolutionary Algorithms

  • Mühlenbein H
  • Mahnig T
N/ACitations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Parallel implementations of metaheuristics appear quite naturally as an effective alternative to speed up the search for approximate solutions of combinatorial optimization problems. They not only allow solving larger problems or finding improved solutions with respect to their sequential counterparts, but also lead to more robust algorithms. We review some trends in parallel computing and report recent results about linear speedups that can be obtained with parallel implementations using multiple independent processors. Parallel implementations of tabu search, GRASP, genetic algorithms, simulated annealing, and ant colonies are reviewed and discussed to illustrate the main strategies used in the parallelization of different metaheuristics and their hybrids. © 2002 by Springer Science+Business Media New York.

Cite

CITATION STYLE

APA

Mühlenbein, H., & Mahnig, Th. (2002). Mathematical Analysis of Evolutionary Algorithms (pp. 525–556). https://doi.org/10.1007/978-1-4615-1507-4_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free