Solving of school bus routing problem by ant colony optimization
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...
- Autores:
-
Arias-Rojas, Juan S.
Jiménez-Gordillo, J. F. (José Fernando)
Montoya-Torres, J. R. (Jairo Rafael)
- Tipo de recurso:
- Article of journal
- Fecha de publicación:
- 2011
- Institución:
- Universidad EIA .
- Repositorio:
- Repositorio EIA .
- Idioma:
- eng
- OAI Identifier:
- oai:repository.eia.edu.co:11190/137
- Acceso en línea:
- https://repository.eia.edu.co/handle/11190/137
- Palabra clave:
- REI00186
HEURÍSTICA
HEURISTIC
INFRAESTRUCTURA Y GESTIÓN DEL TERRITORIO
INFRAESTRUCTURE AND LAND PLANNING
SCHOOL BUS
ROUTING
ANT COLONY
CASE STUDY
BUSES ESCOLARES
RUTEO
COLONIA DE HORMIGAS
ESTUDIO DE CASO
- Rights
- openAccess
- License
- Derechos Reservados - Universidad EIA, 2020
| Summary: | 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. |
|---|