中文摘要：

研究了需求可拆分的车辆路径问题（SDVRP）的基本数据模型,分析了相关解的基本特点,提出了一种改进的人工蜂群算法进行求解。首先,在不考虑车辆容量和拆分需求的前提下,求出TSP大路径;然后,对TSP大路径进行切割,在切割的地方对客户点的需求进行拆分;最后,在前述操作基础上形成初始解,采用改进人工蜂群算法进行优化。在人工蜂群阶段,三种蜜蜂在全局和邻域范围内不断优化当前解。通过仿真实验与其它算法对比,验证了提出的算法在有效性和稳定性上,具有良好的效果。

英文摘要：

Basic data model of split delivery vehicle routing problem （SDVRP） is studied. Based on the analysis of the basic characteristics of the related solutions, an improved artificial bee colony algorithm is proposed to solve the problem. First, the big TSP path is sought out in the premise without considering the capacity of the vehicle and the requirements of split. Second,the big TSP path is split, meanwhile the customer~ needs is cut. Finally, the initial solution is formed on the basis of the above operations. In the phase of artificial bee colony, the current solution is continuously optimized by three kinds of bees in the global scale and neighborhood. Compared with other algorithms, the simulation results show that the proposed algorithm is effective and stable.