Memetic algorithm

from Wikipedia, the free encyclopedia

Memetic algorithms are a population-based approach for the heuristic search for optimization problems. For some problems they have proven to be more efficient than pure genetic algorithms . Some researchers consider them to be hybrid genetic algorithms or parallel genetic algorithms .

If one starts with genetic algorithms and supplements them with local search functions , this is called a memetic algorithm.

Memetic algorithms have already been applied to a large number of real problems, for example to create a university timetable, to predict protein structures or to calculate flight paths.

The memetics is a research direction in the evolutionary processes are examined that occur in the distribution and modification of ideas and other cultural concepts. These processes can be understood as a natural model for the algorithms described, hence the term memetic .

credentials

  • P. Moscato, On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms , Caltech Concurrent Computation Program, C3P Report 826, (1989).
  • Recent Advances in Memetic Algorithms , Series: Studies in Fuzziness and Soft Computing, Vol. 166, Hart, William E .; Krasnogor, N .; Smith, JE (Eds.), 2005