The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
A Distance-Based Locally Informed Particle Swarm Model for Multimodal Optimization
Abstract
Multimodal optimization amounts to finding multiple global and local optima (as opposed to a single solution) of a function, so that the user can have a better knowledge about different optimal solutions in the search space and when needed, the current solution may be switched to a more suitable one while still maintaining the optimal system performance. Niching particle swarm optimizers (PSOs) have been widely used by the evolutionary computation community for solving real-parameter multimodal optimization problems. However, most of the existing PSO-based niching algorithms are difficult to use in practice because of their poor local search ability and requirement of prior knowledge to specify certain niching parameters. This paper has addressed these issues by proposing a distance-based locally informed particle swarm (LIPS) optimizer, which eliminates the need to specify any niching parameter and enhance the fine search ability of PSO. Instead of using the global best particle, LIPS uses several local bests to guide the search of each particle. LIPS can operate as a stable niching algorithm by using the information provided by its neighborhoods. The neighborhoods are estimated in terms of Euclidean distance. The algorithm is compared with a number of state-of-the-art evolutionary multimodal optimizers on 30 commonly used multimodal benchmark functions. The experimental results suggest that the proposed technique is able to provide statistically superior and more consistent performance over the existing niching algorithms on the test functions, without incurring any severe computational burdens.
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
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
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
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
Self-citationIntroduction to Evolutionary Computing
Eiben, A. E., & Smith, J. E. (2003) · Natural Computing Series · doi:10.1007/978-3-662-05094-1 · Cited by 4,176
Comprehensive learning particle swarm optimizer for global optimization of multimodal functions
Liang, J. J., Qin, A. K., Suganthan, P. N., & Baskar, S. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.857610 · Cited by 3,743
Self-citationParameter selection in particle swarm optimization
Shi, Y., & Eberhart, R. C. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0040810 · Cited by 3,538
Handbook of Evolutionary Computation
(1997) · Institute of Physics eBooks · doi:10.1887/0750308958 · Cited by 2,990
Evolution strategies – A comprehensive introduction
Beyer, H.-G., & Schwefel, H.-P. (2002) · Natural Computing · doi:10.1023/a:1015059928466 · Cited by 2,790
Genetic algorithms with sharing for multimodal function optimization
Goldberg, D. E., & Richardson, J. T. (1987) · international conference on Genetic algorithms · Cited by 1,912
The Fully Informed Particle Swarm: Simpler, Maybe Better
Mendes, R., Kennedy, J., & Neves, J. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.826074 · Cited by 1,745
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
Niching methods for genetic algorithms
Mahfoud, S. W. (1996) · Cited by 897
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
A 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
Niching Without Niching Parameters: Particle Swarm Optimization Using a Ring Topology
Li, X. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2026270 · Cited by 466
Finding Multimodal Solutions Using Restricted Tournament Selection
Harik, G. R. (1995) · Cited by 444
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
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
Krohling, R. A., & dos Santos Coelho, L. (2006) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2006.873185 · Cited by 326
Efficient differential evolution using speciation for multimodal function optimization
Li, X. (2005) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1068009.1068156 · Cited by 237
Li, X. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2050024 · Cited by 185
Particle Swarm Optimization With Composite Particles in Dynamic Environments
Liu, L., Yang, S., & Wang, D. (2010) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2010.2043527 · Cited by 159
Multimodal Optimization by Means of a Topological Species Conservation Algorithm
Stoean, C., Preuß, M., Stoean, R., & Dumitrescu, D. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2041668 · Cited by 135
Cultural-Based Multiobjective Particle Swarm Optimization
Daneshyari, M., & Yen, G. G. (2010) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2010.2068046 · Cited by 107
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
Adaptive Niche Radii and Niche Shapes Approaches for Niching with the CMA-ES
Shir, O. M., Emmerich, M., & Bäck, T. (2010) · Evolutionary Computation · doi:10.1162/evco.2010.18.1.18104 · Cited by 94
Population Diversity of Particle Swarms
Shi, Y., & Eberhart, R. C. (2008) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2008.4630928 · Cited by 94
Qu, B., & Suganthan, P. N. (2010) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2010.5586341 · Cited by 93
Self-citationMonitoring of particle swarm optimization
Shi, Y., & Eberhart, R. (2009) · Frontiers of Computer Science in China · doi:10.1007/s11704-009-0008-4 · Cited by 76
Cited by
Recent advances in differential evolution – An updated survey
Das, S., Mullick, S. S., & Suganthan, P. N. (2016) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2016.01.004 · Cited by 1,592
Self-citationParticle Swarm Optimization: A Comprehensive Survey
Shami, T. M., El-Saleh, A. A., Alswaitti, M., Al-Tashi, Q., Summakieh, M. A., & Mirjalili, S. (2022) · IEEE Access · doi:10.1109/access.2022.3142859 · Cited by 1,584
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
A social learning particle swarm optimization algorithm for scalable optimization
Cheng, R., & Jin, Y. (2015) · Information Sciences · doi:10.1016/j.ins.2014.08.039 · Cited by 747
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
Self-citation
Metadata
- Authors
- Qu, B. Y., Suganthan, P. N., & Das, S.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2013-06
- Volume
- 17
- Issue
- 3
- Pages
- 387-402
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2054878539
- Cited by
- 421
- References
- 32
- FWCI
- 21.53
- Type
- journal article
- 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.