The min-max close-enough arc routing problem
研究车队在无需直接访问客户、只需经过客户附近弧段即可服务的情况下，如何平衡各车辆路径长度，提出分支切割和分支定价两种精确算法及启发式算法。
Here we introduce the Min-Max Close-Enough Arc Routing Problem, where a fleet of vehicles must serve a set of customers while trying to balance the length of the routes. The vehicles do not need to visit the customers, since they can serve them from a distance by traversing arcs that are “close enough” to the customers. We present two formulations of the problem and propose a branch-and-cut and a branch-and-price algorithm based on the respective formulations. A heuristic algorithm used to provide good upper bounds to the exact procedures is also presented. Extensive computational experiments to compare the performance of the algorithms are carried out.