Binary bat algorithm for graph coloring problem

Halima Djelloul; Sara Sabba; Salim Chıkhı

doi:10.1109/icocs.2014.7060988

ScienceGate Book Chapters

JOURNAL ARTICLE

Binary bat algorithm for graph coloring problem

Halima Djelloul Sara Sabba Salim Chıkhı

Year: 2014 Vol: 156 Pages: 481-486

DOI: 10.1109/icocs.2014.7060988

Get Full-Text PDF Get Analytical Report

Abstract

Bat algorithm (BA) is one of the most recent bio-inspired algorithm. It is based on the echolocation behavior of microbats. The standard BA is proposed only for continuous optimization problems. In this paper, we try to solve the graph coloring problem using a binary bat algorithm. To show the feasibility and the effectiveness of the algorithm, we have used the DIMACS benchmark, and the obtained results are very encouraging.

Keywords:

Human echolocation Graph coloring Computer science Benchmark (surveying) Algorithm Binary number Bat algorithm Graph Mathematical optimization Theoretical computer science Mathematics

Metrics

Cited By

0.48

FWCI (Field Weighted Citation Impact)

Refs

0.79

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Metaheuristic Optimization Algorithms Research

Physical Sciences → Computer Science → Artificial Intelligence

Advanced Multi-Objective Optimization Algorithms

Physical Sciences → Computer Science → Computational Theory and Mathematics

Scheduling and Timetabling Solutions

Social Sciences → Decision Sciences → Management Science and Operations Research

Binary bat algorithm for graph coloring problem

Abstract

Metrics

Citation History

Topics

Related Documents

A Binary Cuckoo Search Algorithm for Graph Coloring Problem

Solving Graph Coloring Problem Using an Enhanced Binary Dragonfly Algorithm

Efficient and Robust Graph Coloring Algorithm for Graph Coloring Problem: Malatya Vertex Coloring Algorithm

A Modified Binary Crow Search Algorithm for Solving the Graph Coloring Problem

A Chaotic Binary Salp Swarm Algorithm for Solving the Graph Coloring Problem