中文摘要：

为了节约运输成本、提高物流服务效率，对集送货可拆分的车辆路径问题进行了研究．该问题允许一个任务点被访问多次，也允许同一车辆访问同一任务点多于一次．针对问题的特点设计三阶段启发式算法，拆分部分任务点的集送货需求，并使车辆行驶距离之和最小．数值实验结果表明，新的算法可以得到合理的车辆路径，尤其适用于送货需求总量大于集货需求总量的情形．

英文摘要：

In order to save the transportation cost and improve the efficiency of logistics services, the vehicle rou- ting problem with split pickups and deliveries is investigated. According to the characteristics of this problem, that is, multiple visits for a certain task point or for the same task point by a certain vehicle are allowed, a three-phase heuristic algorithm, which splits the demands of pickups and deliveries at some task points and minimizes the total driving distance of vehicles, is proposed. Numerical results show that the proposed algorithm helps to obtain reaso- nable vehicle routings, especially with the case of total delivery amount being greater than total pickup amount.