The Modularity Maximization has the aim to seek the best set of communities for Biological and Social purposes. This optimization problem is NP-Hard, so there are several works reporting heuristics solvers. The main subject of research reported in this paper is to compare important metaheuristics. In previous analyses, the Tabu Search with random duration in tabu list, have presented the best quality and time results.