Dynamic vehicle routing: solution methods and computational tools

I defended my thesis entitled “Dynamic vehicle routing: solution methods and computational tools” on september 28th, 2012:

Examiners: Christian Prins, Pascal Van Hentenryck
Comittee: Raha Akhavan, Pierre Dejax, Dominique Feillet
Supervisors: Christelle Guéret, Andrés L. Medaglia

The full text of my dissertation is available with the following reference:

V. Pillac, Dynamic vehicle routing: solution methods and computational tools, Ph. D. Thesis, Ecole des Mines de Nantes, France, Universidad de Los Andes, Colombia, 2012.


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.