Abstract: This research proposes a scatter search metaheuristic approach for solving Team Orienteering Problem. The goal is to build a particular number of routes that visit some points to maximize the sum of the score while the route’s length does not exceeding the time budget. The approach is compared to other state-of-art approaches and tested using a large set of test instances from the literature. The obtained results are competitive comparing the best known results of these heuristics but the computational time is reduced significantly.