Location-routing Planning for Urban Terminal Distribution Considering User Preference for Delivery Method
Focusing on the route planning for express delivery terminal distribution,incorporating user preferences into the research category,and taking communities as units,an initial site selection alternative scheme is constructed by using the K-means algorithm. A two-stage heuristic algorithm is adopted to optimize site selection and route planning. In the first stage,a greedy algorithm is used to solve the locally optimal site selection and delivery path. In the second stage,a variable neighborhood search enhanced algorithm is used for global optimization. Simulation results show that this two-stage algorithm has significant improvements in site selection accuracy,path efficiency and user satisfaction and has good practicability and reliability.
terminal distributionuser preferencessite selection and route optimizationvariable neighborhood search algorithm
万方数据
维普
