IDEAS home Printed from https://ideas.repec.org/a/igg/jsir00/v10y2019i3p23-45.html
   My bibliography  Save this article

Solving Graph Coloring Problem Using an Enhanced Binary Dragonfly Algorithm

Author

Listed:
  • Karim Baiche

    (Applied Automation Laboratory, University of MHamed Bougara Boumerdes, Boumerdes, Algeria)

  • Yassine Meraihi

    (Department of Automation, Applied Automation Laboratory, University of M'Hamed Bougara Boumerdes, Boumerdes, Algeria)

  • Manolo Dulva Hina

    (ECE Paris School of Engineering, Paris, France)

  • Amar Ramdane-Cherif

    (LISV Laboratory, University of Versailles St-Quentin-en-Yvelines, Versailles, France)

  • Mohammed Mahseur

    (University of Sciences and Technology Houari Boumediene, Bab Ezzouar, Algeria)

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.

Suggested Citation

  • Karim Baiche & Yassine Meraihi & Manolo Dulva Hina & Amar Ramdane-Cherif & Mohammed Mahseur, 2019. "Solving Graph Coloring Problem Using an Enhanced Binary Dragonfly Algorithm," International Journal of Swarm Intelligence Research (IJSIR), IGI Global, vol. 10(3), pages 23-45, July.
    • Handle: RePEc:igg:jsir00:v:10:y:2019:i:3:p:23-45
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJSIR.2019070102
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jsir00:v:10:y:2019:i:3:p:23-45. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.