The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A new hybrid PSOGSA algorithm for function optimization
Abstract
In this paper, a new hybrid population-based algorithm (PSOGSA) is proposed with the combination of Particle Swarm Optimization (PSO) and Gravitational Search Algorithm (GSA). The main idea is to integrate the ability of exploitation in PSO with the ability of exploration in GSA to synthesize both algorithms' strength. Some benchmark test functions are used to compare the hybrid algorithm with both the standard PSO and GSA algorithms in evolving best solution. The results show the hybrid algorithm possesses a better capability to escape from local optimums with faster convergence than the standard PSO and GSA.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
Cited by
Radosavljevic, J., Arsic, N., Milovanovic, M., & Ktena, A. (2020) · Journal of Modern Power Systems and Clean Energy · doi:10.35833/mpce.2019.000259 · Cited by 122
Ansari, S., Hannan, M. A., Ayob, A., Abdolrasol, M. G. M., & Dar, M. A. (2025) · Journal of Energy Storage · doi:10.1016/j.est.2024.114711 · Cited by 20
Radosavljević, J., Ktena, A., Gajić, M., Milovanović, M., & Živić, J. (2023) · Energies · doi:10.3390/en16114356 · Cited by 10
Metadata
- Authors
- Mirjalili, S., & Hashim, S. Z. M.
- Venue
- 2010 International Conference on Computer and Information Application
- Publisher
- IEEE
- Published
- 2010-12
- Pages
- 374-377
- OpenAlex
- W2542691202
- Cited by
- 631
- References
- 1
- FWCI
- 5.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.
