GVNS based heuristic for solving the multi-product multi-vehicle inventory routing problem

We address a multi-product version of the IRP, in which a supplier is responsible for the distribution of several products to a set of geographically dispersed customers using a feet of heterogeneous vehicles. We deal with a deterministic version of demand rates in which the supplier has full knowledge of future demands. To generate good solutions, we have developed an algorithm based on the Variable Neighborhood Search capable of solving this variant. Our comparative tests on a large set of artificial instances have shown that our heuristic can produce high quality solutions.