Abstract: According to the characteristics of Intelligent Water Drop algorithm （IWD）, the framework of vehicle routing optimization algorithm based on IWD algorithm is designed. According to the disadvantages of traditional IWD algorithm in soil updating, the adjacent domain update mechanism is proposed, which considers the changes of soil information of the whole river, and increases the probability for other water drops reaching the target node. The encoding of IWD algorithm for vehicle routing is designed, by which the soft time window vehicle routing algorithm is designed. Through simulation experiments, compared with the standard algorithm and the particle swarm algorithm, adjacent domain update IWD based vehicle routing optimization algorithm has higher convergence precision and faster convergence speed than the contrast algorithm.

Key words: intelligent water drop algorithm, vehicle routing, adjacent domain soil renewal, soft time windows, optimization

摘要： 利用智能水滴算法（IWD）特点，设计了基于IWD算法的车辆路径优化算法框架。针对标准IWD算法在泥土更新上过于单一的缺点，设计了旁域更新的泥土含量更新机制，考虑整个河道的泥土信息变化，增加了其他水滴到达目标节点的概率；提出了车辆路径IWD算法的编码方式，基于改进的旁域更新IWD算法设计了软时间窗车辆路径优化算法;通过实验仿真，对比旁域IWD算法与标准算法及粒子群算法的车辆路径优化结果，显示该算法相比对比算法具有更高的收敛精度和更快的收敛时间。

关键词: 智能水滴算法, 车辆路径, 旁域泥土更新, 软时间窗, 优化