SOLVING OF SCHOOL BUS ROUTING PROBLEM BY ANT COLONY OPTIMIZATION (RESOLUCIÓN DEL PROBLEMA DE RUTEO DE BUSES ESCOLARES CON OPTIMIZACIÓN POR COLONIA DE HORMIGAS)
SOLVING OF SCHOOL BUS ROUTING PROBLEM BY ANT COLONY OPTIMIZATION (RESOLUCIÓN DEL PROBLEMA DE RUTEO DE BUSES ESCOLARES CON OPTIMIZACIÓN POR COLONIA DE HORMIGAS)
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Copyright statement
The authors exclusively assign to the Universidad EIA, with the power to assign to third parties, all the exploitation rights that derive from the works that are accepted for publication in the Revista EIA, as well as in any product derived from it and, in in particular, those of reproduction, distribution, public communication (including interactive making available) and transformation (including adaptation, modification and, where appropriate, translation), for all types of exploitation (by way of example and not limitation : in paper, electronic, online, computer or audiovisual format, as well as in any other format, even for promotional or advertising purposes and / or for the production of derivative products), for a worldwide territorial scope and for the entire duration of the rights provided for in the current published text of the Intellectual Property Law. This assignment will be made by the authors without the right to any type of remuneration or compensation.
Consequently, the author may not publish or disseminate the works that are selected for publication in the Revista EIA, neither totally nor partially, nor authorize their publication to third parties, without the prior express authorization, requested and granted in writing, from the Univeridad EIA.
Show authors biography
The school bus routing problem (SBRP) seeks to plan an efficient schedule of a fleet of school buses that
must pick up students from various bus stops and deliver them by satisfying various constraints: maximum capacity of the bus, maximum riding time of students, time window to arrive to school. In this paper, we consider a case study of SBRP for a school in Bogotá, Colombia. The problem is solved using ant colony optimization (ACO). Computational experiments are performed using real data. Results lead to increased bus utilization and reduction in transportation times with on-time delivery to the school. The proposed decision-aid tool has shown its usefulness for actual decision-making at the school: it outperforms current routing by reducing the total distance traveled by 8.3 % and 21.4 % respectively in the morning and in the afternoon.
Resumen: El problema de ruteo de buses escolares (SBRP) busca encontrar el programa más eficiente para una flota de buses escolares que deben recoger y despachar estudiantes en varias paradas de bus satisfaciendo varias restricciones: capacidad máxima del bus, máximo tiempo de recorrido de los estudiantes, ventanas de tiempo para la llegada al colegio. En este artículo se considera un caso de estudio de un problema SBRP para un colegio en Bogotá, Colombia. El problema se resuelve usando la metaheurística de colonia de hormigas (ACO). Los experimentos computacionales se realizan empleando datos reales. Los resultados muestran el incremento en el nivel de utilización de los buses y una reducción en los tiempos de transporte con despacho a tiempo en el colegio. La herramienta ha mostrado su utilidad para la planeación regular de buses en el colegio: se redujo la distancia total recorrida en 8,3 % en la mañana y en 21,4 % en la tarde.
Article visits 260 | PDF visits 217
