Show simple item record

dc.creatorMartinez Carranza, Cristian Andres
dc.creatorMedina Turizo, Daniel Eduardo
dc.date.accessioned2019-06-14T13:38:12Z
dc.date.available2019-06-14T13:38:12Z
dc.date.issued2014-07-15
dc.identifier.urihttp://hdl.handle.net/11323/4854
dc.descriptionIngeniería Industriales_ES
dc.description.abstractEn esta investigación se propone modelar una heurística para el análisis del desempeño de un modelo determinístico de ruteo de vehículos múltiples depósitos en un ambiente estocástico, en una empresa de acueducto del municipio de Uribia, Guajira, la cual se encarga de la distribución de agua potable a través de flotas de carro tanques para pequeñas comunidades indígenas del sector. Inicialmente se realiza una amplia revisión de la literatura de los VRP de tipo estocástico. Luego se realiza la modelación de un SMDVRP en tres etapas, la primera es un procedimiento de clusterización por depósitos bajo el criterio de mínima distancia recorrida, en la segunda se utiliza un método para la optimización de rutas de un (CVRP) basado en algoritmos de colonias de hormigas y en la tercera etapa se realiza la modelación estocástica del problema en base a dos variables de estudio. Por último se realiza un diseño de experimentos a los resultados obtenidos de la modelación del SVRP, para esto se definen unos factores de diseño con sus respectivos niveles, unos bloques de variabilidad y las variables de respuesta de interés del caso. El objetivo del diseño de experimentos para determinar qué factores son significativos de acuerdo con las variables de respuesta del caso y que ofrecen un mejor desempeño operacional del modelo de simulación estudiado. Los resultados obtenidos presentan un ahorro del 27% sobre los costos operacionales con respecto a la política de distribución actual que utiliza la empresa a la cual se hace el estudio.es_ES
dc.description.abstractThis research proposes a heuristic model for analyzing the performance of a deterministic model of multiple vehicle routing in a stochastic environment deposits, in a company aqueduct Uribia, Guajira, which is responsible for the distribution of drinking water by tank truck fleets for small indigenous communities sector. Initially an extensive literature review of stochastic VRP type is performed. SMDVRP modeling of a three-step is then performed, the first is a method of clustering on deposits under the criterion of minimum distance, the second a method of route optimization of a (CVRP) based algorithms used ant colonies and in the third stage the stochastic modeling of the problem is performed on the basis of two variables of the study. Finally, a design of experiments to the results of the modeling SVRP to this design factors at their respective levels are defined, and blocks of variable response variables of interest the case is performed. The objective of design of experiments to determine which factors are significant according to the response variables of the case and which offer better operational performance of the simulation model studied. The results show a 27% savings on operating costs compared to current distribution policy used by the company to which the study is done.es_ES
dc.language.isospaes_ES
dc.publisherUniversidad de la Costaes_ES
dc.rightsinfo:eu-repo/semantics/openAccesses_ES
dc.rightsAttribution-NonCommercial-ShareAlike 4.0 International*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/*
dc.subjectAmbiente estocásticoes_ES
dc.subjectClusterizaciónes_ES
dc.subjectColonias de hormigases_ES
dc.subjectSimulación discretaes_ES
dc.subjectDiseño de experimentoses_ES
dc.subjectStochastic environmentes_ES
dc.subjectClusterizationes_ES
dc.subjectColonies of antses_ES
dc.subjectDiscrete simulationes_ES
dc.subjectDesign of experimentses_ES
dc.titleModelacion de una heuristica para el análisis del desempeño de un modelo deterministico de ruteo de vehículos multiples depósitos bajo un ambiente estocásticoes_ES
dc.title.alternativeModeling a heuristic for the analysis of the performance of a deterministic vehicle routing model multiple deposits under a stochastic environmentes_ES
dc.typeThesises_ES
dcterms.referencesBarcos, L., Rodriguez M., V., Álvarez , M. J., & Robusté, F. (2002). Algoritmo basado en la optimización mediante colonias de hormigas para resolución del problema del transporte de carga desde varios orígenes a varios destinos. V Congreso de Ingeniería del Transporte. Bertsimas, D. (1992). A Vehicle Routing Problem with Stochastic Demand. Institute for Operation Research and the Management Scienses . Biing Sheu, J. (2006). A hybrid fuzzy-optimization approach to customer groupingbased logistics distribution operations. Applied Mathematical Modelling. Chan, Y., Carter, W., & Burnes , M. (2001). A multiple-depot, multiple-vehicle, location-routingproblem with stochastically processed demands. Computers & Operations Research. Christiansen, C., & Lysgaard, J. (2007). Abranch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands. Operations Research Letters. Cordeau, J. F., Laporte, G., Savelsbergh, M., & Vigo, D. (2007). Vehicle Routing. Elsevier B.V., 410-412. Daza, J. M., Montoya, J. R., & Narducci, F. (2009). RESOLUCIÓN DEL PROBLEMA DE ENRUTAMINETO DE VEHÍCULOS CON LIMITACIONES DE CAPACIDAD UTILIZANDO UN PROCEDIMIENTO METAHEURÍSTICO DE DOS FASES. EIA. Erbao, C., & Mingyong, L. (2009). A hybrid differential evolution algorithm to vehicle routing problem with fuzzy demands. Journal of Computational and Applied Mathematics. Farhang Moghaddam, B., Ruiz, R., & Jafar Sadjadi, S. (2011). Vehicle routing problem with uncertain demands: An advanced particle swarm algorithm. Computers & Industrial Engineering. François Cordeau, J., Laporte, G., W.P. Savelsbergh, M., & Vigo, D. (2007). Vehicle Routing. Elsevier B.V., 410-417. Gendreau, M., Laporte, G., & René, S. (1995). A TABU SEARCH HEURISTIC FOR THE VEHICLE ROUTING PROBLEM WITH STOCHASTIC DEMANDS AND CUSTOMERS. INFORMS. Gendreau, M., Laporte, G., & Séguin, R. (1996). Stochastic vehicle routing. European Journal of Operational Research 88, 3-12. Géraldine, H., Cordeau, J.-F., & Laporte, G. (2011). An integer L-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays. Discrete Applied Mathematics. González Vargas , G., & Gonzáles Aristizábal, F. (2006). Metaheurísticas aplicadas al ruteo de vehículos. Un caso estudio. Parte 1: formulación del problema. redalyc. Goodson, J., Ohlmann, J., & Thomas, B. (2011). Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand. European Journal of Operational Research. Google. (2014). Google Earth. Recuperado el 29 de 03 de 2014, de Google Earth: http://www.google.com/gadgets/directory?pid=earth&synd=earth&hl=es&gl= co Haughton , M. (1998). THE PERFORMANCE OF RUTE MODIFICATION AND DEMAND STABILIZATION STRATEGIES IN STOCHASTIC VEHICLE ROUTING. Transportation Research . Haughton , M., & Stenger, A. (1999). Comparing strategies for addressing delivery shortages in stochastic demand setting. Elsevier Science Ltd. Haugland, D., Ho, S., & Laporte, G. (2006). Designing delivery districts for the vehicle routing problem with stochastic demands. European Journal of Operational Research. Juan, A., Faulin, J., Grasman, S., Riera, D., Marull, J., & Mendez, C. (2010). Using safety stocks and simulation to solve the vehicle routing problem with stochastic demands. Transportation Research. Laporte, G., louveaux, F., & Mercure , H. (1992). The Vehicle Routing Problem with Stochastic Travel Times. Tansportation Science. LAPORTE, G., LOUVEAUX, F., & MERCURE, H. (1992). The Vehicle Routing Problem with Stochastic Travel Times. Transportation Science. López Franco, J., & Nieto Izasa, S. (2012). Heurística para la Generación de un Conjunto de Referencia de Soluciones que Resuelvan el Problema de Ruteo de Vehículos con Múltiples Depósitos MDVRP. Latin American and Caribbean Conference for Engineering and Technology. Marinakis, Y., Iordanidou, G.-R., & Marinaki, M. (2013). Particle Swarm Optimization for the Vehicle Routing Problem with Stochastic Demands. Applied Soft Computing. Novoa, C., & Storer, R. (2008). An approximate dynamic programming approach for the vehicle routing problem with stochastic demands. European Journal of Operational Research. Olivera, A. (2004). Heurísticas para Problemas de Ruteo de Vehículos. Pandelis, D., Kyriakidis, E., & Dimitrakos, T. (2011). Single vehicle routing problems with a predefined customer sequence, compartmentalized load and stochastic demands. European Journal of Operational Research. Rocha, L., Gonzáles, C., & Orjuela, J. (2011). Una revisión del estado del arte del problema de ruteo de vehículos: Evolución histórica y métodos de solución. Secomandi , N. (2000). Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands. Computers & Operations Research. Taş, D., Gendreau, M., Dellaert, N., van Woensel, T., & de Kok, A. (2013). Vehicle Routing with Soft Time Windows and Stochastic Travel Times: A Column Generation and Branch-and-Price Solution Approach. European Journal of Operational Research. Tatarakis, A., & Minis , I. (2008). Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns. European Journal of Operational Research. Van Woensel, T., Kerbache, L., Peremans, H., & Vandaele, N. (2001). A VEHICLE ROUTING PROBLEM WITH STOCHASTIC TRAVEL TIMES. Xiangyong Li, a., Peng Tian, a., & Stephen C.H Leung, b. (2010). Vehicle routing problems with the windows and stochastic travel and service times: Models and Algorithm. ELSEVIER. Yan, S., Chi, C.-J., & Tang, C.-H. (2005). Inter-city bus routing and timetable setting under stochastic demands. Transportation Research. Yan, S., Lin, J.-R., & Lai, C.-W. (2013). The planning and real-time adjustment of courier routing and scheduling under stochastic travel times and demands. Transporta tion Research.es_ES
dc.contributor.tutorNieto Isaza, Santiago


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

info:eu-repo/semantics/openAccess
Except where otherwise noted, this item's license is described as info:eu-repo/semantics/openAccess