Study of LRP for Electric Logistics Vehicles Considering Soft Time Windows

To improve the distribution efficiency of enterprises and reduce logistics costs, the research is carried out on the battery swap stations selection and distribution routing problem of electric logistics vehicles with customers’ soft time windows. According to the relevant characteristics of electric logistics vehicles, a location-routing problem model was constructed, and the K-means clustering algorithm and genetic algorithm were designed to solve the model in two stages. Taking a logistics company in Beijing as an example, the optimal battery swap stations location and vehicle delivery route are obtained, and the effectiveness of the model is verified. Finally, through the sensitivity analysis of the number of sites for exchange stations, the results show that when the initial number of sites is set to 6, the distribution scheme with the lowest total cost can be obtained.