Welcome to the InfoSci Platform
Reference Hub5
A Binary Cuckoo Search Algorithm for Graph Coloring Problem

A Binary Cuckoo Search Algorithm for Graph Coloring Problem

Halima Djelloul, Abdesslem Layeb, Salim Chikhi
Copyright: © 2014 |Volume: 5 |Issue: 3 |Pages: 15
ISSN: 1942-3594|EISSN: 1942-3608|EISBN13: 9781466652415|DOI: 10.4018/ijaec.2014070103
Cite Article Cite Article

MLA

Djelloul, Halima, et al. "A Binary Cuckoo Search Algorithm for Graph Coloring Problem." IJAEC vol.5, no.3 2014: pp.42-56. http://doi.org/10.4018/ijaec.2014070103

APA

Djelloul, H., Layeb, A., & Chikhi, S. (2014). A Binary Cuckoo Search Algorithm for Graph Coloring Problem. International Journal of Applied Evolutionary Computation (IJAEC), 5(3), 42-56. http://doi.org/10.4018/ijaec.2014070103

Chicago

Djelloul, Halima, Abdesslem Layeb, and Salim Chikhi. "A Binary Cuckoo Search Algorithm for Graph Coloring Problem," International Journal of Applied Evolutionary Computation (IJAEC) 5, no.3: 42-56. http://doi.org/10.4018/ijaec.2014070103

Export Reference

Mendeley
Favorite Full-Issue Download

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.

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.