A Dynamic Path Planning Model Based on K-means Algorithm and Simulated Annealing Algorithm

摘要

Aiming at the problem that it is difficult to reduce logistics distribution cost through quantitative analysis, the paper takes the lowest logistics and transportation cost as objective function, comprehensively considers the location of logistics distribution centers, and constructs dynamic path planning model based on K-means algorithm and simulated annealing algorithm. Through simulation analysis, it can be found that by wisely selecting logistics distribution centers as transit service stations, the logistics distribution cost can be effectively reduced.