New Lower Bounds and Exact Method for the m-PVRP
针对m-周游车辆路径问题，基于多面体和列生成提出了新的下界计算方法和精确求解算法，计算结果显示下界平均达到最优上界的97.5%至99%，并证明了三分之一实例的最优性。
This paper presents new lower bounding procedures and an exact method for the m-peripatetic vehicle routing problem (m-PVRP) based on polyhedral and column generation approaches. The branch-and-cut algorithms use three types of valid cuts on the edge-based formulation. The column-generation-based lower bounding procedure is applied on the dual set partitioning formulation and is composed of dual heuristics that estimate good dual variable values and therefore high lower bounds. Computational results on instances from the literature show that these new lower bounds reach on average 97.5% to 99% of the best known upper bounds and optimality is proven for a third of the instances.