A matheuristic for the multi-product maritime inventory routing problem
针对多产品海运库存路径问题，提出一种两阶段迭代数学启发式算法，在60天规划期内处理大规模实例，并与CPLEX对比验证效果。
This paper considers a multi-product maritime inventory routing problem in which the routes of the vessels are determined while inventories in the ports must remain within given bounds. Since there is more than one product, each port can be a consumption port for one product and a production port for another product. We propose a matheuristic to deal with large-size instances with a planning horizon of 60 days. The first phase of the heuristic identifies a subset of the arcs in order to use them as input parameters for the second phase. In the second phase, a mathematical model is solved with the selected arcs fixed. These two phases are iterated until a stopping criterion is satisfied. The solutions produced by the matheuristic are compared with those obtained by CPLEX. Comparing the single-product version of the problem with the multi-product version revealed that instances with multiple products require significantly more run time compared with the single-product instances.