The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Influence of initialization on the performance of metaheuristic optimizers
Open accessAbstract
All metaheuristic optimization algorithms require some initialization, and the initialization for such optimizers is usually carried out randomly. However, initialization can have some significant influence on the performance of such algorithms. This paper presents a systematic comparison of 22 different initialization methods on the convergence and accuracy of five optimizers: differential evolution (DE), particle swarm optimization (PSO), cuckoo search (CS), artificial bee colony (ABC) and genetic algorithm (GA). We have used 19 different test functions with different properties and modalities to compare the possible effects of initialization, population sizes and the numbers of iterations. Rigorous statistical ranking tests indicate that 43.37% of the functions using the DE algorithm show significant differences for different initialization methods, while 73.68% of the functions using both PSO and CS algorithms are significantly affected by different initialization methods. The simulations show that DE is less sensitive to initialization, while both PSO and CS are more sensitive to initialization. In addition, under the condition of the same maximum number of fitness evaluations (FEs), the population size can also have a strong effect. Particle swarm optimization usually requires a larger population, while the cuckoo search needs only a small population size. Differential evolution depends more heavily on the number of iterations, a relatively small population with more iterations can lead to better results. Furthermore, ABC is more sensitive to initialization, while such initialization has little effect on GA. Some probability distributions such as the beta distribution, exponential distribution and Rayleigh distribution can usually lead to better performance. The implications of this study and further research topics are also discussed in detail.
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
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
Cited by
Dwarf Mongoose Optimization Algorithm
Agushaka, J. O., Ezugwu, A. E., & Abualigah, L. (2022) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2022.114570 · Cited by 898
Safety-enhanced UAV path planning with spherical vector-based particle swarm optimization
Phung, M. D., & Ha, Q. P. (2021) · Applied Soft Computing · doi:10.1016/j.asoc.2021.107376 · Cited by 565
Major Advances in Particle Swarm Optimization: Theory, Analysis, and Application
Houssein, E. H., Gad, A. G., Hussain, K., & Suganthan, P. N. (2021) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2021.100868 · Cited by 466
RetractedDeng, L., & Liu, S. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.120069 · Cited by 458
Self-citationGenghis Khan shark optimizer: A novel nature-inspired algorithm for engineering optimization
Hu, G., Guo, Y., Wei, G., & Abualigah, L. (2023) · Advanced Engineering Informatics · doi:10.1016/j.aei.2023.102210 · Cited by 255
Metadata
- Authors
- Li, Q., Liu, S.-Y., & Yang, X.-S.
- Venue
- Applied Soft Computing
- Publisher
- Elsevier BV
- Published
- 2020-06
- Volume
- 91
- Pages
- 106193
- ISSN
- 1568-4946 (ISSN-L)
- OpenAlex
- W3007696876
- Cited by
- 159
- References
- 1
- FWCI
- 5.30
- Type
- journal article
- Language
- en
- Open access
- green
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.