EUVIMEDEUVIMED entdecken
Crossref

A comprehensive review of metaheuristic algorithms for ‎combinatorial optimization problems

Nazik Saber Rashid, Ibrahim M. I. Zebari

International Journal of Scientific World · 2025

DOI: 10.14419/d5pxkg39 ↗

Kurz gefasst

Fachartikel in der Zeitschrift International Journal of Scientific World, 2025. Verfasst von Nazik Saber Rashid und 1 weiteren Autor:innen. Die Arbeit wurde bisher 6-mal zitiert (Crossref).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Metaheuristic algorithms are essential for handling difficult combinatorial optimization issues that arise in a variety of domains such as engi-‎neering, logistics, and operations research. These algorithms, based on natural, social, and physical events, strike a compromise between ‎computing efficiency and solution quality. This study divides metaheuristic approaches into three categories: evolutionary algorithms, ‎swarm intelligence techniques, and physics-based models, with a focus on current advances like hybrid and AI-driven frameworks. It also ‎examines issues like as standardization, scalability, and practical implementation, including examples such as the Fire Hawk Optimizer to ‎demonstrate its uses. This study intends to lead the development of trustworthy and efficient metaheuristic algorithms to solve increasingly ‎complicated optimization issues in real-world settings, integrating theoretical ideas and practical examples‎.

Zitieren

APA

Rashid, N. S., & Zebari, I. M. I. (2025). A comprehensive review of metaheuristic algorithms for ‎combinatorial optimization problems. International Journal of Scientific World. https://doi.org/10.14419/d5pxkg39

Vancouver

Rashid NS, Zebari IMI. A comprehensive review of metaheuristic algorithms for ‎combinatorial optimization problems. International Journal of Scientific World. 2025. doi:10.14419/d5pxkg39

BibTeX
@article{Rashid2025,
  author = {Rashid, Nazik Saber and Zebari, Ibrahim M. I.},
  title = {A comprehensive review of metaheuristic algorithms for ‎combinatorial optimization problems},
  journal = {International Journal of Scientific World},
  year = {2025},
  doi = {10.14419/d5pxkg39}
}
Kostenlos starten →