EUVIMEDEUVIMED entdecken
Crossref

Applying the Harmony Search Algorithm to Combinatorial Optimization Problems

F. Bouyaakoubi, M. C. Abounaima, M. D. El Ouadghiri

Mathematical Modeling and Computing · 2026 · 13 (1) · 329-338

DOI: 10.23939/mmc2026.01.329 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematical Modeling and Computing, 2026. Verfasst von F. Bouyaakoubi und 2 weiteren Autor:innen. Die Arbeit nennt 8 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The Harmony Search Algorithm (HSA) is a metaheuristic inspired by the musical composition process that is used to solve complex optimization problems. This study provides a detailed exploration of the application of HSA to classical combinatorial optimization problems, including the Traveling Salesman Problem (TSP), the Quadratic Assignment Problem (QAP), and the Vehicle Routing Problem (VRP). The results demonstrate that HSA is an effective method for finding high-quality solutions, even for large-scale instances. This study also presents an in-depth analysis of HSA parameters, its adaptation to the considered problems, and a comparison with other metaheuristic methods.

Zitieren

APA

Bouyaakoubi, F., Abounaima, M. C., & Ouadghiri, M. D. E. (2026). Applying the Harmony Search Algorithm to Combinatorial Optimization Problems. Mathematical Modeling and Computing, 13(1), 329-338. https://doi.org/10.23939/mmc2026.01.329

Vancouver

Bouyaakoubi F, Abounaima MC, Ouadghiri MDE. Applying the Harmony Search Algorithm to Combinatorial Optimization Problems. Mathematical Modeling and Computing. 2026;13(1):329-338. doi:10.23939/mmc2026.01.329

BibTeX
@article{Bouyaakoubi2026,
  author = {Bouyaakoubi, F. and Abounaima, M. C. and Ouadghiri, M. D. El},
  title = {Applying the Harmony Search Algorithm to Combinatorial Optimization Problems},
  journal = {Mathematical Modeling and Computing},
  year = {2026},
  volume = {13},
  number = {1},
  pages = {329--338},
  doi = {10.23939/mmc2026.01.329}
}
Kostenlos starten →