Dynamic vehicle routing: solution methods and computational tools

Within the wide scope Of logistics management, transportation plays a central role and is a crucial activity in both production and service industry. Among others, it allows for the timely distribution of goods and services between suppliers, production units, warehouses, retailers, and final customers. More specifically, Vehicle Routing Problems (VRPs) deal with the design of a set of minimal cost routes that serve the demand for goods or services of a set of geographically spread customers, satisfying a group of operational constraints. While it was traditionally a static problem, recent technological advances provide organizations with the right tools to manage their vehicle fleet in real time. Nonetheless, these new technologies also introduce more complexity in fleet management tasks, unveiling the need for decision support Systems dedicated to dynamic vehicle routing. In this context, the contributions of this Ph.D. thesis are threefold : (i) it presents a comprehensive review of the literature on dynamic vehicle routing ; (ii) it introduces flexible optimization frameworks that can cope with a wide variety of dynamic vehicle routing problems ; (iii) it defines a new vehicle routing problem with numerous applications

• Autores: Pillac, Victor
• Tipo de recurso: Doctoral thesis
• Fecha de publicación: 2012
• Institución: Universidad de los Andes
• Repositorio: Séneca: repositorio Uniandes
• Idioma: eng
• OAI Identifier: oai:repositorio.uniandes.edu.co:1992/7789
• Acceso en línea: http://hdl.handle.net/1992/7789
• Palabra clave: Logística en los negocios; Optimización combinatoria; Ingeniería de transporte; Ingeniería
• Rights: openAccess
• License: https://repositorio.uniandes.edu.co/static/pdf/aceptacion_uso_es.pdf