Show simple item record

dc.contributor.advisorGuerrero, William
dc.contributor.advisorReyes Rubiano, Lorena Silvana
dc.contributor.authorBarón Aristizábal, María Carolina
dc.date.accessioned2018-06-25T17:08:26Z
dc.date.available2018-06-25T17:08:26Z
dc.date.issued2018
dc.identifier.citationAdelman, D. (2004). A price-directed approach to stochastic inventory/routing. Operations Research, 52(4), 499–514.
dc.identifier.citationBhattacharyya, K. & Guiffrida, A.L. (2015). An optimization framework for improving supplier delivery performance. Applied Mathematical Modelling, 39, 3771–3783.
dc.identifier.citationBravo, J.J. & Vidal, C. J. (2013). Freight transportation function in supply chain optimization models: A critical review of recent trends. Expert Systems with Applications, 40, 6742-6757.
dc.identifier.citationCampbell, A. M., & Savelsbergh, M. W. P. (2004). A decomposition approach for the inventoryrouting problem. Transportation Science, 38(4), 488–502.
dc.identifier.citationGeunes, J., Retsef, L., Romeijn, H.E., & Shmoys D.B. (2011). Approximation algorithms for supply chain planning and logistics problems with market choice. Mathematical Progamming, 130, 85- 106.
dc.identifier.citationGuo, H., Wang, X. & Zhou, S. (2015). A Transportation Problem with Uncertain Costs and Random Supplies. International Journal of e-Navigation and Maritime Economy, 2, 1 – 11.
dc.identifier.citationLi, J., Chu, F., & Chen, H. (2011). Coordination of split deliveries in one-warehouse multi-retailer. Computers & Industrial Engineering, 60, 291–301.
dc.identifier.citationRivera, J.C., Afsara, M., & Prins, C. (2016). Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem. European Journal of Operational Research, 249, 93-104.
dc.identifier.citationKe, L., & Feng, Z. (2013). A two-phase metaheuristic for the cumulative capacitated vehicle routing problem. Computers & Operations Research, 40, 633-638.
dc.identifier.citationRostami, M., Kheirandish, O., & Ansari, N. (2015). Minimizing maximum tardiness and delivery costs with batch. Applied Mathematical Modelling, 39, 4909–4927.
dc.identifier.citationPérez, E., & Guerrero, W.J. (2015). Métodos de optimización para el problema de ruteo de vehículos con inventarios y ventanas de tiempo duras. Revista Ingeniería Industrial, 14(3), 31- 49.
dc.identifier.citationShangyao, Y., James, C., Chu, B., Yen, F., & Huang, H., (2015). A planning model and solution algorithm for multi-trip split-delivery. Computers & Industrial Engineering, 87, 383–393.
dc.identifier.citationWei, S.D, Wang, H., & Zhao, H.H. (2014). A two-stage optimization algorithm of logistics transportation network. Algorithm of logistics transportation network. , 511 - 512, 886-891.
dc.identifier.citationWang, Y., Lei, X., Lao, Y., Yan, H., & Liu, H.Y. (2014). A two-stage heuristic method for vehicle routing problem with. Journal of Zhejiang University-SCIENCE C (Computers & Electronics), 15(3), 200-210
dc.identifier.citationNgueveu, S. U., Prins, C., & Calvo, R. W. (2010). An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Computers & Operations Research, 37(11), 1877-1885.
dc.identifier.citationLi, F., Golden, B., &Wasil, E., (October 2007). The open vehicle routing problem: Algorithms, large-scale test problems, and computational results. Computers & Operations Research, 34, 2918–2930.
dc.identifier.citationGarcia, A., Jodrá, P., & Tejel, Javier. (2002). A note on the traveling repairman problem. Networks, 40, 27 - 31.
dc.identifier.urihttp://hdl.handle.net/10818/33214
dc.description43 Páginases_CO
dc.description.abstractEl desarrollo de esta investigación propone un modelo matemático de optimización capaz de generar en un proceso futuro una herramienta de apoyo para la toma de decisiones para la coordinación de despachos de transformadores de distribución para una empresa colombiana, esperando que estas representen una disminución significativa de los tiempos de entrega, con un control adecuado de los costos de la operación principalmente. El objeto de estudio está restringido a los despachos que solicitan los clientes en Colombia para entregas a lo largo del territorio nacional.es_CO
dc.formattext/plaines_CO
dc.language.isospaes_CO
dc.publisherUniversidad de La Sabanaes_CO
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 International*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.sourceUniversidad de La Sabana
dc.sourceIntellectum Repositorio Universidad de La Sabana
dc.subjectTransporte -- Planificaciónes_CO
dc.subjectMejoramiento de procesoses_CO
dc.subjectGestión empresariales_CO
dc.subjectTiempos y movimientoses_CO
dc.subjectTiempo y reacciones económicases_CO
dc.subjectConsumidoreses_CO
dc.titleModelo para la optimización de transporte de transformadores de distribución para los distribuidores de Colombiaes_CO
dc.typemasterThesises_CO
dc.publisher.programMaestría en Gerencia de Operacioneses_CO
dc.publisher.departmentEscuela Internacional de Ciencias Económicas y Administrativases_CO
dc.identifier.local268778
dc.identifier.localTE09665
dc.type.hasVersionpublishedVersiones_CO
dc.rights.accessRightsopenAccesses_CO
dc.creator.degreeMagíster en Gerencia de Operacioneses_CO


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivatives 4.0 InternationalExcept where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivatives 4.0 International