Study on Emergency Relief VRP Based on Clustering and PSO

This paper, based on the concern that a large quantity of affected spots, relatively concentrated distribution and a small quantity of emergency materials in the affected area. It addresses an optimized mathematical model and presents a new optimal vehicle routing on emergency relief materials with the goals of the shortest transport time in emergency materials allocation. Firstly the K-means clustering algorithm is adopted to get some of local distribution centersand their distribution scopes, and then particle swarm optimization algorithm is used to design the local optimal allocation routings of emergency relief vehicles inside each scope. Finally, numerical results of the approximately optimal vehicle routings indicate the feasibility and validity of the model and the new algorithm.