IDEAS home Printed from https://ideas.repec.org/a/igg/jaec00/v5y2014i3p42-56.html
   My bibliography  Save this article

A Binary Cuckoo Search Algorithm for Graph Coloring Problem

Author

Listed:
  • Halima Djelloul

    (MISC Laboratory, Constantine 2 University, Constantine, Algeria)

  • Abdesslem Layeb

    (MISC Laboratory, Constantine 2 University, Constantine, Algeria)

  • Salim Chikhi

    (MISC Laboratory, Constantine 2 University, Constantine, Algeria)

Abstract

The Graph Coloring Problem (GCP) is one of the most interesting, studied, and difficult combinatorial optimization problems. That is why several approaches were developed for solving this problem, including exact approaches, heuristic approaches, metaheuristics, and hybrid approaches. This paper tries to solve the graph coloring problem using a discrete binary version of cuckoo search algorithm. To show the feasibility and the effectiveness of the algorithm, it has used the standard DIMACS benchmark, and the obtained results are very encouraging.

Suggested Citation

  • Halima Djelloul & Abdesslem Layeb & Salim Chikhi, 2014. "A Binary Cuckoo Search Algorithm for Graph Coloring Problem," International Journal of Applied Evolutionary Computation (IJAEC), IGI Global, vol. 5(3), pages 42-56, July.
    • Handle: RePEc:igg:jaec00:v:5:y:2014:i:3:p:42-56
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijaec.2014070103
    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:jaec00:v:5:y:2014:i:3:p:42-56. 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.