The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Population-Based Incremental Learning With Associative Memory for Dynamic Environments
Open accessAbstract
In recent years, interest in studying evolutionary algorithms (EAs) for dynamic optimization problems (DOPs) has grown due to its importance in real-world applications. Several approaches, such as the memory and multiple population schemes, have been developed for EAs to address dynamic problems. This paper investigates the application of the memory scheme for population-based incremental learning (PBIL) algorithms, a class of EAs, for DOPs. A PBIL-specific associative memory scheme, which stores best solutions as well as corresponding environmental information in the memory, is investigated to improve its adaptability in dynamic environments. In this paper, the interactions between the memory scheme and random immigrants, multipopulation, and restart schemes for PBILs in dynamic environments are investigated. In order to better test the performance of memory schemes for PBILs and other EAs in dynamic environments, this paper also proposes a dynamic environment generator that can systematically generate dynamic environments of different difficulty with respect to memory schemes. Using this generator, a series of dynamic environments are generated and experiments are carried out to compare the performance of investigated algorithms. The experimental results show that the proposed memory scheme is efficient for PBILs in dynamic environments and also indicate that different interactions exist between the memory scheme and random immigrants, multipopulation schemes for PBILs in different dynamic environments.
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
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
Larraanaga, P., & Lozano, J. A. (2001) · Kluwer Academic Publishers eBooks · Cited by 1,914
Baluja, S. (1994) · Cited by 1,290
Estimation of Distribution Algorithms
(2002) · Genetic Algorithms and Evolutionary Computation · doi:10.1007/978-1-4615-1539-5 · Cited by 1,273
From recombination of genes to the estimation of distributions I. Binary parameters
Mühlenbein, H., & Paaß, G. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61723-x_982 · Cited by 1,207
The Design of Innovation: Lessons from and for Competent Genetic Algorithms
Goldberg, D. E. (2002) · Cited by 901
Evolutionary Optimization in Dynamic Environments
Branke, J. (2002) · Genetic Algorithms and Evolutionary Computation · doi:10.1007/978-1-4615-0911-0 · Cited by 829
Memory enhanced evolutionary algorithms for changing optimization problems
Branke, J. (2003) · Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406) · doi:10.1109/cec.1999.785502 · Cited by 743
Removing the Genetics from the Standard Genetic Algorithm
Baluja, S., & Caruana, R. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50014-1 · Cited by 573
Nonstationary function optimization using genetic algorithm with dominance and diploidy
Goldberg, D. E., & Smith, R. E. (1987) · international conference on Genetic algorithms · Cited by 298
Designing Evolutionary Algorithms for Dynamic Environments
Morrison, R. W. (2004) · Natural computing series · doi:10.1007/978-3-662-06560-0 · Cited by 247
Case-Based Initialization of Genetic Algorithms
Ramsey, C. L., & Grefenstette, J. J. (1993) · Cited by 176
Evolvability in dynamic fitness landscapes: a genetic algorithm approach
Grefenstette, J. J. (2003) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.1999.785524 · Cited by 132
A self-organizing random immigrants genetic algorithm for dynamic optimization problems
Tinós, R., & Yang, S. (2007) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-007-9024-z · Cited by 125
Self-citationAn Empirical Comparison of Seven Iterative and Evolutionary Function Optimization Heuristics
Baluja, S. (1995) · NASA Technical Reports Server (NASA) · Cited by 119
Applications notes - Robust route optimization for gritting/salting trucks: A CERCIA experience
Handa, H., Chapman, L., & Yao, X. (2006) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2006.1597056 · Cited by 85
Self-citation
Cited by
Evolutionary dynamic optimization: A survey of the state of the art
Nguyen, T. T., Yang, S., & Branke, J. (2012) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2012.05.001 · Cited by 656
Self-citationA 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
Insights on Transfer Optimization: Because Experience is the Best Teacher
Gupta, A., Ong, Y.-S., & Feng, L. (2018) · IEEE Transactions on Emerging Topics in Computational Intelligence · doi:10.1109/tetci.2017.2769104 · Cited by 378
Yang, S., & Li, C. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2046667 · Cited by 344
Self-citationTang, L., Zhao, Y., & Liu, J. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2250977 · Cited by 287
Metadata
- Authors
- Yang, S., & Yao, X.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2008-10
- Volume
- 12
- Issue
- 5
- Pages
- 542-561
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2147585405
- Cited by
- 259
- References
- 15
- FWCI
- 36.04
- 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.