Pharmaceutical distribution path optimization based on K-nearest neighbor algorithm

Abstract

With the changing situation of the prevention and control of the new crown epidemic, the demand for various types of pharmaceutical supplies is rising, which puts forward very high requirements on the timeliness of distribution. In view of this, this paper establishes a pharmaceutical logistics distribution path optimization model by comprehensively considering constraints such as vehicle loading and latest delivery time in pharmaceutical distribution. In order to solve this type of problem, a nearest neighbor algorithm is proposed, which introduces correlation coefficients to realize the improvement of the performance of the original algorithm. At the end of the paper, the effectiveness of the model and the algorithm is verified by applying a comparative analysis with the existing correlation algorithm with real data from a pharmaceutical company. The experimental results show that the method effectively reduces the delivery mileage and improves the pharmaceutical delivery timeliness.