Publication:
Cooperation strategies featuring optimization in the school transportation system in Bogota

Thumbnail Image
Files

Files

Cooperation strategies featuring optimization in the school transportation system in Bogota.pdf (746.86 KB)
View Statistics
Reference Managers
Mendeley
Indexers
Google Scholar CORE
QR Code
QR Code
Authors

Authors

Rodríguez Parra, German Ricardo
Guerrero, William J.
Sarmiento Lepesqueur, Angélica
Abstract (Spanish)
El transporte de estudiantes tiene desafíos importantes en el caso de la ciudad de Bogotá, donde un grupo de escuelas se encuentra en una zona, pero sólo hay una carretera que las conecta con zonas residenciales. Por lo tanto, la congestión del tráfico es alta, generando largos tiempos de viaje, altos costos de operación y problemas de movilidad. Se estudia el impacto de una estrategia cooperativa entre operadores logísticos a través de modelos de programación de entera mixta, para encontrar el diseño óptimo de rutas escolares en una red con la topología que describe el mencionado sistema vial. Se comparan dos estrategias: Cargas mixtas y carga única, donde los estudiantes de diferentes escuelas comparten o no los autobuses disponibles. El objetivo es minimizar los costos totales de operación respetando las ventanas de tiempo de las escuelas. Se presentan los resultados comparativos de los modelos usando enfoques exactos y heurísticos.
Abstract (English)
The transport of students presents important challenges in the case of the city of Bogota, where an important cluster of schools is located in one zone, but there is only one road connecting these schools to residential zones. Thus, traffic congestion is high, generating long travel times for students, high operational costs, and mobility problems. This paper studies the impacts of a cooperative strategy between logistics operators using a mixed integer programming mathematical model, to find the optimal design of school routes on a network with the topology that describes the aforementioned road system. Two strategies are compared: a mixed loads strategy, where students from different schools share buses; and a single load strategy, where students from different schools cannot share buses. The objective is to minimize the total operational costs while satisfying the schools’ time windows. Comparative results of the two models using exact and heuristic approaches are presented.
Extent
11 páginas
URI: https://repositorio.escuelaing.edu.co/handle/001/1614
Collections

Collections

AI - Centro de Investigación en Manufactura y Servicios – CIMSER
References

Mollinedo, C. L., Movilidad Urbana Sostenible: Un reto para las ciudades del siglo XXI, Economía, Sociedad y Territorio, 6(22), pp. 1-35, 2006.

Jaramillo-Molina, C., Ríos-Rivera, P.A. and Ortiz-Lasprilla, A.R., Incremento del parque automotor y su influencia en la congestión de las principales ciudades colombianas, Universidad del Valle, Cali, Colombia, 2009.

Newton, R. and Thomas, W., Design of school bus routes by computer. Socio-Economic Planning Sciences, 3(1), pp. 75-85, 1969. DOI: 10.1016/0038-0121(69)90051-2

Park, J. and Kim, B.I., The school bus routing problem: A review. European Journal of Operational Research, 202(2), pp. 311-319, 2010. DOI: 10.1016/j.ejor.2009.05.017

Redacción Bogota, Este lunes arranca en firme carril exclusivo para rutas escolares en el norte de Bogota, EL ESPECTADOR, [en línea]. [Consultado: 16 de enero de 2017]. Disponible en: http://www.elespectador.com/noticias/bogota/lunes-arranca-firme-carril-exclusivo-rutas-escolares-el-articulo-674911.

Lu, M., Sun, C. and Zheng, S., Congestion and pollution consequences of driving-to-school trips: A case study in beijing, Transportation Research, 50, pp. 280-291, 2016. DOI: 10.1016/j.trd.2016.10.023

Kelly, J.A. and Fu, M., Sustainable school commuting – Understanding choices and identifying opportunities: A case study in Dublin, Ireland, Journal of Transport Geography, 34, pp. 221-230, 2014. DOI: 10.1016/j.jtrangeo.2013.12.010

McDonald, N.C., Steiner, R.L., Palmer, W.M., Bullock, A.N., Sisiopiku, V.P. and Lytle, B.F., Costs of school transportation: Quantifying the fiscal impacts of encouraging walking and bicycling for school travel. Transportation, 43(1), pp. 159-175, 2016. DOI: 10.1007/s11116-014-9569-7

Bodin, L.B.L., Routing and scheduling of school buses by computer. Transportation Science, 13(2), pp. 113-129, 1979. DOI: 10.1287/trsc.13.2.113

