UNIGE document Chapitre d'actes
previous document  unige:26180  next document
add to browser collection
Title

A New Ant Algorithm for Graph Coloring

Authors
Hertz, Alain
Published in Proceedings of the Workshop on Nature Inspired Cooperative Strategies for Optimization. Granada (Spain). 2006
Abstract Let G = (V;E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, ..., k}) to each vertex of V so that no edge has both endpoints with the same color. We describe in this paper a new ant algorithm for the k-coloring problem. Computational experiments give evidence that our algorithm is competitive with the existing ant algorithms for this problem, while giving a minor role to each ant. Our algorithm is however not competitive with the best known coloring algorithms.
Full text
Proceedings chapter (Published version) (128 Kb) - private document Private access
Structures
Citation
(ISO format)
HERTZ, Alain, ZUFFEREY, Nicolas. A New Ant Algorithm for Graph Coloring. In: Proceedings of the Workshop on Nature Inspired Cooperative Strategies for Optimization. Granada (Spain). [s.l.] : [s.n.], 2006. https://archive-ouverte.unige.ch/unige:26180

195 hits

0 download

Update

Deposited on : 2013-02-04

Export document
Format :
Citation style :