Welcome to the InfoSci Platform
Reference Hub11
Solving Graph Coloring Problem Using an Enhanced Binary Dragonfly Algorithm

Solving Graph Coloring Problem Using an Enhanced Binary Dragonfly Algorithm

Karim Baiche, Yassine Meraihi, Manolo Dulva Hina, Amar Ramdane-Cherif, Mohammed Mahseur
Copyright: © 2019 |Volume: 10 |Issue: 3 |Pages: 23
ISSN: 1947-9263|EISSN: 1947-9271|EISBN13: 9781522566380|DOI: 10.4018/IJSIR.2019070102
Cite Article Cite Article

MLA

Baiche, Karim, et al. "Solving Graph Coloring Problem Using an Enhanced Binary Dragonfly Algorithm." IJSIR vol.10, no.3 2019: pp.23-45. http://doi.org/10.4018/IJSIR.2019070102

APA

Baiche, K., Meraihi, Y., Hina, M. D., Ramdane-Cherif, A., & Mahseur, M. (2019). Solving Graph Coloring Problem Using an Enhanced Binary Dragonfly Algorithm. International Journal of Swarm Intelligence Research (IJSIR), 10(3), 23-45. http://doi.org/10.4018/IJSIR.2019070102

Chicago

Baiche, Karim, et al. "Solving Graph Coloring Problem Using an Enhanced Binary Dragonfly Algorithm," International Journal of Swarm Intelligence Research (IJSIR) 10, no.3: 23-45. http://doi.org/10.4018/IJSIR.2019070102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

The graph coloring problem (GCP) is one of the most interesting classical combinatorial optimization problems in graph theory. It is known to be an NP-Hard problem, so many heuristic algorithms have been employed to solve this problem. In this article, the authors propose a new enhanced binary dragonfly algorithm to solve the graph coloring problem. The binary dragonfly algorithm has been enhanced by introducing two modifications. First, the authors use the Gaussian distribution random selection method for choosing the right value of the inertia weight w used to update the step vector (∆X). Second, the authors adopt chaotic maps to determine the random parameters s, a, c, f, and e. The aim of these modifications is to improve the performance and the efficiency of the binary dragonfly algorithm and ensure the diversity of solutions. The authors consider the well-known DIMACS benchmark graph coloring instances to evaluate the performance of their algorithm. The simulation results reveal the effectiveness and the successfulness of the proposed algorithm in comparison with some well-known algorithms in the literature.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.