The School Bus Routing Problem (SBRP) deals with planning the routes of a fleet of vehicles to move the students from boarding points to their respective schools. The SBRP is a special case of Vehicle Routing Problem (VRP) and is known to be an NP-hard problem. Most of the SBRP literature focuses, mainly, on mathematical models to solve the routing problem by applying real-life restrictions. Regarding the geocoding of the addresses of schools and students, as well as the search for distances and times of real displacements, are also points of vital importance, since the actual distances differ from the euclidean and geodesic ones mainly in rural areas, study region this work. In this context, a methodology is proposed for the problem, along with a prototype to automate the procedures required to obtain information, whose application, based on a real scenario in the Brazilian context is presented, divided into eight phases: to define scope, to geocode the address of schools, student and boarding points, to define the characteristics, to calculate the distance and travel time, to set the georeferenced database and vehicles, to apply a tool to obtain the routes, to geospatialize the routes and elaborate diagnosis. The proposal is tested by applying a tool to obtain routes using the Adaptive Large Neighborhood Search (ALNS) meta-heuristic to solve VRP instances. Thus, one of the contributions of the study consists in the georeferencing of the state school units, with the information present in the Google Maps platform for public viewing. In the study, 150 students from 7 school units in the city of Nova Friburgo were located. The result presents consistent and satisfactory values, demonstrating savings of 41.62 percent in the costs practiced on th routes.