The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Meta-Lamarckian Learning in Memetic Algorithms
Abstract
Over the last decade, memetic algorithms (MAs) have relied on the use of a variety of different methods as the local improvement procedure. Some recent studies on the choice of local search method employed have shown that this choice significantly affects the efficiency of problem searches. Given the restricted theoretical knowledge available in this area and the limited progress made on mitigating the effects of incorrect local search method choice, we present strategies for MA control that decide, at runtime, which local method is chosen to locally improve the next chromosome. The use of multiple local methods during a MA search in the spirit of Lamarckian learning is here termed Meta-Lamarckian learning. Two adaptive strategies for Meta-Lamarckian learning are proposed in this paper. Experimental studies with Meta-Lamarckian learning strategies on continuous parametric benchmark problems are also presented. Further, the best strategy proposed is applied to a real-world aerodynamic wing design problem and encouraging results are obtained. It is shown that the proposed approaches aid designers working on complex engineering problems by reducing the probability of employing inappropriate local search methods in a MA, while at the same time, yielding robust and improved design search performance.
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
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
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
McKay, M. D., Beckman, R. J., & Conover, W. J. (2000) · Technometrics · doi:10.2307/1271432 · Cited by 7,415
Handbook of Genetic Algorithms
Davis, L. D. (1991) · Cumulative Index of Computer Aided Architectural Design · Cited by 7,330
Powell, M. J. D. (1964) · The Computer Journal · doi:10.1093/comjnl/7.2.155 · Cited by 4,632 · cited 1×
“MA-LA GA with repeated Lagrangian interpolation as implemented by Schwefel [25]; MA-NM GA with simplex method by Nelder and Meade [28]; MA-PD GA with Powell’s direct search method [29] as produced by AERE Harwell; MA-PO GA with Powell’s direct search method [29] as implemented by Schwefel [25].”
MethodMcKay, M. D., Beckman, R. J., & Conover, W. J. (1979) · Technometrics · doi:10.2307/1268522 · Cited by 3,757
Cooperation and Competition: Theory and Research
Johnson, D. W., & Johnson, R. T. (1989) · Medical Entomology and Zoology · Cited by 2,998
Schwefel, H. (1995) · Cited by 2,203
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1994) · Springer eBooks · doi:10.1007/978-3-662-07418-3 · Cited by 2,158
Törn, A., & Žilinskas, A. (1989) · Cited by 1,673
On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms
Moscato, P. (1989) · Cited by 1,516
Powell, M. J. D. (1994) · Advances in Optimization and Numerical Analysis · doi:10.1007/978-94-015-8330-5_4 · Cited by 1,369
(1989) · Lecture Notes in Computer Science · doi:10.1007/3-540-50871-6 · Cited by 717
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
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
Intelligent mutation rate control in canonical genetic algorithms
Bäck, T., & Schütz, M. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61286-6_141 · 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 201
Floudas, C. A., & Visweswaran, V. (1995) · Nonconvex optimization and its applications · doi:10.1007/978-1-4615-2025-2_5 · Cited by 193
Hybridizing genetic algorithms with hill-climbing methods for global optimization: two possible ways
Renders, J.-M., & Bersini, H. (2002) · Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence · doi:10.1109/icec.1994.349948 · Cited by 185
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
Airfoil and Wing Design Through Hybrid Optimization Strategies
Vicini, A., & Quagliarella, D. (1999) · AIAA Journal · doi:10.2514/3.14219 · Cited by 143
Decision making in a hybrid genetic algorithm
Lobo, F. G., & Goldberg, D. E. (2002) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/icec.1997.592281 · Cited by 105
Cited by
Differential Evolution: A Survey of the State-of-the-Art
Das, S., & Suganthan, P. N. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2059031 · Cited by 5,307
Recent advances in differential evolution – An updated survey
Das, S., Mullick, S. S., & Suganthan, P. N. (2016) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2016.01.004 · Cited by 1,592
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
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
Multifactorial Evolution: Toward Evolutionary Multitasking
Gupta, A., Ong, Y.-S., & Feng, L. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2458037 · Cited by 993
Self-citation
Metadata
- Authors
- Ong, Y. S., & Keane, A. J.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2004-04
- Volume
- 8
- Issue
- 2
- Pages
- 99-110
- ISSN
- 1089-778X (ISSN-L)
- OpenAlex
- W2154047522
- Cited by
- 657
- References
- 23
- FWCI
- 29.48
- Type
- journal article
- Language
- en
- Open access
- closed
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.