On transitions in the behaviour of tabu search algorithm TabuCol for graph colouring

Abstract

Even though tabu search is one of the most popular metaheuristic search strategies, its understanding in terms of behavioural transitions and parameter tuning is still very limited. In this paper, we present a theoretical and experimental study of a popular tabu search algorithm TabuCol for graph colouring. We show that for some instances, there are sharp transitions in the behaviour of TabuCol, depending on the value of tabu tenure parameter. The location of this transition depends on graph structure and may also depend on its size. This is further supported by an experimental study of success rate profiles, which we define as an empirical measure of these transitions. We study the success rate profiles for a range of graph colouring instances, from 2-colouring of trees and forests to several instances from the DIMACS benchmark. These reveal that TabuCol may exhibit a spectrum of different behaviours ranging from simple transitions to highly complex probabilistic behaviour.

Keywords:

• Tabu search
• TabuCol
• transitions
• graph colouring
• algorithm analysis

Acknowledgements

The experiments presented in this paper were conducted using the Viper high performance computer of the University of Hull.

Notes

No potential conflict of interest was reported by the author.