CoChat

Crystal Structure Algorithm (CryStAl): A Metaheuristic Optimization Method

Open access
Talatahari, Siamak, Azizi, Mahdi, Tolouei, Mohamad, Talatahari, Babak, Sareh, Pooya · 2021 · IEEE Access
Cited by 184

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Abstract

Metaheuristics are computational procedures that intelligently lead the search process through the efficient exploration of the search space associated with an optimization problem. With the progressive outburst of problems with large data sets in various fields, there is an ongoing quest for enhancing existing metaheuristic algorithms as well as developing new ones with greater accuracy and efficiency. In general, a powerful and efficient metaheuristic algorithm is based on a rich inspiration source, implemented effectively through a precise mathematical model. Aiming to develop a highly efficient, nature-inspired optimization algorithm, here we propose a novel metaheuristic called Crystal Structure Algorithm (CryStAl). This method is chiefly inspired by the principles underlying the formation of crystal structures from the addition of the basis to the lattice points, which is a natural phenomenon that can be seen in the symmetric arrangement of constituents (i.e. atoms, molecules, or ions) in crystalline minerals such as quartz. A total number of 239 mathematical functions which are categorized into four different groups are utilized to evaluate the overall performance of the proposed method. To validate the results of this novel algorithm, 12 different classical and modern metaheuristic algorithms are selected from the literature. The minimum, mean, and standard deviation values alongside the number of function evaluations for CryStAl and the other metaheuristics for a specific tolerance are calculated and presented accordingly. The obtained results, further supported by a complete statistical analysis, demonstrated that the proposed algorithm is capable of providing very competitive results, outperforming the other metaheuristics in most cases.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/access.2021.3079161

Cites

2 of 2 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

  • Differential evolution- A simple and efficient heuristic for global optimization over continuous spaces

    Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569 · cited 1×

    “The first category is entitled ‘‘evolutionary algorithms’’ including the Memetic Algorithm (MA) [3], Genetic Algorithm (GA) [4], Differential Evolution (DE) [5], and the Evolution Strategies (ES) [6], whichwere developed based on the biological evolution and reproduction.”
    Background
  • 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×

    “The Particle Swarm Optimization (PSO) [7], Ant Colony Optimization (ACO) [8], Artificial Bee Colony (ABC) [9], Cat Swarm Optimization (CSA) [10], Firefly Algorithm (FA) [11], Krill Herd (KH) algorithm [12], and Slap Swarm Algorithm (SSA) [13] are some of the well-known methods in this category.”
    Method

Cited by

See all 184

Metadata

Authors
Talatahari, S., Azizi, M., Tolouei, M., Talatahari, B., & Sareh, P.
Venue
IEEE Access
Published
2021
Volume
9
Pages
71244-71261
ISSN
2169-3536 (ISSN-L)
OpenAlex
W3162154139
Cited by
184
References
2
FWCI
11.47
Type
journal article
Language
en
Open access
gold

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.