The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Memory enhanced evolutionary algorithms for changing optimization problems
Abstract
Recently, there has been increased interest in evolutionary computation applied to changing optimization problems. The paper surveys a number of approaches that extend the evolutionary algorithm with implicit or explicit memory, suggests a new benchmark problem and examines under which circumstances a memory may be helpful. From these observations, we derive a new way to explore the benefits of a memory while minimizing its negative side effects.
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
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
Case-Based Initialization of Genetic Algorithms
Ramsey, C. L., & Grefenstette, J. J. (1993) · Cited by 176
Adding memory to the Evolutionary Planner/Navigator
Trojanowski, K., Michalewicz, Z., & Xiao, J. (2002) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/icec.1997.592359 · Cited by 27
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
A comprehensive review of firefly algorithms
Fister, I., Fister, I., Yang, X.-S., & Brest, J. (2013) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2013.06.001 · Cited by 1,308
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 survey of swarm intelligence for dynamic optimization: Algorithms and applications
Mavrovouniotis, M., Li, C., & Yang, S. (2017) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2016.12.005 · Cited by 585
Multiswarms, exclusion, and anti-convergence in dynamic environments
Blackwell, T., & Branke, J. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.857074 · Cited by 536
Self-citation
Metadata
- Authors
- Branke, J.
- Venue
- Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406)
- Publisher
- IEEE
- Published
- 2003-01-20
- Pages
- 1875-1882
- OpenAlex
- W2148458253
- Cited by
- 743
- References
- 3
- FWCI
- 16.20
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Memory enhanced evolutionary algorithms for changing optimization problems. https://app.cochat.ai/papers/10.1109/cec.1999.785502
- The paper
- Branke, J. (2003). Memory enhanced evolutionary algorithms for changing optimization problems. Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406). https://doi.org/10.1109/cec.1999.785502
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.