EUVIMEDEUVIMED entdecken
Crossref

A novel metaheuristic algorithm: advanced social memory optimization

Shijie Fan, Ruichen Wang, Kang Su

Physica Scripta · 01.05.2025 · 100 (5) · 055004

DOI: 10.1088/1402-4896/adbfd6 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Physica Scripta, online erschienen am 02.04.2025. Verfasst von Shijie Fan und 2 weiteren Autor:innen. Die Arbeit wurde bisher 19-mal zitiert (Crossref) und nennt 110 Literaturangaben. Gefördert von: Key Research Project of China State Railway Group Co., Ltd., Natural Science Foundation of Hebei Province, Open project of the State Key Laboratory of Rail Transit Vehicle System.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The field of optimization problems has garnered significant attention due to its importance across various applications, particularly driven by the demand for efficient solutions to complex engineering challenges. Numerous metaheuristic algorithms inspired by animal behaviour or swarm intelligence have been proposed; however, these algorithms often pursue a multitude of strategies, resulting in excessive parameters that complicate tuning and hinder convergence and balance. Additionally, algorithms based on human behaviour remain scarce. To address these limitations, extensive research has been conducted on the interplay between social memory and individual memory, leading to the introduction of a novel human-behaviour-inspired metaheuristic algorithm, named Advanced Social Memory Optimization (ASMO). This algorithm seeks to address the complexities of parameter management, convergence, and balance more effectively with a streamlined set of strategies. Furthermore, a mathematical model based on the mechanisms of social memory formation and individual memory updating underpins the algorithm. Rigorous performance evaluations, utilizing the Wilcoxon Rank-Sum Test and the Friedman Test across multiple benchmark suites (CEC2017, CEC2019, and CEC2022), demonstrate that ASMO, with only two algorithmic strategies, outperforms or matches established algorithms on more than half of the test functions. These findings suggest promising new avenues for research in the field of optimization and, given the succinctness of ASMO’s strategies, underscore its potential as a powerful tool for enhancing and developing solutions to complex engineering design problems. The code for the ASMO algorithm is available in appendix D.

Förderung

  • Key Research Project of China State Railway Group Co., Ltd.
  • Natural Science Foundation of Hebei Province
  • Open project of the State Key Laboratory of Rail Transit Vehicle System
  • Major Technology Research and Development Program of the Hebei Provincial Science and Technology
  • Research Foundation of Hebei Province's Full-time Recruitment of High-level Talent
  • Hebei Province Yanzhao Golden Terrace Key Talent Recruitment Program

Zitieren

APA

Fan, S., Wang, R., & Su, K. (2025). A novel metaheuristic algorithm: advanced social memory optimization. Physica Scripta, 100(5), 055004. https://doi.org/10.1088/1402-4896/adbfd6

Vancouver

Fan S, Wang R, Su K. A novel metaheuristic algorithm: advanced social memory optimization. Physica Scripta. 2025;100(5):055004. doi:10.1088/1402-4896/adbfd6

BibTeX
@article{Fan2025,
  author = {Fan, Shijie and Wang, Ruichen and Su, Kang},
  title = {A novel metaheuristic algorithm: advanced social memory optimization},
  journal = {Physica Scripta},
  year = {2025},
  volume = {100},
  number = {5},
  pages = {055004},
  doi = {10.1088/1402-4896/adbfd6}
}
Kostenlos starten →