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.
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
Nonstationary function optimization using genetic algorithm with dominance and diploidy
Goldberg, D. E., & Smith, R. E. (1987) · international conference on Genetic algorithms · Cited by 366
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
Evolutionary Optimization in Uncertain Environments—A Survey
Jin, Y., & Branke, J. (2005) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.846356 · Cited by 1,572
Self-citationA 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
A novel particle swarm optimization algorithm with adaptive inertia weight
Nickabadi, A., Ebadzadeh, M. M., & Safabakhsh, R. (2011) · Applied Soft Computing · doi:10.1016/j.asoc.2011.01.037 · Cited by 806
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-citationTransfer Learning-Based Dynamic Multiobjective Optimization Algorithms
Jiang, M., Huang, Z., Qiu, L., Huang, W., & Yen, G. G. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2771451 · Cited by 419
A Steady-State and Generational Evolutionary Algorithm for Dynamic Multiobjective Optimization
Jiang, S., & Yang, S. (2017) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2574621 · Cited by 364
Yang, S., & Li, C. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2046667 · Cited by 344
Evolutionary Dynamic Multiobjective Optimization Via Kalman Filter Prediction
Muruganantham, A., Tan, K. C., & Vadakkepat, P. (2016) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2015.2490738 · Cited by 314
Tang, L., Zhao, Y., & Liu, J. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2250977 · Cited by 287
Population-Based Incremental Learning With Associative Memory for Dynamic Environments
Yang, S., & Yao, X. (2008) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.913070 · Cited by 259
Multi-strategy ensemble particle swarm optimization for dynamic optimization
Du, W., & Li, B. (2008) · Information Sciences · doi:10.1016/j.ins.2008.01.020 · Cited by 253
An incremental genetic algorithm approach to multiprocessor scheduling
Wu, A. S., Yu, H., Jin, S., Lin, K.-C., & Schiavone, G. (2004) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2004.38 · Cited by 252
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
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.