A Gentle Introduction to Memetic Algorithms
By Pablo Moscato, Carlos Cotta. Handbook of Metaheuristics, 2003
516 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/14edd9517cf21b970df43dc94d66ea59ef9e483a
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Gilbert Laporte
- Michel Gendreau
- Zalinda Othman
- Amin Jula
- Elankovan A. Sundararajan
- Alain Hertz
- Jean-François Cordeau
- Carlos Cotta
In Computational Theory and Mathematics
- Gilbert Laporte
- Zalinda Othman
- Amin Jula
- Elankovan A. Sundararajan
- Michel Gendreau
- Alain Hertz
- Jean-François Cordeau
- Carlos Cotta
Citations in the corpus
- New Heuristics for the Vehicle Routing Problem (2005, methodology): “Combination of solutions is the basic mechanism of population search which includes a large number of variants known as genetic algorithms (e.g., Reeves (2003)), and memetic algorithms (e.g., Moscato and Cotta (2003)).”
- Cloud computing service composition: A systematic literature review (2014, methodology): “…of the response time and execution cost of the service composition process motivated Jula et al. to propose Imperialist competitive-gravitational attraction search algorithm (ICGAS) as a new memetic algorithm (Moscato & Cotta, 2003) for solving the CCSC problem (Jula, Othman, & Sundararajan, 2013).”
- A memetic algorithm for bi-objective integrated forward/reverse logistics network design (2010, background): “MAs are population-based heuristic search approaches for optimization problems similar to GAs with often additional local searches proved to be of practical success in a variety of problem domains and in particular for the approximate solution of NP-hard optimization problems [42].”
- Memetic algorithms and memetic computing optimization: A literature review (2012, background): “Of course, this procedure can be easily extended to use a larger collection of variation operators applied in a pipeline fashion [142].”
- Industrial aspects and literature survey: Fleet composition and routing (2010, methodology): “[92] describe a memetic algorithm (MA) [104] for the FSMVRP, a hybrid of a genetic algorithm and a local search based on GENIUS and λ-interchange [110].”