A Binary Cuckoo Search Algorithm for Graph Coloring Problem

Halima Djelloul, Abdesslem Layeb and Salim Chikhi
Additional contact information
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

International Journal of Applied Evolutionary Computation (IJAEC), 2014, vol. 5, issue 3, 42-56

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.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 018/ijaec.2014070103 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jaec00:v:5:y:2014:i:3:p:42-56

Access Statistics for this article

International Journal of Applied Evolutionary Computation (IJAEC) is currently edited by Sukhpal Singh Gill

More articles in International Journal of Applied Evolutionary Computation (IJAEC) from IGI Global
Bibliographic data for series maintained by Journal Editor ().