A Competitive Swarm Optimizer for Large Scale Optimization
The DOI matches its Crossref record; 72 of the 73 references it cites were found in a registry or an index.
Abstract
In this paper, a novel competitive swarm optimizer (CSO) for large scale optimization is proposed. The algorithm is fundamentally inspired by the particle swarm optimization but is conceptually very different. In the proposed CSO, neither the personal best position of each particle nor the global best position (or neighborhood best positions) is involved in updating the particles. Instead, a pairwise competition mechanism is introduced, where the particle that loses the competition will update its position by learning from the winner. To understand the search behavior of the proposed CSO, a theoretical proof of convergence is provided, together with empirical analysis of its exploration and exploitation abilities showing that the proposed CSO achieves a good balance between exploration and exploitation. Despite its algorithmic simplicity, our empirical results demonstrate that the proposed CSO exhibits a better overall performance than five state-of-the-art metaheuristic algorithms on a set of widely used large scale optimization problems and is able to effectively solve problems of dimensionality up to 5000.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Compared with three existing algorithms (i.e., EPSDE, CSO, and SLPSO), ACODE can achieve the best performances in terms of response time, ground resolution, and fuel consumption, respectively.”
From Orbital Maneuver Optimization of Earth Observation Satellites Using an Adaptive Differential Evolution Algorithm (2022) · cites this paper as [34]
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
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569 · cited 1×
“the update ofXl(t), which is an inevitable operation in most swarm or population based evolutionary algorithms [2], [46 ]– [48].”
BackgroundMulti-Objective Optimization Using Evolutionary Algorithms
Deb, K., & Kalyanmoy, D. (2001) · Andalas University Repository (Andalas University) · Cited by 17,328
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 · cited 1×
“wheret is the iteration (generation) number, Vi(t) andXi(t) represent the velocity and position of the i-th particle, respectively;ω is termed inertia weight [3], c1 and c2 are the acceleration coefficients [4], R1(t) andR2(t) are two vectors”
BackgroundA 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 · cited 1×
“2322602 where t is the iteration (generation) number, Vi(t) and Xi(t) represent the velocity and position of the i-th particle, respectively; ω is termed inertia weight [3], c1 and c2 are the acceleration coefficients [4], R1(t) and R2(t) are two vectors randomly generated within [0, 1]n; pbesti(t) and gbest(t) are th…”
BackgroundThe 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 Comparative Study on Feature Selection in Text Categorization
Yang, Y., & Pedersen, J. (1997) · Cited by 4,790
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 · cited 1×
“Due to its conceptual simplicity and high search efficiency, PSO has attracted much research interest over the past decades and has been successfully applied to a number of applications, such as water distribution network design [6], parameter optimization in suspension system [7], resource allocation [8], task assign…”
BackgroundEmpirical study of particle swarm optimization
Shi, Y., & Eberhart, R. C. (2003) · Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406) · doi:10.1109/cec.1999.785511 · Cited by 3,945
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 · cited 2×
“(CLPSO) introduced in [24], where particles update each dimension by learning from different local best positions.”
BackgroundMethodParameter selection in particle swarm optimization
Shi, Y., & Eberhart, R. C. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0040810 · Cited by 3,538 · cited 5×
“ARTICLE swarm optimization (PSO) is one powerful and widely used swarm intelligence paradigm [1] introduced by Kennedy and Eberhart in 1995 [2] for solving optimization problems.”
BackgroundInfluentialSelf-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 · cited 1×
“in [17].”
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
Ant colony optimization theory: A survey
Dorigo, M., & Blum, C. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.05.020 · Cited by 2,295 · cited 1×
“update of Xl(t), which is an inevitable operation in most swarm or population based evolutionary algorithms [2], [46]–[48].”
BackgroundA 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
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 · cited 2×
“[23] proposed a modified PSO, where p1 is the best particle in the neighborhood of a particle rather than a combination of gbest and pbesti.”
BackgroundMethodThe 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 · cited 2×
“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.”
BackgroundPopulation 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 · cited 2×
“Several topological structures have been proposed [22], including the ring topology and the von Neumann topology.”
BackgroundMethodThe 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 · cited 1×
“Kennedy has referred c1R1(t)(pbesti(t) −Xi(t)) and c2R2(t)(gbest(t) − Xi(t)) as thecognitive component and social component, respectively [5].”
BackgroundA cooperative coevolutionary approach to function optimization
Potter, M. A., & Jong, K. A. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-58484-6_269 · Cited by 1,510 · cited 1×
“Among the compared algorithm, the CCPSO2 [52] and the MLCC [53] are designed in the cooperative coevolution (CC) framework [56], which has been proposed to solve high-dimensional problems by automatically implementing the divide-and-conquer strategy [57].”
MethodA comprehensive survey of fitness approximation in evolutionary computation
Jin, Y. (2005) · Soft Computing · doi:10.1007/s00500-003-0328-5 · Cited by 1,229
Self-citationVesterstrom, J., & Thomsen, R. (2005) · Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753) · doi:10.1109/cec.2004.1331139 · Cited by 1,205
Fuzzy adaptive particle swarm optimization
Shi, Y., & Eberhart, R. C. (2002) · Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546) · doi:10.1109/cec.2001.934377 · Cited by 1,071 · cited 1×
“Another important modification ofω is the introduction of fuzzy inference [16].”
BackgroundSmall 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 · cited 2×
“It has been found that neighborhood control is able to help improve PSO’s performance on multimodal function by maintaining a higher degree of swarm diversity [21].”
BackgroundLarge scale evolutionary optimization using cooperative coevolution
Yang, Z., Tang, K., & Yao, X. (2008) · Information Sciences · doi:10.1016/j.ins.2008.02.017 · Cited by 1,026 · cited 1×
“Among the compared algorithm, the CCPSO2 [52] and the MLCC [53] are designed in the cooperative coevolution (CC) framework [56], which has been proposed to solve high-dimensional problems by automatically implementing he divide-and-conquerstrategy [57].”
MethodA 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 · cited 1×
“One straightforward idea is to combine PSO with different evolutionary algorithms, such as genetic algorithms [26], differential evolution [27], and ant colony optimization [28], [29].”
MethodImproved particle swarm optimization combined with chaos
Liu, B., Wang, L., Jin, Y.-H., Tang, F., & Huang, D.-X. (2005) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2004.11.095 · Cited by 947 · cited 1×
“Other hybrid PSO variants include PSO with Gaussian mutation [34], PSO with chaos [35], orthogonal learning PSO (OLPSO) [36], PSO with a moderate-random-search strategy [37], and a very recently proposed PSO with a periodic mutation strategy and neural networks [38].”
BackgroundSelf-citationEvolutionary many-objective optimization: A short review
Ishibuchi, H., Tsukamoto, N., & Nojima, Y. (2008) · 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence) · doi:10.1109/cec.2008.4631121 · Cited by 914 · cited 1×
“In the future, we will investigate the application of CSO to solving other challenging optimization problems, such a s multi-objective problems [64] and many-objective problem s [65].”
MethodCooperatively Coevolving Particle Swarms for Large Scale Optimization
Li, X., & Yao, X. (2012) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2011.2112662 · Cited by 745
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
Tang, K., Yao, X., Suganthan, P. N., MacNish, C., Chen, Y. P., Chen, C. M., & Yang, Z. (2008) · Cited by 656
A survey: algorithms simulating bee swarm intelligence
Karaboga, D., & Akay, B. (2009) · Artificial Intelligence Review · doi:10.1007/s10462-009-9127-4 · Cited by 646
Particle Swarm Optimization With an Aging Leader and Challengers
Chen, W.-N., Zhang, J., Lin, Y., Chen, N., Zhan, Z.-H., Chung, H. S.-H., Li, Y., & Shi, Y.-H. (2013) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2011.2173577 · Cited by 635 · cited 3×
“In addition, various search operators based on sociological or biological concepts have also been proposed, such as the niching PSO [32], cultural-based PSO [33] and the aging theory inspired PSO (ALC-PSO) [13].”
BackgroundParticle swarm optimization with Gaussian mutation
Higashi, N., & Iba, H. (2004) · Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706) · doi:10.1109/sis.2003.1202250 · Cited by 544 · cited 1×
“Other hybrid PSO variants include PSO with Gaussian mutation [34], PSO with chaos [35], orthogonal learning PSO (OLPSO) [36], PSO with a moderate-random-search strategy [37], and a very recently proposed PSO with a periodic mutation strategy and neural networks [38].”
BackgroundParticle 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 · cited 1×
“The motivation of introducing topological structures in PSO is to enhance the swarm diversity using neighborhood control [20], [21].”
BackgroundDynamic 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 · cited 11×
“D functions, the number of swarms varied from 4 to 50, creating an average size around 240; in DMS-PSO [30], a larger swarm size 450 was adopted for the optimization of 500-”
BackgroundMethodInfluentialGeneralizing Surrogate-Assisted Evolutionary Computation
Lim, D., Jin, Y., Ong, Y.-S., & Sendhoff, B. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2027359 · Cited by 484
Self-citationNiching 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
Kennedy, J. (2006) · Handbook of Nature-Inspired and Innovative Computing · doi:10.1007/0-387-27705-6_6 · Cited by 432
A Distance-Based Locally Informed Particle Swarm Model for Multimodal Optimization
Qu, B. Y., Suganthan, P. N., & Das, S. (2013) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2012.2203138 · Cited by 421 · cited 1×
“Recently, a distance-based locally informed particle swarm optimizer was proposed specifically to tackle multimodal problems in [25].”
BackgroundDEPSO: hybrid particle swarm with differential evolution operator
Zhang, W.-J., & Xie, X.-F. (2004) · SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483) · doi:10.1109/icsmc.2003.1244483 · Cited by 401 · cited 1×
“Among those variants, adaptation of the parameters [7], [10]–[15], hybridation with other search techniques [16]–[22] and introduction of various topological structures [23]–[29] are three most widely used approaches [30].”
BackgroundRobinson, J., Sinton, S., & Rahmat-Samii, Y. (2003) · IEEE Antennas and Propagation Society International Symposium (IEEE Cat. No.02CH37313) · doi:10.1109/aps.2002.1016311 · Cited by 372 · cited 1×
“One straightforward idea is to combine PSO with different evolutionary algorithms, such as genetic algorithms [26], differential evolution [27], and ant colony optimization [28], [29].”
MethodFrankenstein's PSO: A Composite Particle Swarm Optimization Algorithm
Montes de Oca, M. A., Stutzle, T., Birattari, M., & Dorigo, M. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2021465 · Cited by 366 · cited 1×
“For simplicity, the commonly used ring topology[22], [23], [59], which has been shown to be an effective neighborhood structure [60] is adopted here.”
MethodParticle swarm and ant colony algorithms hybridized for improved continuous optimization
Shelokar, P. S., Siarry, P., Jayaraman, V. K., & Kulkarni, B. D. (2007) · Applied Mathematics and Computation · doi:10.1016/j.amc.2006.09.098 · Cited by 344 · cited 1×
“One straightforward idea is to combine PSO with different evolutionary algorithms, such as genetic algorithms [26], differential evolution [27], and ant colony optimization [28], [29].”
MethodMultilevel cooperative coevolution for large scale optimization
Yang, Z., Tang, K., & Yao, X. (2008) · 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence) · doi:10.1109/cec.2008.4631014 · Cited by 322 · cited 10×
“In comparison, MLCC has yielded the best results on f 4 , which is a shifted Rastrigin function with a large number of local optima.”
MethodInfluentialMeasuring exploration/exploitation in particle swarms using swarm diversity
Olorunda, O., & Engelbrecht, A. P. (2008) · 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence) · doi:10.1109/cec.2008.4630938 · Cited by 307 · cited 1×
“In order to obtain measurabl e observations, adiversity measureintroduced in [62], [63] is adopted here to indicate the change of diversity during the search process:”
BackgroundA Simple Modification in CMA-ES Achieving Linear Time and Space Complexity
Ros, R., & Hansen, N. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-87700-4_30 · Cited by 258 · cited 2×
“The sep-CMA-ES is a simple modification of the original CMA-ES algorithm [58], which has been shown to be more efficient, and to scale surprisingly well on some highdimensional test functions up to 1000 dimensions [54].”
MethodOPSO: 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 · cited 1×
“Due to its conceptual simplicity and high search efficiency, PSO has attracted much research interest over the past decades and has been successfully applied to a number of applications, such as water distribution network design [6], parameter optimization in suspension system [7], resource allocation [8], task assign…”
BackgroundLocating 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 · cited 1×
“In addition, various search operators based on sociological or biological concepts have also been proposed, such as the niching PSO [32], cultural-based PSO [33] and the aging theory inspired PSO (ALC-PSO) [13].”
BackgroundAn Adaptive Particle Swarm Optimization With Multiple Adaptive Methods
Hu, M., Wu, T., & Weir, J. D. (2013) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2012.2232931 · Cited by 204 · cited 1×
“Most recently, a multiple parameter control mechanism has been introduced to adaptively change all the three parameters in [19].”
BackgroundLi, X. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2050024 · Cited by 185
Stochastic Stability Analysis of the Linear Continuous and Discrete PSO Models
Fernandez-Martinez, J. L., & Garcia-Gonzalo, E. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2053935 · Cited by 166 · cited 1×
“Similar to most theoretical convergence analysis of PSO [49]–[51], a deterministic implementation of CSO is consid ered to theoretically analyze its convergence property.”
BackgroundPehlivanoğlu, Y. V. (2012) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2012.2196047 · Cited by 135 · cited 1×
“Other hybrid PSO variants include PSO with Gaussian mutation [34], PSO with chaos [35], orthogonal learning PSO (OLPSO) [36], PSO with a moderate-random-search strategy [37], and a very recently proposed PSO with a periodic mutation strategy and neural networks [38].”
BackgroundParticle Swarm Optimization-A Survey
Kameyama, K. (2009) · IEICE Transactions on Information and Systems · doi:10.1587/transinf.e92.d.1354 · Cited by 120 · cited 1×
“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.”
BackgroundDNA Sequence Compression Using Adaptive Particle Swarm Optimization-Based Memetic Algorithm
Zhu, Z., Zhou, J., Ji, Z., & Shi, Y. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2011.2160399 · Cited by 110 · cited 1×
“Due to its conceptual simplicity and high search efficiency, PSO has attracted much research interest over the past decades and has been successfully applied to a number of applications, such as water distribution network design [6], parameter optimization in suspension system [7], resource allocation [8], task assign…”
BackgroundCultural-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
An Efficient Resource Allocation Scheme Using Particle Swarm Optimization
Gong, Y., Zhang, J., Chung, H. S.-H., Chen, W., Zhan, Z., Li, Y., & Shi, Y. (2012) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2012.2185052 · Cited by 106 · cited 1×
“Due to its conceptual simplicity and high search efficiency, PSO has attracted much research interest over the past decades and has been successfully applied to a number of applications, such as water distribution network design [6], parameter optimization in suspension system [7], resource allocation [8], task assign…”
BackgroundA novel concurrent particle swarm optimization
Baskar, S. S., & Suganthan, P. N. (2004) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2004.1330940 · Cited by 98 · cited 1×
“More multiswarm PSO variants can be found in [40] and [41].”
BackgroundA hybrid particle swarm/ant colony algorithm for the classification of hierarchical biological data
Holden, N., & Freitas, A. A. (2005) · IEEE Swarm Intelligence Symposium · doi:10.1109/sis.2005.1501608 · Cited by 90 · cited 1×
“One straightforward idea is to combine PSO with different evolutionary algorithms, such as genetic algorithms [26], differential evolution [27], and ant colony optimization [28], [29].”
MethodSolving large scale global optimization using improved Particle Swarm Optimizer
Hsieh, S.-T., Sun, T.-Y., Liu, C.-C., & Tsai, S.-J. (2008) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2008.4631030 · Cited by 86 · cited 2×
“search results [55] and the latter adopts a dynamically changing neighborhood structure for each particle [30], and both of them have participated in the CEC 2008 competition on large scale global optimization (LSGO) [43].”
BackgroundA New Particle Swarm Algorithm and Its Globally Convergent Modifications
Gao, H., & Xu, W. (2011) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2011.2144582 · Cited by 85 · cited 1×
“Other hybrid PSO variants include PSO with Gaussian mutation [34], PSO with chaos [35], orthogonal learning PSO (OLPSO) [36], PSO with a moderate-random-search strategy [37], and a very recently proposed PSO with a periodic mutation strategy and neural networks [38].”
BackgroundA diversity-enriched variant of discrete PSO applied to the design of water distribution networks
Montalvo, I., Izquierdo, J., Pérez, R., & Iglesias‐Rey, P. L. (2008) · Engineering Optimization · doi:10.1080/03052150802010607 · Cited by 59
Robustness Against the Decision-Maker's Attitude to Risk in Problems With Conflicting Objectives
Bui, L. T., Abbass, H. A., Barlow, M., & Bender, A. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2051443 · Cited by 58
A multi-swarm evolutionary framework based on a feedback mechanism
Cheng, R., Sun, C., & Jin, Y. (2013) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2013.6557639 · Cited by 38 · cited 2×
“An attempt was made along this line in a multi-swarm framework [42], where neithergbest nor pbesti has been used.”
MethodInfluentialSelf-citationDIVERSITY-BASED INFORMATION EXCHANGE AMONG MULTIPLE SWARMS IN PARTICLE SWARM OPTIMIZATION
Yen, G. G., & Daneshyari, M. (2008) · International Journal of Computational Intelligence and Applications · doi:10.1142/s1469026808002144 · Cited by 29 · cited 1×
“More multiswarm PSO variants can be found in [40] and [41].”
BackgroundComparing lbest PSO niching algorithms using different position update rules
Li, X., & Deb, K. (2010) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2010.5586317 · Cited by 21 · cited 1×
“In this topology, each parti cle takes the two immediate neighbors to form a neighborhood [61].”
BackgroundParameter Identification Based on a Modified PSO Applied to Suspension System
Alfi, A., & Fateh, M.-M. (2010) · Journal of Software Engineering and Applications · doi:10.4236/jsea.2010.33027 · Cited by 20 · cited 1×
“Due to its conceptual simplicity and high search efficiency, PSO has attracted much research interest over the past decad es and has been successfully applied to a number of application s, such as water distribution network design [6], parameter optimization in suspension system [7], resource allocatio n [8], task ass…”
BackgroundParticle Swarm Optimizer with Time-Varying Parameters based on a Novel Operator
Cheng, R., & Yao, M. (2011) · Cited by 18
Self-citationMeasuring Diversity in the Cooperative Particle Swarm Optimizer
Ismail, A., & Engelbrecht, A. P. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32650-9_9 · Cited by 14 · cited 1×
“In order to obtain measurable observations, a diversity measure introduced in [62] and [63] is adopted here to indicate the change of diversity during the search process”
Background
Research works printed but not linked: 1
- jin, 2002, Fitness approximation in evolutionary computation—A survey, Proc GECCO, 1105
Cited by
Snake Optimizer: A novel meta-heuristic optimization algorithm
Hashim, F. A., & Hussien, A. G. (2022) · Knowledge-Based Systems · doi:10.1016/j.knosys.2022.108320 · Cited by 1,106
INFO: An efficient optimization algorithm based on weighted mean of vectors
Ahmadianfar, I., Heidari, A. A., Noshadian, S., Chen, H., & Gandomi, A. H. (2022) · Expert Systems with Applications · doi:10.1016/j.eswa.2022.116516 · Cited by 822
“Currently, PSO has taken its place in the fields of large-scale optimisation problems[19], feature selection[20], single-objective optimization problem[21], multiobjective optimisation problems[22], and high-dimensional expensive problem[23].”
BackgroundA 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
“As suggested in [9,58], pairwise comparison in selection can not only reduce memory usage, but also make it easier to adopt a compact encoding.”
BackgroundSelf-citationHippopotamus optimization algorithm: a novel nature-inspired optimization algorithm
Amiri, M. H., Mehrabi Hashjin, N., Montazeri, M., Mirjalili, S., & Khodadadi, N. (2024) · Scientific Reports · doi:10.1038/s41598-024-54910-3 · Cited by 718
Zhang, X., Tian, Y., Cheng, R., & Jin, Y. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2600642 · Cited by 660
Self-citation
Metadata
- Authors
- Cheng, R., & Jin, Y.
- Affiliations
- University of Surrey (GB)
- ORCID
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2015-02
- Volume
- 45
- Issue
- 2
- Pages
- 191-204
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W1995972800
- Cited by
- 1,052
- References
- 73
- Citations by year
- 2026: 58 · 2025: 123 · 2024: 162 · 2023: 132 · 2022: 154 · 2021: 118 · 2020: 92 · 2019: 63 · 2018: 53 · 2017: 48 · 2016: 35 · 2015: 11
- FWCI
- 31.90
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Transactions on Cybernetics (publishedVersion)
- PubMed (publishedVersion)
- Surrey Research Insight Open Access (The University of Surrey) (submittedVersion)
- Open Research (University of Surrey) (submittedVersion)
- Funders
- Honda Research Institute Europe
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Antenna Design and Optimization
- Keywords
- competitive swarm optimizer, large-scale optimization, particle swarm optimization, metaheuristic algorithms, convergence proof, exploration-exploitation balance, high-dimensional optimization
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.