A hybrid artificial bee colony algorithm for graph 3-coloring

Authors:
Iztok Fister;Iztok Fister;Janez Brest
Affiliations:
Faculty of Electrical Engineering and Computer Science, University of Maribor, Maribor, Slovenia;Faculty of Electrical Engineering and Computer Science, University of Maribor, Maribor, Slovenia;Faculty of Electrical Engineering and Computer Science, University of Maribor, Maribor, Slovenia
Venue:
SIDE'12 Proceedings of the 2012 international conference on Swarm and Evolutionary Computation
Year:
2012

Citing 17
Cited 0

Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
Using tabu search techniques for graph coloring

Computing
Almost all k-colorable graphs are easy to color

Journal of Algorithms
A randomised 3-colouring algorithm

Discrete Mathematics - Graph colouring and variations
New methods to color the vertices of a graph

Communications of the ACM
Local Search in Combinatorial Optimization

Local Search in Combinatorial Optimization
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Graph Coloring with Adaptive Evolutionary Algorithms

Journal of Heuristics
Introduction to Evolutionary Computing

Introduction to Evolutionary Computing
Ant Colony Optimization

Ant Colony Optimization
A survey of local search methods for graph coloring

Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Graph Theory

Graph Theory
Nature-Inspired Metaheuristic Algorithms

Nature-Inspired Metaheuristic Algorithms
Where the really hard problems are

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
A survey: algorithms simulating bee swarm intelligence

Artificial Intelligence Review
A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem

Information Sciences: an International Journal
A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Artificial Bee Colony (ABC) is the name of an optimization algorithm that was inspired by the intelligent behavior of a honey bee swarm. It is widely recognized as a quick, reliable, and efficient methods for solving optimization problems. This paper proposes a hybrid ABC (HABC) algorithm for graph 3-coloring, which is a well-known discrete optimization problem. The results of HABC are compared with results of the well-known graph coloring algorithms of today, i.e., the Tabucol and Hybrid Evolutionary algorithm (HEA), and results of the traditional evolutionary algorithm with SAW method (EA-SAW). Extensive experimentations has shown that the HABC matched the competitive results of the best graph coloring algorithms, and did better than the traditional heuristics EA-SAW when solving equi-partite, flat, and random generated medium-sized graphs.