The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
Orthogonal Learning Particle Swarm Optimization
Abstract
Particle swarm optimization (PSO) relies on its learning strategy to guide its search direction. Traditionally, each particle utilizes its historical best experience and its neighborhood's best experience through linear summation. Such a learning strategy is easy to use, but is inefficient when searching in complex problem spaces. Hence, designing learning strategies that can utilize previous search information (experience) more efficiently has become one of the most salient and active PSO research topics. In this paper, we proposes an orthogonal learning (OL) strategy for PSO to discover more useful information that lies in the above two experiences via orthogonal experimental design. We name this PSO as orthogonal learning particle swarm optimization (OLPSO). The OL strategy can guide particles to fly in better directions by constructing a much promising and efficient exemplar. The OL strategy can be applied to PSO with any topological structure. In this paper, it is applied to both global and local versions of PSO, yielding the OLPSO-G and OLPSO-L algorithms, respectively. This new learning strategy and the new algorithms are tested on a set of 16 benchmark functions, and are compared with other PSO algorithms and some state of the art evolutionary algorithms. The experimental results illustrate the effectiveness and efficiency of the proposed learning strategy and algorithms. The comparisons show that OLPSO significantly improves the performance of PSO, offering faster global convergence, higher solution quality, and stronger robustness.
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
Self-citationThe 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
Handling multiple objectives with particle swarm optimization
Coello, C. A. C., Pulido, G. T., & Lechuga, M. S. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.826067 · Cited by 4,455
Completely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397
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
Self-citationEvolutionary programming made faster
Yao, X., Liu, Y., & Lin, G. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.771163 · Cited by 3,910
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
JADE: Adaptive Differential Evolution With Optional External Archive
Zhang, J., & Sanderson, A. C. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2014613 · Cited by 3,739
Self-citationSelf-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
Self-citationDesign and Analysis of Experiments
Grice, J. V., & Montgomery, D. C. (2000) · Technometrics · doi:10.2307/1271458 · Cited by 2,654
(2005) · Cited by 2,565
Evolutionary Computation: Towards a New Philosophy of Machine Intelligence
Fogel, D. B. (1995) · IEEE Press eBooks · Cited by 2,283
Particle Swarm Optimization: Basic Concepts, Variants and Applications in Power Systems
del Valle, Y., Venayagamoorthy, G. K., Mohagheghi, S., Hernandez, J.-C., & Harley, R. G. (2008) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.896686 · Cited by 2,277
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
Self-citationThe 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 swarm and the queen: towards a deterministic and adaptive particle swarm optimization
Clerc, M. (2003) · Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406) · doi:10.1109/cec.1999.785513 · Cited by 1,692
Comparison between genetic algorithms and particle swarm optimization
Eberhart, R. C., & Shi, Y. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0040812 · Cited by 1,610
Self-citationPopulation 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
Evolutionary computation: Toward a new philosophy of machine intelligence
B�ck, T. (1997) · Complexity · doi:10.1002/(sici)1099-0526(199703/04)2:4<28::aid-cplx7>3.0.co;2-2 · Cited by 1,533
Design and Analysis of Experiments, 5th Ed.
Copeland, K. A. F. (2001) · Journal of Quality Technology · doi:10.1080/00224065.2001.11980088 · Cited by 1,475
Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance
Kennedy, J. (2003) · Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406) · doi:10.1109/cec.1999.785509 · Cited by 1,061
A Hybrid of Genetic Algorithm and Particle Swarm Optimization for Recurrent Network Design
Juang, C.-F. (2004) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2003.818557 · Cited by 964
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
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 Computationally Efficient Evolutionary Algorithm for Real-Parameter Optimization
Deb, K., Anand, A., & Joshi, D. (2002) · Evolutionary Computation · doi:10.1162/106365602760972767 · Cited by 614
Multiobjective optimization using dynamic neighborhood particle swarm optimization
Hu, X., & Eberhart, R. (2003) · Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) · doi:10.1109/cec.2002.1004494 · Cited by 613
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
Particle swarm optimiser with neighbourhood operator
Suganthan, P. N. (2003) · Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406) · doi:10.1109/cec.1999.785514 · Cited by 514
Dynamic multi-swarm particle swarm optimizer
Liang, J. J., & Suganthan, P. N. (2005) · Proceedings 2005 IEEE Swarm Intelligence Symposium, 2005. SIS 2005. · doi:10.1109/sis.2005.1501611 · Cited by 486
Fitness-distance-ratio based particle swarm optimization
Peram, T., Veeramachaneni, K., & Mohan, C. K. (2004) · Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706) · doi:10.1109/sis.2003.1202264 · Cited by 474
Recent 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
Self-citationAn Approach to Multimodal Biomedical Image Registration Utilizing Particle Swarm Optimization
Wachowiak, M. P., Smolikova, R., Zheng, Y., Zurada, J. M., & Elmaghraby, A. S. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.826068 · Cited by 389
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
Neighborhood topologies in fully informed and best-of-neighborhood particle swarms
Kennedy, J., & Mendes, R. (2006) · IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2006.875410 · Cited by 344
A Note on the Extended Rosenbrock Function
Shang, Y.-W., & Qiu, Y.-H. (2006) · Evolutionary Computation · doi:10.1162/106365606776022733 · Cited by 321
Performance Evaluation of an Advanced Local Search Evolutionary Algorithm
Auger, A., & Hansen, N. (2005) · 2005 IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2005.1554903 · Cited by 284
An orthogonal genetic algorithm for multimedia multicast routing
Zhang, Q., & Leung, Y.-W. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.752920 · Cited by 269
Intelligent Evolutionary Algorithms for Large Parameter Optimization Problems
Ho, S.-Y., Shu, L.-S., & Chen, J.-H. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.835176 · Cited by 252
OPSO: Orthogonal Particle Swarm Optimization and Its Application to Task Assignment Problems
Ho, S.-Y., Lin, H.-S., Liauh, W.-H., & Ho, S.-J. (2008) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2007.914796 · Cited by 251
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
An Investigation into Mutation Operators for Particle Swarm Optimization
Andrews, P. S. (2006) · 2006 IEEE International Conference on Evolutionary Computation · doi:10.1109/cec.2006.1688424 · Cited by 179
Particle Swarm Optimization Approaches to Coevolve Strategies for the Iterated Prisoner's Dilemma
Franken, N., & Engelbrecht, A. P. (2005) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.856202 · Cited by 120
Orthogonal Methods Based Ant Colony Search for Solving Continuous Optimization Problems
Hu, X.-M., Zhang, J., & Li, Y. (2008) · Journal of Computer Science and Technology · doi:10.1007/s11390-008-9111-5 · Cited by 116
Self-citationAn Enhanced Genetic Algorithm with Orthogonal Design
Hu, X.-M., Zhang, J., & Zhong, J. (2006) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2006.1688711 · Cited by 20
Self-citationLiu, J.-L., & Chang, C.-C. (2008) · Journal of Artificial Evolution and Applications · doi:10.1155/2008/827401 · Cited by 6
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
Particle 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
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
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
Metadata
- Authors
- Zhan, Z.-H., Zhang, J., Li, Y., & Shi, Y.-H.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2011-12
- Volume
- 15
- Issue
- 6
- Pages
- 832-847
- ISSN
- 1089-778X (ISSN-L)
- OpenAlex
- W1998391576
- Cited by
- 725
- References
- 49
- FWCI
- 28.91
- 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.