The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Niching Without Niching Parameters: Particle Swarm Optimization Using a Ring Topology
Open accessAbstract
Niching is an important technique for multimodal optimization. Most existing niching methods require specification of certain niching parameters in order to perform well. These niching parameters, often used to inform a niching algorithm how far apart between two closest optima or the number of optima in the search space, are typically difficult to set as they are problem dependent. This paper describes a simple yet effective niching algorithm, a particle swarm optimization (PSO) algorithm using a ring neighborhood topology, which does not require any niching parameters. A PSO algorithm using the ring topology can operate as a niching algorithm by using individual particles'local memoriesto form a stable network retaining the best positions found so far, while these particles explore the search space more broadly. Given a reasonably large population uniformly distributed in the search space, PSO algorithms using the ring topology are able to form stable niches across different local neighborhoods, eventually locating multiple global/local optima. The complexity of these niching algorithms is onlyO(N), whereNis the population size. Experimental results suggest that PSO algorithms using the ring topology are able to provide superior and more consistent performance over some existing PSO niching algorithms that require niching parameters.
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
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
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
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1992) · Artificial Intelligence · doi:10.1007/978-3-662-02830-8 · Cited by 11,553
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
A niched Pareto genetic algorithm for multiobjective optimization
Horn, J., Nafpliotis, N., & Goldberg, D. E. (2002) · Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence · doi:10.1109/icec.1994.350037 · Cited by 2,433
Genetic algorithms with sharing for multimodal function optimization
Goldberg, D. E., & Richardson, J. T. (1987) · international conference on Genetic algorithms · Cited by 1,912
Fundamentals of Computational Swarm Intelligence
Engelbrecht, A. P. (2005) · Medical Entomology and Zoology · Cited by 1,871
Törn, A., & Žilinskas, A. (1989) · Cited by 1,673
Clerc, M. (2006) · Wiley eBooks · doi:10.1002/9780470612163 · Cited by 1,622
Population structure and particle swarm performance
Kennedy, J., & Mendes, R. (2003) · Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) · doi:10.1109/cec.2002.1004493 · Cited by 1,586
Niching methods for genetic algorithms
Mahfoud, S. W. (1996) · Cited by 897
An Investigation of Niche and Species Formation in Genetic Function Optimization
Deb, K., & Goldberg, D. E. (1989) · international conference on Genetic algorithms · Cited by 828
On the Computation of All Global Minimizers Through Particle Swarm Optimization
Parsopoulos, K. E., & Vrahatis, M. N. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.826076 · Cited by 681
A clearing procedure as a niching method for genetic algorithms
Petrowski, A. (1996) · Proceedings of IEEE International Conference on Evolutionary Computation ICEC-96 · doi:10.1109/icec.1996.542703 · Cited by 630
Fitness sharing and niching methods revisited
Sareni, B., & Krahenbuhl, L. (1998) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.735432 · Cited by 578
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
Self-citationA Sequential Niche Technique for Multimodal Function Optimization
Beasley, D., Bull, D., & Martin, R. R. (1993) · Evolutionary Computation · doi:10.1162/evco.1993.1.2.101 · Cited by 508
A Species Conserving Genetic Algorithm for Multimodal Function Optimization
Li, J., Balazs, M. E., Parks, G. T., & Clarkson, P. J. (2002) · Evolutionary Computation · doi:10.1162/106365602760234081 · Cited by 470
Finding Multimodal Solutions Using Restricted Tournament Selection
Harik, G. R. (1995) · Cited by 444
Erratum: A Species Conserving Genetic Algorithm for Multimodal Function Optimization
Li, J.-P., Balazs, M. E., Parks, G. T., & Clarkson, P. J. (2003) · Evolutionary Computation · doi:10.1162/106365603321829023 · Cited by 393
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
Yin, X., & Germay, N. (1993) · Artificial Neural Nets and Genetic Algorithms · doi:10.1007/978-3-7091-7533-0_65 · Cited by 238
Locating multiple optima using particle swarm optimization
Brits, R., Engelbrecht, A. P., & van den Bergh, F. (2007) · Applied Mathematics and Computation · doi:10.1016/j.amc.2006.12.066 · Cited by 229
Comparison of multi-modal optimization algorithms based on evolutionary algorithms
Singh, G., & Deb, K. (2006) · Proceedings of the 8th annual conference on Genetic and evolutionary computation · doi:10.1145/1143997.1144200 · Cited by 175
An empirical study of bit vector function optimization
Ackley, D. H. (1987) · Medical Entomology and Zoology · Cited by 162
Adaptively 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
Self-citationSolving 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
Island Model Cooperating with Speciation for Multimodal Optimization
Bessaou, M., Pétrowski, A., & Siarry, P. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45356-3_43 · Cited by 84
Niche Radius Adaptation in the CMA-ES Niching Algorithm
Shir, O. M., & Bäck, T. (2006) · Lecture notes in computer science · doi:10.1007/11844297_15 · Cited by 62
A dilemma for fitness sharing with a scaling function
Darwen, P. J., & Yao, X. (2002) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/icec.1995.489138 · Cited by 40
Niching ability of basic particle swarm optimization algorithms
Engelbrecht, A. P., Masiye, B. S., & Pamparà, G. (2005) · IEEE Swarm Intelligence Symposium · doi:10.1109/sis.2005.1501650 · Cited by 33
Cited by
Particle swarm optimization algorithm: An overview
Wang, D., Tan, D., & Liu, L. (2018) · Soft Computing · doi:10.1007/s00500-016-2474-6 · Cited by 3,343
A Competitive Swarm Optimizer for Large Scale Optimization
Cheng, R., & Jin, Y. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2322602 · Cited by 1,052
Bio-inspired computation: Where we stand and what's next
Del Ser, J., Osaba, E., Molina, D., Yang, X.-S., Salcedo-Sanz, S., Camacho, D., Das, S., Suganthan, P. N., Coello Coello, C. A., & Herrera, F. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2019.04.008 · Cited by 593
Yue, C., Qu, B., & Liang, J. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2754271 · Cited by 585
Sengupta, S., Basak, S., & Peters, R. (2018) · Machine Learning and Knowledge Extraction · doi:10.3390/make1010010 · Cited by 543
Metadata
- Authors
- Li, X.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2010-02
- Volume
- 14
- Issue
- 1
- Pages
- 150-169
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2152100799
- Cited by
- 466
- References
- 31
- FWCI
- 20.24
- 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.