The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Classification of adaptive memetic algorithms: a comparative study
Open accessAbstract
Adaptation of parameters and operators represents one of the recent most important and promising areas of research in evolutionary computations; it is a form of designing self-configuring algorithms that acclimatize to suit the problem in hand. Here, our interests are on a recent breed of hybrid evolutionary algorithms typically known as adaptive memetic algorithms (MAs). One unique feature of adaptive MAs is the choice of local search methods or memes and recent studies have shown that this choice significantly affects the performances of problem searches. In this paper, we present a classification of memes adaptation in adaptive MAs on the basis of the mechanism used and the level of historical knowledge on the memes employed. Then the asymptotic convergence properties of the adaptive MAs considered are analyzed according to the classification. Subsequently, empirical studies on representatives of adaptive MAs for different type-level meme adaptations using continuous benchmark problems indicate that global-level adaptive MAs exhibit better search performances. Finally we conclude with some promising research directions in the area.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
A Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Goldberg, D. E., & Shakespeare, W. (2002) · Cited by 16,088
(1976) · Cited by 10,423
Goldberg, D. E. (1989) · Medical Entomology and Zoology · Cited by 10,109
McKay, M. D., Beckman, R. J., & Conover, W. J. (2000) · Technometrics · doi:10.2307/1271432 · Cited by 7,415
Powell, M. J. D. (1964) · The Computer Journal · doi:10.1093/comjnl/7.2.155 · Cited by 4,632
`` Direct Search'' Solution of Numerical and Statistical Problems
Hooke, R., & Jeeves, T. A. (1961) · Journal of the ACM · doi:10.1145/321062.321069 · Cited by 4,254
A new approach to variable metric algorithms
Fletcher, R. (1970) · The Computer Journal · doi:10.1093/comjnl/13.3.317 · Cited by 4,068
McKay, M. D., Beckman, R. J., & Conover, W. J. (1979) · Technometrics · doi:10.2307/1268522 · Cited by 3,757
Optimization of Control Parameters for Genetic Algorithms
Grefenstette, J. (1986) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1986.289288 · Cited by 2,854
Adaptive probabilities of crossover and mutation in genetic algorithms
Srinivas, M., & Patnaik, L. M. (1994) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.286385 · Cited by 2,512
Schwefel, H. (1995) · Cited by 2,203
Parameter control in evolutionary algorithms
Eiben, A. E., Hinterding, R., & Michalewicz, Z. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.771166 · Cited by 1,980
Törn, A., & Žilinskas, A. (1989) · Cited by 1,673
Convergence analysis of canonical genetic algorithms
Rudolph, G. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.265964 · Cited by 1,484
Ishibuchi, H., Yoshida, T., & Murata, T. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.810752 · Cited by 773
(1989) · Lecture Notes in Computer Science · doi:10.1007/3-540-50871-6 · Cited by 717
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
Self-citationHandbook of Test Problems in Local and Global Optimization
Floudas, C. A., Pardalos, P. M., Adjiman, C. S., Esposito, W. R., Gümüş, Z. H., Harding, S. T., Klepeis, J. L., Meyer, C. A., & Schweiger, C. A. (1999) · Nonconvex Optimization and Its Applications · doi:10.1007/978-1-4757-3040-1 · Cited by 636
A Tabu-Search Hyperheuristic for Timetabling and Rostering
Burke, E. K., Kendall, G., & Soubeiga, E. (2003) · Journal of Heuristics · doi:10.1023/b:heur.0000012446.94732.b6 · Cited by 509
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
Fitness landscape analysis and memetic algorithms for the quadratic assignment problem
Freisleben, B., & Merz, P. (2000) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.887234 · Cited by 423
Generalized descent for global optimization
Griewank, A. (1981) · Journal of Optimization Theory and Applications · doi:10.1007/bf00933356 · Cited by 381
(2017) · Encyclopedia of GIS · doi:10.1007/978-3-319-17885-1_100388 · Cited by 362
Adaptive Global Optimization with Local Search
Hart, W. E. (1994) · Cited by 296
Adaptation in evolutionary computation: a survey
Hinterding, R., Michalewicz, Z., & Eiben, A. E. (2002) · IEEE International Conference on Evolutionary Computation (ICEC) · doi:10.1109/icec.1997.592270 · Cited by 290
A Markov chain analysis on simple genetic algorithms
Suzuki, J. (1995) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.370197 · Cited by 248
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
Fitness landscapes and memetic algorithm design
Merz, P., & Freisleben, B. (1999) · Cited by 123
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
Hyper-heuristics: a survey of the state of the art
Burke, E. K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., & Qu, R. (2013) · Journal of the Operational Research Society · doi:10.1057/jors.2013.71 · Cited by 1,263
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
Civicioglu, P., & Besdok, E. (2013) · Artificial Intelligence Review · doi:10.1007/s10462-011-9276-0 · Cited by 669
Accelerating Differential Evolution Using an Adaptive Local Search
Noman, N., & Iba, H. (2008) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.895272 · Cited by 610
Metadata
- Authors
- Ong, Y.-S., Lim, M.-H., Zhu, N., & Wong, K.-W.
- Venue
- IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics)
- Published
- 2006-02
- Volume
- 36
- Issue
- 1
- Pages
- 141-152
- ISSN
- 1083-4419 (ISSN-L)
- OpenAlex
- W2114620686
- Cited by
- 514
- References
- 31
- FWCI
- 44.01
- 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.