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

• Published in: International Conference on Big Data and Information Analytics (Online) pp. 472 - 478
• Main Authors: Zhang, Zhiwei, Dou, Yajie, Cheng, Wei, Xu, Xiangqian, Jiang, Jiang, Tan, Yuejin
• Format: Conference Proceeding
• Language: English
• Published: IEEE 24.08.2022
• Subjects: Big Data; Clustering algorithms; density peak clustering (DPC); Heuristic algorithms; Search problems; tabu search (TS); time window; Vehicle dynamics; Vehicle routing; vehicle routing problem with time window (VRPTW)
• ISSN: 2771-6902
• DOI: 10.1109/BigDIA56350.2022.9874007

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.