Accès ouvert · CC BY

Parallel Discrete Harmony Search Algorithm for the Graph Coloring Problem

Article scientifique 2024 Sciences mathématiques et statistiques Anglais

Résumé

Graph coloring is an NP-hard combinatorial optimization problem with significant implications in both theoretical and practical contexts due to its complexity and extensive applicability. In this work, a novel approach is proposed to address the graph coloring problem through a parallel discrete Harmony Search algorithm, termed PDHSCol. By harnessing the robustness of the Harmony Search algorithm and integrating parallel processing, our algorithm enhances performance by concurrently generating and evaluating multiple solutions. Implemented in MATLAB, PDHSCol was evaluated using a variety of DIMACS benchmark instances. The experimental results demonstrate that the algorithm performs effectively and yields promising improvements over various other methods, highlighting its potential to deliver high-quality solutions.

Citer ce document

Chemaa, S., Kout, A., Djelloul, H., & Harrag, N. (2024). Parallel Discrete Harmony Search Algorithm for the Graph Coloring Problem. Engineering Technology & Applied Science Research. https://doi.org/10.48084/etasr.8565

Exporter : BibTeX · RIS (Zotero, Mendeley, EndNote)

Accès au document

Texte intégral archivé sur SPHAERO, en accès ouvert : lisible gratuitement en ligne après connexion. Le document reste aussi disponible à sa source. Se connecter

Voir l'article sur le site de la revue

Licence et provenance

Licence : CC BY

Notice moissonnée depuis OpenAlex le 28/09/2026. Le document reste hébergé par sa source.
Voir le document à la source →

Statistiques

Consultations (hors robots) : 8

Téléchargements (hors robots) : 0

Méthode de comptage