This paper presents a problem of determining the routes of a fleet of vehicles capable of transporting passengers / employees of a mining company. For this purpose fifteen instances of problem were created that simulated the reality because it passes the company. This problem fits into the School Bus Routing Problem (SBRP). As a solution to the created instances of the problem, the Variable Neighborhood Search (VNS) heuristic was used. Three different neighborhood types were used, distributed in fifteen different configurations to calculate the configuration that returned the best solutions to the problem. This calculation was done with statistical comparison, being one of the configurations presenting the best performance.