The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
The swarm and the queen: towards a deterministic and adaptive particle swarm optimization
Abstract
A very simple particle swarm optimization iterative algorithm is presented, with just one equation and one social/confidence parameter. We define a "no-hope" convergence criterion and a "rehope" method so that, from time to time, the swarm re-initializes its position, according to some gradient estimations of the objective function and to the previous re-initialization (it means it has a kind of very rudimentary memory). We then study two different cases, a quite "easy" one (the Alpine function) and a "difficult" one (the Banana function), but both just in dimension two. The process is improved by taking into account the swarm gravity center (the "queen") and the results are good enough so that it is certainly worthwhile trying the method on more complex problems.
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
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
Self-citationA discrete binary version of the particle swarm algorithm
Kennedy, J., & Eberhart, R. C. (2002) · 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation · doi:10.1109/icsmc.1997.637339 · Cited by 4,767
Parameter selection in particle swarm optimization
Shi, Y., & Eberhart, R. C. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0040810 · Cited by 3,538
Using selection to improve particle swarm optimization
Angeline, P. J. (2002) · 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360) · doi:10.1109/icec.1998.699327 · Cited by 864
Kennedy, J., & Spears, W. M. (2002) · 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360) · doi:10.1109/icec.1998.699326 · Cited by 387
Cited by
Particle swarm optimization: developments, applications and resources
Eberhart, & Shi, Y. (2001) · Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546) · doi:10.1109/cec.2001.934374 · Cited by 4,310
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
Self-Organizing Hierarchical Particle Swarm Optimizer With Time-Varying Acceleration Coefficients
Ratnaweera, A., Halgamuge, S. K., & Watson, H. C. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.826071 · Cited by 3,034
Comparing inertia weights and constriction factors in particle swarm optimization
Eberhart, R. C., & Shi, Y. (2002) · Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512) · doi:10.1109/cec.2000.870279 · Cited by 2,966
The particle swarm optimization algorithm: convergence analysis and parameter selection
Trelea, I. C. (2003) · Information Processing Letters · doi:10.1016/s0020-0190(02)00447-7 · Cited by 2,644
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
Adaptive Particle Swarm Optimization
Zhan, Z.-H., Zhang, J., Li, Y., & Chung, H. S.-H. (2009) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2009.2015956 · Cited by 2,075
Clerc, M. (2006) · Wiley eBooks · doi:10.1002/9780470612163 · Cited by 1,622
Self-citationA study of particle swarm optimization particle trajectories
VANDENBERGH, F., & ENGELBRECHT, A. (2006) · Information Sciences · doi:10.1016/j.ins.2005.02.003 · Cited by 1,397
A literature survey of benchmark functions for global optimisation problems
Jamil, M., & Yang, X. S. (2013) · International Journal of Mathematical Modelling and Numerical Optimisation · doi:10.1504/ijmmno.2013.055204 · Cited by 1,301
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
“The basic PSO has shown to perform robustly well on various relatively low-dimensional optimization problems [6], however often poorly on high-dimensional problems [7]– [9], which is usually caused by premature convergence.”
BackgroundTracking and optimizing dynamic systems with particle swarms
Eberhart, R. C., & Shi, Y. (2002) · Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546) · doi:10.1109/cec.2001.934376 · Cited by 1,013
Particle Swarm Optimization for Single Objective Continuous Space Problems: A Review
Bonyadi, M. R., & Michalewicz, Z. (2017) · Evolutionary Computation · doi:10.1162/evco_r_00180 · Cited by 841
Venter, G., & Sobieszczanski-Sobieski, J. (2003) · AIAA Journal · doi:10.2514/2.2111 · Cited by 802
Orthogonal Learning Particle Swarm Optimization
Zhan, Z.-H., Zhang, J., Li, Y., & Shi, Y.-H. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2052054 · Cited by 725
Analysis of Particle Swarm Optimization Algorithm
Bai, Q. (2010) · Computer and Information Science · doi:10.5539/cis.v3n1p180 · Cited by 724
An Overview of Variants and Advancements of PSO Algorithm
Jain, M., Saihjpal, V., Singh, N., & Singh, S. B. (2022) · Applied Sciences · doi:10.3390/app12178392 · Cited by 717
Kennedy, J. (2004) · Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706) · doi:10.1109/sis.2003.1202251 · Cited by 690
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
Sengupta, S., Basak, S., & Peters, R. (2018) · Machine Learning and Knowledge Extraction · doi:10.3390/make1010010 · Cited by 543
Simplifying Particle Swarm Optimization
Pedersen, M. E. H., & Chipperfield, A. J. (2010) · Applied Soft Computing · doi:10.1016/j.asoc.2009.08.029 · Cited by 495
The particle swarm optimization algorithm in size and shape optimization
Fourie, P. C., & Groenwold, A. A. (2002) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-002-0188-0 · Cited by 494
Major Advances in Particle Swarm Optimization: Theory, Analysis, and Application
Houssein, E. H., Gad, A. G., Hussain, K., & Suganthan, P. N. (2021) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2021.100868 · Cited by 466
RetractedRecent advances in particle swarm
Hu, X., Shi, Y., & Eberhart, R. (2004) · Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753) · doi:10.1109/cec.2004.1330842 · Cited by 466
Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem
Clerc, M. (2004) · Studies in Fuzziness and Soft Computing · doi:10.1007/978-3-540-39930-8_8 · Cited by 462
Self-citationKennedy, J. (2006) · Handbook of Nature-Inspired and Innovative Computing · doi:10.1007/0-387-27705-6_6 · Cited by 432
Surrogate-Assisted Cooperative Swarm Optimization of High-Dimensional Expensive Problems
Sun, C., Jin, Y., Cheng, R., Ding, J., & Zeng, J. (2017) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2675628 · Cited by 425
Sun, J., Fang, W., Wu, X., Palade, V., & Xu, W. (2012) · Evolutionary Computation · doi:10.1162/evco_a_00049 · Cited by 396
A Study of Global Optimization Using Particle Swarms
Schutte, J. F., & Groenwold, A. A. (2005) · Journal of Global Optimization · doi:10.1007/s10898-003-6454-x · Cited by 367
A review of particle swarm optimization and its applications in Solar Photovoltaic system
Khare, A., & Rangnekar, S. (2013) · Applied Soft Computing · doi:10.1016/j.asoc.2012.11.033 · Cited by 366
A new locally convergent particle swarm optimiser
van den Bergh, F., & Engelbrecht, A. P. (2003) · IEEE International Conference on Systems, Man and Cybernetics · doi:10.1109/icsmc.2002.1176018 · Cited by 320
Surrogate-assisted hierarchical particle swarm optimization
Yu, H., Tan, Y., Zeng, J., Sun, C., & Jin, Y. (2018) · Information Sciences · doi:10.1016/j.ins.2018.04.062 · Cited by 313
Particle Swarm Optimisation: A Historical Review Up to the Current Developments
Freitas, D., Lopes, L. G., & Morgado-Dias, F. (2020) · Entropy · doi:10.3390/e22030362 · Cited by 310
PSO-based algorithm for home care worker scheduling in the UK
Akjiratikarl, C., Yenradee, P., & Drake, P. R. (2007) · Computers & Industrial Engineering · doi:10.1016/j.cie.2007.06.002 · Cited by 296
(2009) · InTech eBooks · doi:10.5772/109 · Cited by 295
Multipurpose Reservoir Operation Using Particle Swarm Optimization
Nagesh Kumar, D., & Janga Reddy, M. (2007) · Journal of Water Resources Planning and Management · doi:10.1061/(asce)0733-9496(2007)133:3(192 · Cited by 290
Particle swarm optimization: Hybridization perspectives and experimental illustrations
Thangaraj, R., Pant, M., Abraham, A., & Bouvry, P. (2011) · Applied Mathematics and Computation · doi:10.1016/j.amc.2010.12.053 · Cited by 264
Evolutionary artificial neural networks by multi-dimensional particle swarm optimization
Kiranyaz, S., Ince, T., Yildirim, A., & Gabbouj, M. (2009) · Neural Networks · doi:10.1016/j.neunet.2009.05.013 · Cited by 257
Position control of nonlinear hydraulic system using an improved PSO based PID controller
Ye, Y., Yin, C.-B., Gong, Y., & Zhou, J.-J. (2017) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2016.06.010 · Cited by 199
Evolutionary Algorithms for Wireless Communications — A Review of the State-of-the art
Goudos, S. K. (2014) · Contemporary Issues in Wireless Communications · doi:10.5772/59147 · Cited by 13
Metadata
- Authors
- Clerc, M.
- Venue
- Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406)
- Publisher
- IEEE
- Published
- 2003-01-20
- Pages
- 1951-1957
- OpenAlex
- W1907706552
- Cited by
- 1,692
- References
- 8
- FWCI
- 42.72
- 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.