Instance set proposed by Coelho and Laporte (2012b) for the multi-product multi-vehicle inventory-routing problem. Download instances Download solutions (XLS style) Instances README
C++ file to load the instances
Upon request, the algorithm was modified to solve the following variation of the problem: (1) no supplier inventory costs; (2) infinite availability at the supplier. Download solutions
References
Coelho, L. C., Laporte, G. 2012b. A Branch-and-Cut Algorithm for the Multi-Product Multi-Vehicle Inventory-Routing Problem.