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)
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 reduc... Ver más
1794-1237
2463-0950
9
2013-11-07
193
208
Revista EIA - 2013
Esta obra está bajo una licencia internacional Creative Commons Atribución-NoComercial-SinDerivadas 4.0.
info:eu-repo/semantics/openAccess
http://purl.org/coar/access_right/c_abf2
