The DOI matches its Crossref record; 79 of the 79 references it cites were found in a registry or an index.
A comprehensive survey on gravitational search algorithm
Open accessAbstract
Abstract Gravitational Search Algorithm (GSA) is an optimization method inspired by the theory of Newtonian gravity in physics. Till now, many variants of GSA have been introduced, most of them are motivated by gravity-related theories such as relativity and astronomy. On the one hand, to solve different kinds of optimization problems, modified versions of GSA have been presented such as continuous (real), binary, discrete, multimodal, constraint, single-objective, and multi-objective GSA. On the other hand, to tackle the difficulties in real-world problems, the efficiency of GSA has been improved using specialized operators, hybridization, local search, and designing the self-adaptive algorithms. Researchers have utilized GSA to solve various engineering optimization problems in diverse fields of applications ranging from electrical engineering to bioinformatics. Here, we discussed a comprehensive investigation of GSA and a brief review of GSA developments in solving different engineering problems to build up a global picture and to open the mind to explore possible applications. We also made a number of suggestions that can be undertaken to help move the area forward.
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
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
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
GSA: A Gravitational Search Algorithm
Rashedi, E., Nezamabadi-pour, H., & Saryazdi, S. (2009) · Information Sciences · doi:10.1016/j.ins.2009.03.004 · Cited by 7,358
Self-citationAN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION
Karaboğa, D. (2005) · Cited by 5,466
Biomimicry of bacterial foraging for distributed optimization and control
(2002) · IEEE Control Systems · doi:10.1109/mcs.2002.1004010 · Cited by 3,069
Artificial Intelligence through Simulated Evolution
Fogel, L. J., Owens, A. J., & Walsh, M. J. (1966) · International Linear Collider · Cited by 2,796
Atashpaz-Gargari, E., & Lucas, C. (2007) · 2007 IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2007.4425083 · Cited by 2,628
Parameter control in evolutionary algorithms
Eiben, A. E., Hinterding, R., & Michalewicz, Z. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.771166 · Cited by 1,980
A comprehensive survey: artificial bee colony (ABC) algorithm and applications
Karaboga, D., Gorkemli, B., Ozturk, C., & Karaboga, N. (2014) · Artificial Intelligence Review · doi:10.1007/s10462-012-9328-0 · Cited by 1,975
Cited by
A survey on new generation metaheuristic algorithms
Dokeroglu, T., Sevinc, E., Kucukyilmaz, T., & Cosar, A. (2019) · Computers & Industrial Engineering · doi:10.1016/j.cie.2019.106040 · Cited by 923
Grasshopper Optimization Algorithm: Theory, Variants, and Applications
Meraihi, Y., Gabis, A. B., Mirjalili, S., & Ramdane-Cherif, A. (2021) · IEEE Access · doi:10.1109/access.2021.3067597 · Cited by 320
Hossain Lipu, M. S., Hannan, M. A., Hussain, A., Saad, M. H., Ayob, A., & Uddin, M. N. (2019) · IEEE Transactions on Industry Applications · doi:10.1109/tia.2019.2902532 · Cited by 188
Metadata
- Authors
- Rashedi, E., Rashedi, E., & Nezamabadi-pour, H.
- Venue
- Swarm and Evolutionary Computation
- Publisher
- Elsevier BV
- Published
- 2018-08
- Volume
- 41
- Pages
- 141-158
- ISSN
- 2210-6502 (ISSN-L)
- OpenAlex
- W2791995454
- Cited by
- 268
- References
- 79
- FWCI
- 14.85
- Type
- journal article
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A comprehensive survey on gravitational search algorithm. https://app.cochat.ai/papers/10.1016/j.swevo.2018.02.018
- The paper
- Rashedi, E., Rashedi, E., & Nezamabadi-pour, H. (2018). A comprehensive survey on gravitational search algorithm. Swarm and Evolutionary Computation. https://doi.org/10.1016/j.swevo.2018.02.018
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.