Research on Location-routing Problem of Provincial Power Material Turnover Warehouse Based on Two-stage Heuristic Algorithm
The provincial power material turnover warehouse is the key node of the warehousing network architecture.The combinatorial decision-making problem of the location of the turnover warehouse with inventory capacity constraints and the vehicle distribution path optimization considering time window and loading capacity constraints is studied.A location-routing problem model with the goal of minimizing the total cost of distribution is constructed,and a two-stage heuristic algorithm is designed to solve the problem.In the first stage,a clustering-gravity-search algorithm is designed to solve the location problem of provincial turnover warehouse with inventory capacity constraints.In the second stage,the adaptive large neighborhood search algorithm is used to solve the problem of vehicle distribution path optimization considering time window and loading constraints.Based on the historical logistics data of S province in 2022 and the scale of existing storage resources,a two-stage heuristic algorithm is used to determine the location and distribution path of the provincial power material turnover warehouse.The results show that the algorithm can effectively reduce the total distribution cost of the storage network.
power materialslocation-routing problemK-means clusteringgravity methodadaptive large neighborhood search
NETL
NSTL
万方数据
维普
