The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
A Clustering Particle Swarm Optimizer for Locating and Tracking Multiple Optima in Dynamic Environments
Open accessAbstract
In the real world, many optimization problems are dynamic. This requires an optimization algorithm to not only find the global optimal solution under a specific environment but also to track the trajectory of the changing optima over dynamic environments. To address this requirement, this paper investigates a clustering particle swarm optimizer (PSO) for dynamic optimization problems. This algorithm employs a hierarchical clustering method to locate and track multiple peaks. A fast local search method is also introduced to search optimal solutions in a promising subregion found by the clustering method. Experimental study is conducted based on the moving peaks benchmark to test the performance of the clustering PSO in comparison with several state-of-the-art algorithms from the literature. The experimental results show the efficiency of the clustering PSO for locating and tracking multiple optima in dynamic environments in comparison with other particle swarm optimization models based on the multiswarm method.
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
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
Particle swarm optimization: An overview
Poli, R., Kennedy, J., & Blackwell, T. (2007) · Swarm Intelligence · doi:10.1007/s11721-007-0002-0 · Cited by 21,101
A new optimizer using particle swarm theory
Eberhart, R., & Kennedy, J. (2002) · MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science · doi:10.1109/mhs.1995.494215 · Cited by 16,067
A modified particle swarm optimizer
Shi, Y., & Eberhart, R. (2002) · 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360) · doi:10.1109/icec.1998.699146 · Cited by 10,229
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
Clerc, M., & Kennedy, J. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.985692 · Cited by 9,017
(2019) · Handbook of Machine Learning · doi:10.1142/9789811205675_0004 · Cited by 6,270
A Cooperative Approach to Particle Swarm Optimization
vandenBergh, F., & Engelbrecht, A. P. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.826069 · Cited by 2,120
An analysis of particle swarm optimizers
van den Bergh, F., & Engelbrecht, A. P. (2002) · UpSpace Institutional Repository (University of Pretoria) · Cited by 1,618
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
The particle swarm: social adaptation of knowledge
Kennedy, J. (2002) · Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97) · doi:10.1109/icec.1997.592326 · Cited by 1,555
Recent approaches to global optimization problems through Particle Swarm Optimization
Parsopoulos, K. E., & Vrahatis, M. N. (2002) · Natural Computing · doi:10.1023/a:1016568309421 · Cited by 1,406
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
Locating and tracking multiple dynamic optima by a particle swarm model using speciation
Parrott, D., & Li, X. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.859468 · Cited by 547
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
Multimodal optimization using crowding-based differential evolution
Thomsen, R. (2005) · Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753) · doi:10.1109/cec.2004.1331058 · Cited by 438
A hierarchical particle swarm optimizer and its adaptive variant
Janson, S., & Middendorf, M. (2005) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2005.850530 · Cited by 373
Stereotyping: improving particle swarm performance with cluster analysis
Kennedy, J. (2002) · Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512) · doi:10.1109/cec.2000.870832 · Cited by 354
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
Self-citationEvolutionary Computation in Dynamic and Uncertain Environments
Yang, S., Ong, Y.-S., & Jin, Y. (2007) · Studies in computational intelligence · doi:10.1007/978-3-540-49774-5 · Cited by 240
Self-citationBenchmark Generator for CEC'2009 Competition on Dynamic Optimization
Li, C., Yang, S., Nguyễn, T. T., Yu, E. L., Yao, X., Jin, Y., Beyer, H.-G., & Suganthan, P. N. (2008) · Brunel University Research Archive (BURA) (Brunel University London) · doi:10.13140/rg.2.1.3445.6401 · Cited by 168
Self-citationMultiobjective optimization for dynamic environments
Bui, L. T., Branke, J., & Abbass, H. A. (2005) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2005.1554987 · Cited by 140
Detecting change in dynamic fitness landscapes
Richter, H. (2009) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2009.4983135 · Cited by 122
Fast Multi-Swarm Optimization for Dynamic Optimization Problems
Li, C., & Yang, S. (2008) · International Conference on Natural Computation (ICNC) · doi:10.1109/icnc.2008.313 · Cited by 121
Self-citationA clustering particle swarm optimizer for dynamic optimization
Li, C., & Yang, S. (2009) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2009.4982979 · Cited by 117
Self-citationAdaptively choosing niching parameters in a PSO
Bird, S., & Li, X. (2006) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1143997.1143999 · Cited by 103
A Hierarchical Particle Swarm Optimizer for Dynamic Optimization Problems
Janson, S., & Middendorf, M. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24653-4_52 · Cited by 99
Solving systems of unconstrained equations using particle swarm optimization
Brits, R., Engelbrecht, A. P., & van den Bergh, F. (2003) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/icsmc.2002.1176019 · Cited by 98
A Generalized Approach to Construct Benchmark Problems for Dynamic Optimization
Li, C., & Yang, S. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-89694-4_40 · Cited by 93
Self-citationTriggered Memory-Based Swarm Optimization in Dynamic Environments
Wang, H., Wang, D., & Yang, S. (2007) · Springer eBooks · doi:10.1007/978-3-540-71805-5_70 · Cited by 58
Self-citationComparison between Galileo CBOC Candidates and BOC(1,1) in Terms of Detection Performance
Roveri, N., Battistella, E., Bianchi, C. L., Foltran, I., Foresti, E., Iafisco, M., Lelli, M., Naldoni, A., Palazzo, B., & Rimondini, L. (2008) · INFM-OAR (INFN Catania) · doi:10.1155/2008/482032 · Cited by 8
Cited by
Shift-Based Density Estimation for Pareto-Based Algorithms in Many-Objective Optimization
Li, M., Yang, S., & Liu, X. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2262178 · Cited by 714
Self-citationEvolutionary 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
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
Transfer 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
Metadata
- Authors
- Yang, S., & Li, C.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2010-12
- Volume
- 14
- Issue
- 6
- Pages
- 959-974
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2143503407
- Cited by
- 344
- References
- 31
- FWCI
- 25.51
- 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.