Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)Arias Osorio, Javier EduardoBustos Gutierrez, MaribelPinilla Cifuentes, Astrid Carolina2024-03-0320162024-03-0320162016https://noesis.uis.edu.co/handle/20.500.14071/34780Este trabajo se expone en tres capítulos. En el primero, se muestran las definiciones y ejemplos más importantes para nuestro trabajo, además del estudio de herramientas básicas para la construcción de continuos, como lo son la intersección anidada de continuos, el producto numerable de continuos, el límite inverso de una sucesión inversa de continuos, y una breve exposición sobre la descomposición de continuos.application/pdfspahttp://creativecommons.org/licenses/by/4.0/Problema De Rutas Escolares (Sbrp)Selección De ParadasProblema De Ruteo De Vehículos (Vrp)Ramificación Y AcotamientoMetaheurísticaBúsqueda Tabú.Universidad Industrial de SantanderTesis/Trabajo de grado - Monografía - PregradoUniversidad Industrial de Santanderhttps://noesis.uis.edu.coSchool bus routing problem (SBRP)consists in finding one or more routes on a network of bus stopswith known origin and common destinywhere every student must be assigned to one of theselater each bus to visit those stops according to the route drawn on the network and transfer the students to school. The objective of this research is to solve the problem of school routes using a model of binary integer linear programmingin which seeks to minimize the subset of selected stopsto which students are assignedas long as they comply with the allowed distance to walk to a stopand then develop a series of routes that minimize the total distance traveled by all buses. The solution SBRP will through exact methods with the algorithm branch and boundand by methods approximate the development of a system based on metaheuristic Tabu Search algorithm whose initial solution is provided through the algorithm savings Clarke and Wright. The results obtained by the algorithmfinally were compared with those calculated by the exact methodin order to test the efficiency and effectiveness of the algorithm developed. This comparison showed thatfor instances evaluatedthe algorithm presented a maximum difference of 105% compared to the optimal solutionbut that is offset by a faster computational time 997%.info:eu-repo/semantics/openAccessAtribución-NoComercial-SinDerivadas 4.0 Internacional (CC BY-NC-ND 4.0)