EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

SocioCyclic Optimizer: a Novel Swarm-Based Metaheuristic Algorithm

Mohammed H. S. Helal

WSEAS TRANSACTIONS ON SYSTEMS · 05.05.2026 · 25 · 286

DOI: 10.37394/23202.2026.25.22 ↗

Kurz gefasst

Fachartikel in der Zeitschrift WSEAS TRANSACTIONS ON SYSTEMS, online erschienen am 05.05.2026. Verfasst von Mohammed H. S. Helal. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 16 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This paper presents a novel swarm evolutionary metaheuristic optimization algorithm inspired by the cyclic nature of human civilization in its rise from nomadic life to the point where it peaks, stagnates, and then declines back to nomadic life. Nomads do the exploration, while civics do the exploitation. The proposed algorithm also mimics basic attributes and behaviors of human civilizations from hostility that pushes civilizations away from each other to cooperation and trade which helps to explore areas in between and exchange knowledge of best traits (products). Experimental results show highly competitive results when benchmarked with common swarm-based evolutionary algorithms such as Genetic Algorithm, Particle Swarm Optimization, Wolf Pack Algorithm, and Artificial Bee Colony, using common test functions like Rastrigin, Schwefel, Rosenbrock, Griewank, and Ackley.

Zitieren

APA

Helal, M. H. S. (2026). SocioCyclic Optimizer: a Novel Swarm-Based Metaheuristic Algorithm. WSEAS TRANSACTIONS ON SYSTEMS, 25, 286. https://doi.org/10.37394/23202.2026.25.22

Vancouver

Helal MHS. SocioCyclic Optimizer: a Novel Swarm-Based Metaheuristic Algorithm. WSEAS TRANSACTIONS ON SYSTEMS. 2026;25:286. doi:10.37394/23202.2026.25.22

BibTeX
@article{Helal2026,
  author = {Helal, Mohammed H. S.},
  title = {SocioCyclic Optimizer: a Novel Swarm-Based Metaheuristic Algorithm},
  journal = {WSEAS TRANSACTIONS ON SYSTEMS},
  year = {2026},
  volume = {25},
  pages = {286},
  doi = {10.37394/23202.2026.25.22}
}
Kostenlos starten →