Everything About ___
Live briefing

Everything about Memetic algorithm

Algorithm for searching a problem space

In computer science and operations research, a memetic algorithm (MA) is an extension of an evolutionary algorithm (EA) that aims to accelerate the evolutionary search for the optimum. An EA is a metaheuristic that reproduces the basic principles of biological evolution as a computer algorithm in order to solve challenging optimization or planning tasks, at least approximately. An MA uses one or more suitable heuristics or local search techniques to improve the quality of solutions generated by the EA and to speed up the search. The effects on the reliability of finding the global optimum depend on both the use case and the design of the MA. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Memetic algorithmA 5-minute orientation
  2. Skim a recent paper: Solving electric vehicle–drone routing problem using memetic algorithmInfluential work since 2022
  3. Pick up a classic book: Neural Information ProcessingThe most-reprinted book on the subject
  4. Read the landmark paper: Memetic algorithm for community detection in networksCited 197 times
  5. Go sideways: Memetic computingA closely related topic
  6. Go sideways: Evolutionary algorithmA closely related topic

📖 Definitions

Noun An algorithm for the evolution of genotypes, which includes a selected, non-genetic component.

🗂️ The subject at a glance

  1. Introduction
  2. Theoretical Background
  3. The development of MAs
  4. Some design notes
  5. Applications
  6. Recent activities in memetic algorithms

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics