The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Dynamic multi-swarm particle swarm optimizer with local search for Large Scale Global Optimization
Abstract
In this paper, the performance of dynamic multi-swarm particle swarm optimizer (DMS-PSO) on the set of benchmark functions provided for the CEC2008 Special Session on Large Scale optimization is reported. Different from the existing multi-swarm PSOs and local versions of PSO, the sub-swarms are dynamic and the sub-swarmspsila size is very small. The whole population is divided into a large number sub-swarms, these sub-swarms are regrouped frequently by using various regrouping schedules and information is exchanged among the particles in the whole swarm. The Quasi-Newton method is combined to improve its local searching ability.
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
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×
“…phone: +968-92992057; e-mail: mfatih@squ.edu. om 1 2 * * 1 *( ) +c * 2 *( ) d d d d d i i i i i d d d i i V w V c rand pbest X rand gbest x (2) d d d i i i X X V (3) where 1 c and 2 c are the acceleration constants, 1 d i rand and 2 d i rand are two uniformly distributed random numbers in [0] [1].”
Background
Cited by
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
“EPUS-PSO is another PSO variant which adjusts the swarm size according to the search results [32], and DMS-L-PSO is the DMS-PSO enhanced with a local search operator [98].”
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
Efficient Large-Scale Multiobjective Optimization Based on a Competitive Swarm Optimizer
Tian, Y., Zheng, X., Zhang, X., & Jin, Y. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2906383 · Cited by 480
Enhancing particle swarm optimization using generalized opposition-based learning
Wang, H., Wu, Z., Rahnamayan, S., Liu, Y., & Ventresca, M. (2011) · Information Sciences · doi:10.1016/j.ins.2011.03.016 · Cited by 478
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
Self-citationRetractedMetaheuristics in large-scale global continues optimization: A survey
Mahdavi, S., Shiri, M. E., & Rahnamayan, S. (2015) · Information Sciences · doi:10.1016/j.ins.2014.10.042 · Cited by 465
A survey on evolutionary computation for complex continuous optimization
Zhan, Z.-H., Shi, L., Tan, K. C., & Zhang, J. (2022) · Artificial Intelligence Review · doi:10.1007/s10462-021-10042-y · Cited by 416
Cao, Y., Zhang, H., Li, W., Zhou, M., Zhang, Y., & Chaovalitwongse, W. A. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2885075 · Cited by 405
Particle Swarm Optimization: Technique, System and Challenges
Palupi Rini, D., Mariyam Shamsuddin, S., & Sophiyati Yuhaniz, S. (2011) · International Journal of Computer Applications · doi:10.5120/1810-2331 · Cited by 390
DG2: A Faster and More Accurate Differential Grouping for Large-Scale Black-Box Optimization
Omidvar, M. N., Yang, M., Mei, Y., Li, X., & Yao, X. (2017) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2694221 · Cited by 347
A Level-Based Learning Swarm Optimizer for Large-Scale Optimization
Yang, Q., Chen, W.-N., Deng, J. D., Li, Y., Gu, T., & Zhang, J. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2743016 · Cited by 326
Chen, H., Heidari, A. A., Chen, H., Wang, M., Pan, Z., & Gandomi, A. H. (2020) · Future Generation Computer Systems · doi:10.1016/j.future.2020.04.008 · Cited by 322
Wang, Z.-J., Zhan, Z.-H., Yu, W.-J., Lin, Y., Zhang, J., Gu, T.-L., & Zhang, J. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2933499 · Cited by 257
Metadata
- Authors
- Zhao, S. Z., Liang, J. J., Suganthan, P. N., & Tasgetiren, M. F.
- Venue
- 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)
- Publisher
- IEEE
- Published
- 2008-06
- Pages
- 3845-3852
- OpenAlex
- W2135564892
- Cited by
- 247
- References
- 1
- FWCI
- 9.43
- 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.