School transport is a fundamental part for students to have access to school and if trained in addition to citizens, in excellent trained professionals. Having observed and analyzed the problems that occur in school transport. Then, the scholars described the school bus routing problem (PROE), which consists of minimizing the operating costs of school transport, with the objective of finding the best routes for the fleet of vehicles. thereby, vehicles can travel and transport students from bus stops to their schools. To the end of the school day, students are transported from the school to the points where they were collected. In of PROE literature, work with models mathematical and restrictions, are applied to solve problems and get close of something applicable in real life and to seek improvements in school transport. However, this work aims to study and develop a methodology to solve a hypothetical scenario, in which the school transport routes will be minimized with a meta-heuristic method Adaptive Large Neighborhood Search (ALNS). To minimize school transport operating costs, 8 schools, the random bus routes and stops and the garage where the school bus is parked were separated. Thus, generating efficient routes so that only one bus can serve its specific route to the school. In this work, an area was delimited to obtain the information from the 3D map of the city of Palmas, TO. The methodology will tell with all the procedures for the solution following adaptations of the steps described in the already established literature on the PROE. Then, the results will be presented with the plot of the new resulting routes, with analysis and observation of this work.
|
