Publication: ESTRATEGIAS DE SOLUCIÓN A UN PROBLEMA DE LOCALIZACIÓN Y RUTEO DE VEHÍCULOS FRENTE A PEQUEÑAS VARIACIONES EN DEMANDAS Y CAPACIDAD DE TRANSPORTE
No Thumbnail Available
Date
Authors
TAKAHASHI VALDÉS, SHIDO ANTONIO
Journal Title
Journal ISSN
Volume Title
Publisher
Universidad Técnica Federico Santa María
Abstract
El trabajo realizado aborda la problemática asociada a la re-optimización de un modelo conjunto de localización y ruteo vehicular, tomando como referencia la memoria realizada por el alumno Pablo Paddy en 2009. Esto nace desde la inquietud que se produce en los procesos de planificación de rutas de vehículos, los cuales deben ser capaces de enfrentar las contingencias de día a día y, de ser necesario, sufrir modificaciones cuando la situación lo amerita.
La generación de una estrategia de re-optimización se enfrenta en base a escenarios en los cuales se producen variaciones en la cantidad de personas transportadas y capacidad de transporte, los que se contrastan con la situación inicial, verificándose en general tiempos de resolución menores en la re-optimización. Esto se aprecia en mayor grado en el problema de tamaño mediano y no así en el problema de tamaño pequeño, por lo que es correcto afirmar que en problemas de mayor cuantía en los parámetros relativos a los paraderos instalados y cantidad de personas transportadas, se pueden observar mejor los beneficios de la re-optimización. No obstante, al variar la capacidad de transporte en problemas de tamaño mediano, la re-optimización puede representar una dificultad desde el punto de vista de las personas que eventualmente son reasignadas a otros paraderos, lo cual es un costo que debiera ser considerado.
Además, se efectúa un estudio teórico para comprender en detalle los elementos que conforman tanto el modelo conjunto ya mencionado como el proceso de re-optimización. Sobre este punto, se analiza el concepto del ruteo dinámico desde la perspectiva de la clasificación de problemas de ruteo; vale decir, verificar la calidad y la evolución de la información, además de cómo se producen los flujos de información entre los buses y el operador en el nodo inicial. Por el lado del modelo conjunto, se revisan los problemas del vendedor viajero, ruteo vehicular y localización-cobertura.
The work addresses the problems associated with re-optimizing a location-routing model, with reference to memory by the student Pablo Paddy in 2009. This arises from the concern that occurs in the process of planning vehicle routes, which must be able to meet the contingencies of everyday life and, if necessary, subject to change when the situation warrants. The generation of a re-optimization strategy considers scenarios in which there are variations in the number of people transported and transport capacity. This are compared with the initial situation, verifying overall resolution times lower in the re-optimization. This appreciated largely on medium size problem and not on small size problem, so it is correct to say that higher amounts issues in the parameters relating to the whereabouts installed and number of passengers carried can better see the benefits of re-optimization. However, by varying the transport capacity on medium sized problems, the re-optimization may represent a difficulty from viewpoint of people who are reassigned eventually to other stops, which is a cost that should be considered. In addition, we performed a theoretical study to understand the elements of location-routing model and the process of re-optimization. On this point, we explore the concept of dynamic routing problem from the perspective of the classification of routing problems, i.e., verifying the quality, evolution and flow of information flows between the buses and the operator at the root node. On the side of location-routing model, we review the traveling salesman problem, vehicle routing problem and location-coverage problem.
The work addresses the problems associated with re-optimizing a location-routing model, with reference to memory by the student Pablo Paddy in 2009. This arises from the concern that occurs in the process of planning vehicle routes, which must be able to meet the contingencies of everyday life and, if necessary, subject to change when the situation warrants. The generation of a re-optimization strategy considers scenarios in which there are variations in the number of people transported and transport capacity. This are compared with the initial situation, verifying overall resolution times lower in the re-optimization. This appreciated largely on medium size problem and not on small size problem, so it is correct to say that higher amounts issues in the parameters relating to the whereabouts installed and number of passengers carried can better see the benefits of re-optimization. However, by varying the transport capacity on medium sized problems, the re-optimization may represent a difficulty from viewpoint of people who are reassigned eventually to other stops, which is a cost that should be considered. In addition, we performed a theoretical study to understand the elements of location-routing model and the process of re-optimization. On this point, we explore the concept of dynamic routing problem from the perspective of the classification of routing problems, i.e., verifying the quality, evolution and flow of information flows between the buses and the operator at the root node. On the side of location-routing model, we review the traveling salesman problem, vehicle routing problem and location-coverage problem.
Description
Tesis (ing. Civil Industrial) - - Prof. guía : Victor Albornoz S. ; prof. corref. : Francisco Yuraszeck E.
Catalogado desde la version PDF de la tesis.
Catalogado desde la version PDF de la tesis.