The Dynamic Multi-Period Vehicle Routing Problem

Feasible solutions to the MP-E-VRP satisfy the following conditions: 1) each node i ∈ I is visited by a single EV in period p i , 2) each route starts and ends at the depot, 3) each

This hierarchical objective function, called Solomon’s objective in the sequel, is unusual in vehicle routing: for instance, most articles on the VRP minimize the total distance

A vehicle route starts from the main depot, performs multiple tours to service different customer zones and finally returns to the main depot. The problem involves the design of a

We approximate the production fluctuations over the horizon T using a sequence of periods (day clusters), with the same produc- tion level within each period, forming a

The proposed multi-period model has some similarities to an a priori optimization framework in the context of the vehicle routing problem with stochastic demand (VRPSD). In a

The objective of the problem is to find vehicle routes for each day such that the overall cost of the distribution, including transportation costs, inventory costs and penalty

The proposed multi-period model has some similarities to an a priori optimization framework in the context of the vehicle routing problem with stochastic demand (VRPSD). In a

In this problem, a set of homogeneous vehicles is used to visit a set of customer locations dispersed over a very large network, such as the travel times between any two