The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A novel atom search optimization for dispersion coefficient estimation in groundwater
Abstract
Abstract A new type of meta-heuristic global optimization methodology based on atom dynamics is introduced. The proposed Atom Search Optimization (ASO) approach is a population-based iterative heuristic global optimization algorithm for dealing with a diverse set of optimization problems. ASO mathematically models and mimics the atomic motion model in nature, where atoms interact with each other through interaction forces resulting form Lennard-Jones potential and constraint forces resulting from bond-length potential, the algorithm is simple and easy to implement. ASO is applied to a dispersion coefficient estimation problem, the experimental results demonstrate that ASO can outperform other well-known approaches such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA) and Bacterial Foraging Optimization (BFO) and that ASO is competitive to its competitors for parameter estimation problems. The source codes of ASO are available at https://www.mathworks.com/matlabcentral/fileexchange/67011-atom-search-optimization--aso--algorithm?s_tid=srchtitle .
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
Manta ray foraging optimization: An effective bio-inspired optimizer for engineering applications
Zhao, W., Zhang, Z., & Wang, L. (2020) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2019.103300 · Cited by 1,080
Self-citationHenry gas solubility optimization: A novel physics-based algorithm
Hashim, F. A., Houssein, E. H., Mabrouk, M. S., Al-Atabany, W., & Mirjalili, S. (2019) · Future Generation Computer Systems · doi:10.1016/j.future.2019.07.015 · Cited by 1,061
Gradient-based optimizer: A new metaheuristic optimization algorithm
Ahmadianfar, I., Bozorg-Haddad, O., & Chu, X. (2020) · Information Sciences · doi:10.1016/j.ins.2020.06.037 · Cited by 904
Artificial ecosystem-based optimization: a novel nature-inspired meta-heuristic algorithm
Zhao, W., Wang, L., & Zhang, Z. (2020) · Neural Computing and Applications · doi:10.1007/s00521-019-04452-x · Cited by 499
Self-citationAtomic orbital search: A novel metaheuristic algorithm
Azizi, M. (2021) · Applied Mathematical Modelling · doi:10.1016/j.apm.2020.12.021 · Cited by 300
Metadata
- Authors
- Zhao, W., Wang, L., & Zhang, Z.
- Venue
- Future Generation Computer Systems
- Publisher
- Elsevier BV
- Published
- 2019-02
- Volume
- 91
- Pages
- 601-610
- ISSN
- 0167-739X (ISSN-L)
- OpenAlex
- W2803360343
- Cited by
- 241
- References
- 1
- FWCI
- 12.31
- 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.