Constrained dynamic vehicle routing problems with time windows

This paper tackles two variants of a Dynamic Vehicle Routing Problem with Time Windows as real-world applications of several companies in the Canary Islands, Spain. In these dynamic vehicle routing problems, customer requests can be either known at the beginning of the planning horizon or dynamically revealed over it. Particularly, the problems corresponding to a delivery company and a vending machines company are taken into consideration. In addition to the dynamism feature of these problems, the companies consider several attributes that consist of a fixed heterogeneous fleet of vehicles, multiple time windows, customers priorities and vehicle-customer constraints. This work proposes a metaheuristic procedure to solve these problems. The computational experiments indicate that the proposed method is feasible to solve these real-world problems.