A Matheuristic for the Multivehicle Inventory Routing Problem
针对多车辆库存路径问题，提出一种结合禁忌搜索和数学规划的数学启发式算法，在640个小规模实例中找到48%的最优解，并在240个大规模实例中改进了92%的最佳解。
We consider the inventory routing problem, in which a supplier has to replenish a set of customers by means of a limited fleet of capacitated vehicles over a discrete time horizon. The goal is to minimize the total cost of the distribution that comprises the inventory cost at the supplier and at the customers and the routing cost. We present a matheuristic that combines a tabu search and mathematical programming formulations. When compared with two exact methods on 640 small instances, the matheuristic finds 192 (48%) optima over the 402 instances with known optima and improves 125 upper bounds. Tested on 240 large instances (with up to 200 customers) for which no optimal solutions are known, it improves the best solution for 220 (92%) of the 240 instances. The online supplement is available at https://doi.org/10.1287/ijoc.2016.0737 .