MPSO: Modified particle swarm optimization and its applications
The DOI matches its Crossref record; 67 of the 67 references it cites were found in a registry or an index.
Abstract
Abstract Particle swarm optimization (PSO) is a population based meta-heuristic search algorithm that has been widely applied to a variety of problems since its advent. In PSO, the inertial weight not only has a crucial effect on its convergence, but also plays an important role in balancing exploration and exploitation during the evolution. However, PSO is easily trapped into the local optima and premature convergence appears when applied to complex multimodal problems. To address these issues, we present a modified particle swarm optimization with chaos-based initialization and robust update mechanisms. On the one side, the Logistic map is utilized to generate uniformly distributed particles to improve the quality of the initial population. On the other side, the sigmoid-like inertia weight is formulated to make the PSO adaptively adopt the inertia weight between linearly decreasing and nonlinearly decreasing strategies in order to achieve better tradeoff between the exploration and exploitation. During this process, a maximal focus distance is formulated to measure the particle's aggregation degree. At the same time, the wavelet mutation is applied for the particles whose fitness value is less than that of the average so as to enhance the swarm diversity. In addition, an auxiliary velocity-position update mechanism is exclusively applied to the global best particle that can effectively guarantee the convergence of MPSO. Extensive experiments on CEC′13/15 test suites and in the task of standard image segmentation validate the effectiveness and efficiency of the MPSO algorithm proposed in this paper.
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
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
A Threshold Selection Method from Gray-Level Histograms
Otsu, N. (1979) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1979.4310076 · Cited by 43,398
Particle swarm optimization: An overview
Poli, R., Kennedy, J., & Blackwell, T. (2007) · Swarm Intelligence · doi:10.1007/s11721-007-0002-0 · Cited by 21,101
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
Ant colony system: a cooperative learning approach to the traveling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585892 · Cited by 8,081
Simple mathematical models with very complicated dynamics
May, R. M. (1976) · Nature · doi:10.1038/261459a0 · Cited by 7,001
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-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 by
A comprehensive survey: Whale Optimization Algorithm and its applications
Gharehchopogh, F. S., & Gholizadeh, H. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2019.03.004 · Cited by 758
Efficient path planning for UAV formation via comprehensively improved particle swarm optimization
Shao, S., Peng, Y., He, C., & Du, Y. (2020) · ISA Transactions · doi:10.1016/j.isatra.2019.08.018 · Cited by 372
Fitness-distance balance (FDB): A new selection method for meta-heuristic search algorithms
Kahraman, H. T., Aras, S., & Gedikli, E. (2020) · Knowledge-Based Systems · doi:10.1016/j.knosys.2019.105169 · Cited by 300
UAV Path Planning Using Optimization Approaches: A Survey
Ait Saadi, A., Soukane, A., Meraihi, Y., Benmessaoud Gabis, A., Mirjalili, S., & Ramdane-Cherif, A. (2022) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-022-09742-7 · Cited by 269
Metadata
- Authors
- Tian, D., & Shi, Z.
- Venue
- Swarm and Evolutionary Computation
- Publisher
- Elsevier BV
- Published
- 2018-08
- Volume
- 41
- Pages
- 49-68
- ISSN
- 2210-6502 (ISSN-L)
- OpenAlex
- W2789477383
- Cited by
- 363
- References
- 67
- FWCI
- 18.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.