The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
A Tutorial for Competent Memetic Algorithms: Model, Taxonomy, and Design Issues
Open accessAbstract
The combination of evolutionary algorithms with local search was named "memetic algorithms" (MAs) (Moscato, 1989). These methods are inspired by models of natural systems that combine the evolutionary adaptation of a population with individual learning within the lifetimes of its members. Additionally, MAs are inspired by Richard Dawkin's concept of a meme, which represents a unit of cultural evolution that can exhibit local refinement (Dawkins, 1976). In the case of MA's, "memes" refer to the strategies (e.g., local refinement, perturbation, or constructive methods, etc.) that are employed to improve individuals. In this paper, we review some works on the application of MAs to well-known combinatorial optimization problems, and place them in a framework defined by a general syntactic model. This model provides us with a classification scheme based on a computable index D, which facilitates algorithmic comparisons and suggests areas for future research. Also, by having an abstract model for this class of metaheuristics, it is possible to explore their design space and better understand their behavior from a theoretical standpoint. We illustrate the theoretical and practical relevance of this model and taxonomy for MAs in the context of a discussion of important design issues that must be addressed to produce effective and efficient MAs.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
(1976) · Cited by 10,423
Handbook of Genetic Algorithms
Davis, L. D. (1991) · Cumulative Index of Computer Aided Architectural Design · Cited by 7,330
On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms
Moscato, P. (1989) · Cited by 1,516
Theory for the folding and stability of globular proteins
Dill, K. A. (1985) · Biochemistry · doi:10.1021/bi00327a032 · Cited by 1,249
The Design of Innovation: Lessons from and for Competent Genetic Algorithms
Goldberg, D. E. (2002) · Cited by 901
Johnson, D. S., Papadimitriou, C. H., & Yannakakis, M. (1988) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(88)90046-3 · Cited by 705
Meta-Lamarckian Learning in Memetic Algorithms
Ong, Y. S., & Keane, A. J. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.819944 · Cited by 657
A Hyperheuristic Approach to Scheduling a Sales Summit
Cowling, P., Kendall, G., & Soubeiga, E. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44629-x_11 · Cited by 475
Goldberg, D. E. (2002) · Genetic Algorithms and Evolutionary Computation · doi:10.1007/978-1-4757-3643-4 · Cited by 470
Memetic algorithms: a short introduction
Moscato, P. (1999) · McGraw-Hill Ltd., UK eBooks · Cited by 455
Recent Advances in Memetic Algorithms
Hart, W. E., Smith, J. E., & Krasnogor, N. (2005) · Springer eBooks · doi:10.1007/3-540-32363-5 · Cited by 446
Self-citationProtein Folding in the Hydrophobic-Hydrophilic ( HP ) Model is NP-Complete
BERGER, B., & LEIGHTON, T. (1998) · Journal of Computational Biology · doi:10.1089/cmb.1998.5.27 · Cited by 420
Guided local search and its application to the traveling salesman problem
Voudouris, C., & Tsang, E. (1999) · European Journal of Operational Research · doi:10.1016/s0377-2217(98)00099-x · Cited by 409
On the Complexity of Protein Folding
CRESCENZI, P., GOLDMAN, D., PAPADIMITRIOU, C., PICCOLBONI, A., & YANNAKAKIS, M. (1998) · Journal of Computational Biology · doi:10.1089/cmb.1998.5.423 · Cited by 361
M-PAES: a memetic algorithm for multiobjective optimization
Knowles, J. D., & Corne, D. W. (2002) · Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512) · doi:10.1109/cec.2000.870313 · Cited by 359
An Introduction to Variable Neighborhood Search
Hansen, P., & Mladenović, N. (1999) · Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization · doi:10.1007/978-1-4615-5775-3_30 · Cited by 340
Real-Coded Memetic Algorithms with Crossover Hill-Climbing
Lozano, M., Herrera, F., Krasnogor, N., & Molina, D. (2004) · Evolutionary Computation · doi:10.1162/1063656041774983 · Cited by 320
Self-citationGenetic algorithms with a robust solution searching scheme
Tsutsui, S., & Ghosh, A. K. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.661550 · Cited by 311
Genetic and hybrid algorithms for graph coloring
Fleurent, C., & Ferland, J. A. (1996) · Annals of Operations Research · doi:10.1007/bf02125407 · Cited by 309
Adaptive Global Optimization with Local Search
Hart, W. E. (1994) · Cited by 296
Evolutionary algorithms and gradient search: similarities and differences
Salomon, R. (1998) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.728207 · Cited by 278
A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems
Freisleben, B., & Merz, P. (2002) · Proceedings of IEEE International Conference on Evolutionary Computation · doi:10.1109/icec.1996.542671 · Cited by 277
ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy
Gorges-Schleuter, M. (1989) · Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) · Cited by 242
Genetic local search for the TSP: new results
Merz, P., & Freisleben, B. (2002) · IEEE International Conference on Evolutionary Computation (ICEC) · doi:10.1109/icec.1997.592288 · Cited by 236
Genetic hybrids for the quadratic assignment problem
Fleurent, C., & Ferland, J. A. (1994) · DIMACS series in discrete mathematics and theoretical computer science · doi:10.1090/dimacs/016/08 · Cited by 228
Voudouris, C., Tsang, E. P. K., & Alsheddy, A. (2010) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4419-1665-5_11 · Cited by 215
Operator and parameter adaptation in genetic algorithms
Smith, J. E., & Fogarty, T. C. (1997) · Soft Computing · doi:10.1007/s005000050009 · Cited by 215
Self-citationEdge Assembly Crossover.A High-power Genetic Algorithm for the Traveling Salesman Problem
Nagata, Y. (1997) · international conference on Genetic algorithms · Cited by 189
Multimeme Algorithms for Protein Structure Prediction
Krasnogor, N., Blackburne, B. P., Burke, E. K., & Hirst, J. D. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45712-7_74 · Cited by 182
Self-citationJulstrom, B. A. (1995) · international conference on Genetic algorithms · Cited by 178
New genetic local search operators for the traveling salesman problem
Freisleben, B., & Merz, P. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61723-x_1052 · Cited by 167
On the Futility of Blind Search: An Algorithmic View of “No Free Lunch”
Culberson, J. C. (1998) · Evolutionary Computation · doi:10.1162/evco.1998.6.2.109 · Cited by 164
Merz, P., & Freisleben, B. (2003) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.1999.785529 · Cited by 155
Fitness Landscapes, Memetic Algorithms, and Greedy Operators for Graph Bipartitioning
Merz, P., & Freisleben, B. (2000) · Evolutionary Computation · doi:10.1162/106365600568103 · Cited by 144
A new genetic local search algorithm for graph coloring
Dorne, R., & Hao, J. (1998) · Lecture notes in computer science · doi:10.1007/bfb0056916 · Cited by 135
Crossover, Macromutation, and Population-Based Search
Jones, T. (1995) · Cited by 130
Empirical Investigation of the Benefits of Partial Lamarckianism
Houck, C. R., Joines, J. A., Kay, M. G., & Wilson, J. R. (1997) · Evolutionary Computation · doi:10.1162/evco.1997.5.1.31 · Cited by 113
A Study on the use of ``self-generation'' in memetic algorithms
Krasnogor, N., & Gustafson, S. (2004) · Natural Computing · doi:10.1023/b:naco.0000023419.83147.67 · Cited by 102
Self-citationEmbedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
Costa, D., Hertz, A., & Dubuis, C. (1995) · Journal of Heuristics · doi:10.1007/bf02430368 · Cited by 92
Protein folding in the hydrophobic-hydrophilic (HP) is NP-complete
Berger, B., & Leighton, T. (1998) · Research in Computational Molecular Biology · doi:10.1145/279069.279080 · Cited by 86
A Taxonomy of Evolutionary Algorithms in Combinatorial Optimization
Calégari, P., Coray, G., Hertz, A., Kobler, D., & Kuonen, P. (1999) · Journal of Heuristics · doi:10.1023/a:1009625526657 · Cited by 77
Self Generating Metaheuristics in Bioinformatics: The Proteins Structure Comparison Case
Krasnogor, N. (2004) · Genetic Programming and Evolvable Machines · doi:10.1023/b:genp.0000023687.41210.d7 · Cited by 76
Self-citationShaping Life : Genes, Embryos and Evolution
Smith, J. M. (1998) · Medical Entomology and Zoology · Cited by 63
Self-citationAlignment of protein structures with a memetic evolutionary algorithm
Carr, B., Hart, W. E., Krasnogor, N., Hirst, J. D., Burke, E., & Smith, J. E. (2002) · UWE Research Repository (UWE Bristol) · Cited by 41
Self-citationSelf-Adaptation in Evolutionary Algorithms for Combinatorial Optimisation
Smith, J. E. (2008) · Studies in computational intelligence · doi:10.1007/978-3-540-79438-7_2 · Cited by 38
Self-citationThe Co-Evolution of Memetic Algorithms for Protein Structure Prediction
Smith, J. E. (2006) · Springer eBooks · doi:10.1007/3-540-32363-5_6 · Cited by 34
Self-citationEmpirical analysis of the factors that affect the Baldwin effect
Ku, K. W. C., & Mak, M. (1998) · Lecture notes in computer science · doi:10.1007/bfb0056890 · Cited by 28
(1998) · doi:10.1002/(sici)1096-987x(19981115)19:14<1639::aid-jcc10>3.0.co;2-b
Cited by
Exploration and exploitation in evolutionary algorithms: A survey
Črepinšek, M., Liu, S.-H., & Mernik, M. (2013) · ACM Computing Surveys · doi:10.1145/2480741.2480752 · Cited by 1,298
Differential Evolution Using a Neighborhood-Based Mutation Operator
Das, S., Abraham, A., Chakraborty, U. K., & Konar, A. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.2009457 · Cited by 1,165
Memetic algorithms and memetic computing optimization: A literature review
Neri, F., & Cotta, C. (2012) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.11.003 · Cited by 680
A Multi-Facet Survey on Memetic Computation
Chen, X., Ong, Y.-S., Lim, M.-H., & Tan, K. C. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2011.2132725 · Cited by 512
From evolutionary computation to the evolution of things
Eiben, A. E., & Smith, J. (2015) · Nature · doi:10.1038/nature14544 · Cited by 496
Self-citation
Metadata
- Authors
- Krasnogor, N., & Smith, J.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2005-10
- Volume
- 9
- Issue
- 5
- Pages
- 474-488
- ISSN
- 1089-778X (ISSN-L)
- OpenAlex
- W2170186790
- Cited by
- 727
- References
- 49
- FWCI
- 41.57
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.