A Gentle Introduction to Memetic Algorithms

@inproceedings{Moscato2003AGI,
  title={A Gentle Introduction to Memetic Algorithms},
  author={Pablo Moscato and Carlos Cotta},
  booktitle={Handbook of Metaheuristics},
  year={2003}
}
The generic denomination of ‘Memetic Algorithms’ (MAs) is used to encompass a broad class of metaheuristics (i.e. general purpose methods aimed to guide an underlying heuristic). The method is based on a population of agents and proved to be of practical success in a variety of problem domains and in particular for the approximate solution of NP Optimization problems. Unlike traditional Evolutionary Computation (EC) methods, MAs are intrinsically concerned with exploiting all available… CONTINUE READING

Figures and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 272 CITATIONS, ESTIMATED 99% COVERAGE

A flexible integrated forward/reverse logistics model with random path

Elham Behmanesh
  • 2019
VIEW 7 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

The impact of social context in social problem solving

VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2001
2019

CITATION STATISTICS

  • 10 Highly Influenced Citations

  • Averaged 12 Citations per year from 2017 through 2019

References

Publications referenced by this paper.
SHOWING 1-10 OF 219 REFERENCES

A multi-stage approach for the thermal generator maintenance scheduling problem

A.J.E.K. Burke
  • Proceedings of the 1999 Congress on Evolutionary Computation
  • 1999
VIEW 11 EXCERPTS
HIGHLY INFLUENTIAL

A hybrid heuristic for the uncapacitated hub location problem

  • European Journal of Operational Research
  • 1998
VIEW 8 EXCERPTS
HIGHLY INFLUENTIAL