Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.