Logistics delivery scheduling method based on clustering
algorithm and bipartite graph matching
1. College of Computer Science and Technology, Sanjiang University, Nanjing, Jiangsu 210012, China; 2. Graduate School of Computer Science and Engineering, University of Aizu, AizuWakamatsu 9658580, Japan; 3. School of Computer Science and Engineering, Southeast University, Nanjing, Jiangsu 210096, China
Abstract： To solve the problems of unreasonable area partitioning and unbalanced work assignment in delivery scheduling of logistics terminal distribution service, a twostage dispatch scheduling algorithm of area partitioning before scheduling was proposed. Based on GIS technology, Web technology and mobile development technology, an intelligent logistics information system with considering the last 1 km delivery was constructed. Introducing workload balance index with considering actual path distance, the distribution area partitioning method of pointtosurface aggregation with regional clustering was realized based on the kmedoids clustering algorithm. Based on the maximum weight, the bipartite graph matching KM algorithm was proposed to implement delivery scheduling algorithm. The twostage dispatch scheduling algorithm was applied in the distribution activities of SF EXPRESS. The results show that the proposed method can realize more clustered area partitioning performance and more balanced work distribution among express delivery personnels, which effectively improves the service efficiency of logistics network.
