A Branch and Price Algorithm for the Heterogeneous Fleet Multi-Depot Multi-Trip Vehicle Routing Problem with Time Windows
研究了城市物流中异质车队多车场多行程带时间窗的车辆路径问题，提出一种分支定价算法，在修改的Solomon基准实例上有效求解最多40个客户、3个车场和2种车型的问题。
The multi-trip vehicle routing problem (MTVRP) extends the well-known VRP by allowing vehicles to perform several trips in a workday. The motivation arises from the new challenges in city logistics that push companies to use smaller and cleaner vehicles such as cargo bikes. With the integration of small vehicles into the fleet, many companies start to operate with a heterogeneous fleet and use multiple depots located in the city centers to reload the small vehicles. Inspired by these new challenges the companies face, we study the heterogeneous fleet multi-depot MTVRP with time windows under shared depot resources where small and large vehicles have different travel times in certain areas. We formulate this problem using workday variables and propose a branch and price algorithm that exhibits an enhanced performance by a new heuristic algorithm based on the reduction in the graph size. The proposed algorithm introduces a new way to compute the completion bounds using the iterative structure of the state-space augmenting algorithm and eliminates the need for solving a separate relaxation. We conduct experiments on modified small- and medium-size instances from Solomon’s benchmark set. The results of our computational experiments show that the proposed algorithm is very effective and can solve instances with up to 40 customers, three depots, and two types of vehicles.