Research on Optimization of Vehicle Routing Problem Based on Improved DBSCAN Clustering Algorithm of Power Material Warehouses
Given the complexity of the vehicle routing problem with multiple origin depots and dispersed warehouses of power materials warehouses,a two-stage method was proposed based on improved DBSCAN clustering algorithm,in which the clustering algorithm was used to simplify the problem of multiple storage warehouses of power materials.Firstly,the storage warehouses were classified by using the improved DBSCAN clustering algorithm,and a certain number of warehouse clusters were obtained.Thus,the vehicle routing problem was transformed into a single origin depot vehicle routing for each warehouse clusters.Secondly,the improved C-W method is used to solve the vehicle routing problem for each warehouse cluster.Finally,with the case study of the power material warehouse in Zhejiang Province,the applicability and feasibility of the proposed two-stage method and algorithm were verified.
NETL
NSTL
万方数据
