In this work, a special type of the travelling salesman problem (TSP), namely the clustered TSP (CTSP), is addressed. In the CTSP, the cities are already divided into clusters and the salesman seeks to find the shortest tour through all the cities which includes each city exactly once while being restricted to visit the cities of each cluster contiguously. Due to the NP-hardness of the focused problem, a hybrid metaheuristic consisting of the artificial bee colony (ABC) and the tabu search (TS) algorithm is proposed to deal with it. The results of our solution approach on two sets of benchmark instances are presented and compared with those of two other methods from the literature.