Parallel immune system for graph coloring

Authors:
Jacek Dabrowski
Affiliations:
Gdańsk University of Technology, Gdańsk, Poland
Venue:
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Year:
2008

Citing 5
Cited 0

Using tabu search techniques for graph coloring

Computing
New methods to color the vertices of a graph

Communications of the ACM
A hybrid immune algorithm with information gain for the graph coloring problem

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Applying the clonal selection principle to find flexible job-shop schedules

ICARIS'05 Proceedings of the 4th international conference on Artificial Immune Systems
Learning and optimization using the clonal selection principle

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a parallel artificial immune system designed for graph coloring. The algorithm is based on the clonal selection principle. Each processor operates on its own pool of antibodies and a migration mechanism is used to allow processors to exchange information. Experimental results show that migration improves the performance of the algorithm. The experiments were performed using a high performance cluster on a set of well-established graph instances available on the Web.