求解带容量和时间窗约束车辆路径问题的改进蝙蝠算法

带时间窗和容量约束的车辆路径问题是车辆路径问题重要的扩展之一,属于NP难题,精确算法的求解效率较低,且对于较大规模问题难以在有限时间内给出最优解.为了满足企业和客户快速有效的配送需求,使用智能优化算法可以在有限的时间内给出相对较优解.研究了求解带容量和时间窗约束车辆路径问题的改进离散蝙蝠算法,为增加扰动机制,提高搜索速...

An improved bat algorithm for the vehicle routing problem with time windows and capacity constraints

The vehicle routing problem with time windows and capacity constraints is one of the most important extensions of the vehicle routing problem, which belongs to the NP hard problem. The exact algorithm has low efficiency, which cannot give the optimal solution in limited time especially for large scale problems. In order to meet the rapid and effective distribution needs of enterprises and customers, intelligent optimization algorithms are usually adopted since they can give relatively optimal solutions in limited time. In this paper, an improved discrete bat algorithm for vehicle routing problem with capacity and time windows constraints problem is studied. The variable step size search strategy and the 2-opt optimization method are introduced into the algorithm for local search based on the clustering of customer points according to their locations, so as to increase the disturbance mechanism and improve the search speed and accuracy. Simulation results show that the designed algorithm has better optimization ability and practical value.