Braca, J., Bramel, J., Posner,B. and Simchi-Levi., D., A computerized approach to the New York city school bus routing problem, IIE Transactions, 29, pp. 693-702, 1997. DOI: 10.1287/trsc.13.2.113

Montoya-Torres, J.R., López-Franco, J., Nieto-Isaza, S., Felizzola-Jiménez H .and Herazo-Padilla, N., A literature review on the vehicle routing problem with multiple depots, Computers & Industrial Engineering, 79, pp. 115-129, 2015. DOI: 10.1016/j.cie.2014.10.029

Liu, R., Jiang, Z. and Geng, N., A hybrid genetic algorithm for the multi-depot open vehicle routing problem, OR Spektrum, 36(2), pp. 401-421, 2014. DOI: 10.1007/s00291-013-0346-3

Lalla-Ruiz, E., Expósito-Izquierdo, C., Taheripour S. and Voß, S., An improved formulation for the multi-depot open vehicle routing problem, OR Spektrum, 38(1), pp. 1-13, 2015. DOI: 10.1007/s00291-015-0408-9

Schittekat, P., Kinable, J., Sörensen, K., Sevaux M. and Spieksma, F., A metaheuristic for the school bus routing problem with bus stop selection, European Journ al of Operational Research, (2), pp. 518-528, 2013. DOI: 10.1016/j.ejor.2013.02.025

Manumbu, D.M., Mujuni, E. and Kuznetsov, D., Mathematical formulation model for a school bus routing problem with small instance data, Mathematical Theory and Modeling, 4(8), pp. 121-132, 2014.

Thangiah, S.R., Fergany, A., Wilson, B., Pitluga, A. and Mennell, W., School bus routing in rural school districts, Lecture Notes in Economics and Mathematical Systems, 600, pp. 209-232, 2008. DOI: 10.1007/978-3-540-73312-6_11

Euchi, J. and Mraihi, R., The urban bus routing problem in the Tunisian Case by the hybrid artificial ant colony algorithm, Swarm and Evolutionary Computation, 2, pp. 15-24, 2011. DOI: 10.1016/j.swevo.2011.10.002

Riera-Ledesma, J. and Salazar-González, J.J., Solving school bus routing using the multiple vehicle traveling purchaser problem: A branch-and-cut approach, Computers & Operations Research, 39(2), pp. 391-404, 2012. DOI: 10.1016/j.cor.2011.04.015

Zhang, J.J. and Li, Y.G., School bus problem and its algorithm, IERI Procedia, 2, pp. 8-11, 2012. DOI: 10.1016/j.ieri.2012.06.043

Arias-Rojas, J.S., Jiménez, J.F. and Montoya-Torres, J.R., Solving of school bus routing problem by ant colony optimization, Revista EIA, Escuela de Ingeniería de Antioquia, Medellín (Colombia), 17, pp. 193-208, 2012.

Park, J., Tae, H. and Kim, B.I., A Post-improvement procedure for the mixed load school bus routing problem. European Journal of Operational Research, 217(1), pp. 204-213, 2012. DOI: 10.1016/j.ejor.2011.08.022

Ellegood, W.A., Campbell, J.F. and North, J., Continuous approximation models for mixed load school bus routing, Transportation Research, Part B(77), pp. 182-198, 2015. DOI: 10.1016/j.trb.2015.03.018

Yin, P.Y., Lyu S.R. and Chuang, Y.L., Cooperative coevolutionary approach for integrated vehicle routing and scheduling using cross-dock buffering. Engineering Applications of Artificial Intelligence, 52, pp. 40-53, 2016. DOI: 10.1016/j.engappai.2016.02.006

Vahdani, B. and Zandieh, M., Scheduling trucks in Cross-Docking systems: Robust meta-heuristics. Computers & Industrial Engineering, 58(1), pp. 12-24, 2010. DOI: 10.1016/j.cie.2009.06.006

Min, H., The multiple vehicle routing problem with simultaneous delivery and pick-up points, Transportation Research Part A: General, pp. 377-386, 1989. DOI: 10.1016/0191-2607(89)90085-X

Sarmiento-Lepesqueur, A. y Quintero-Araujo, C.L., Estudio del problema de ruteo de vehículos con balance de carga: Aplicación de la meta-heurística Búsqueda Tabú, Tesis Maestría Gerencia de Operaciones, Universidad de la Sabana, Bogotá, Colombia, 2014.

Guerrero, W.J., Velasco, N., Prodhon, C. and Amaya, C.A., On the generalized elementary shortest path problem: A heuristic approach. Electronic Notes in Discrete Mathematics, 41, pp. 503-510, 2013. DOI: 10.1016/j.endm.2013.05.131