A Tabu Search Algorithm Based on Density Peak Clustering to Solve VRPTW

Aiming at the problem that the efficiency and quality of traditional heuristic algorithm for vehicle routing problem will decrease with the increase of problem size, a tabu search (TS) algorithm based on density peak clustering (DPC/TS) is proposed to solve vehicle routing problem with time window (VRPTW). In this algorithm, the density peak clustering algorithm (DPC) is used to cluster the customer points, and the VRPTW problem is divided into small sub-problems, and then the tabu search algorithm is used to solve the sub-problem. The results show that the proposed algorithm has better problem solving quality and faster problem solving efficiency.