Javier Ozón, Departament de Matematica Aplicada i Telematica, Universitat Politecnica de Catalunya, C/ Jordi Girona 1-3, Campus Nord C3, 08034 Barcelona, Spain
This paper describes an ant algorithm that colours graphs in an efficient way. First, we describe the graph colouring problem and the ant algorithm. We also present some results and propose a simple generalisation of the algorithm that might allow its application to other assignment problems. Finally, a short study of the algorithm operators explains its performance and shows that it may be seen as a parallel variation of tabu search, with an implicit memory instead of an avoidance list.