In this paper we introduce a new algorithm to find a approximate solution for cyclic bandwidth sum problem (CBSP). This problem consists in a minimization of the sum of the distances in the numbering between pairs of vertices connected by a edge. A method based on a depth-first search is proposed where the order in which the nodes are traversed depends on a criterion based on the the Jaccard index between the current node and its neighbors. This method is faster and more effective than the other available heuristics.