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

Ants cannot color graphs

Published in Proceedings of the 19th eu/me workshop on metaheuristics for industry. Geneva (Switzerland) - 22-23 mars 2018 - . 2018
Abstract Ant colony optimizationwas born in 1991. Fromthat date, ant algorithms have been applied to numerous problems. One of its most famous adaptations was for graph coloring in 1997, resulting in an inspiring publication entitled ”Ants can color graphs” and citedmore than 700 times [3]. In this paper, with a certain sense of humor reflected in its title, it is showed that actually, 20 years later, ants cannot color graphs. Tis fact is explained in the light of two weaknesses of the usual ant methodology when making decisions, namely a cumbersome computation and the joint consideration of conflicting ingredients. A reconciliation of these contradictory statements relies in the enlargement of the ant optimization paradigm.
Keywords ant algorithmscombinatorial optimizationgraph coloring
Full text
(ISO format)
ZUFFEREY, Nicolas. Ants cannot color graphs. In: Proceedings of the 19th EU/ME Workshop on Metaheuristics for Industry. Geneva (Switzerland). [s.l.] : [s.n.], 2018. https://archive-ouverte.unige.ch/unige:104577

188 hits



Deposited on : 2018-05-22

Export document
Format :
Citation style :