en
Proceedings chapter
Open access
French

Ants cannot color graphs

ContributorsZufferey, Nicolasorcid
Presented at Geneva (Switzerland), 22-23 mars 2018
Publication date2018
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 algorithms
  • combinatorial optimization
  • graph coloring
Citation (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.
Main files (1)
Proceedings chapter (Accepted version)
accessLevelPublic
Identifiers
  • PID : unige:104577
358views
77downloads

Technical informations

Creation05/22/2018 9:45:00 AM
First validation05/22/2018 9:45:00 AM
Update time03/15/2023 8:13:56 AM
Status update03/15/2023 8:13:55 AM
Last indexation05/02/2024 8:11:37 PM
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack