| Popis: |
Customer clustering technology for distribution process is widely used in location selection, distribution route optimization and vehicle scheduling optimization of power logistics distribution center. Aiming at the problem of customer clustering with unknown distribution center location, this paper proposes a clustering algorithm considering distribution network structure and distribution volume constraint, which makes up for the defect that the classical Euclidean distance does not consider the distribution road information. This paper proposes a logistics distribution customer clustering algorithm, which improves CLARANS algorithm to make the clustering results meet the constraints of customer distribution volume. By using the single vehicle load rate, the sufficient conditions for logistics distribution customer clustering to be solvable under the condition of considering the ubiquitous and constraints are given, which effectively solves the problem of logistics distribution customer clustering with sum constraints. The results state clearly that the clustering algorithm can effectively deal with large-scale spatial data sets, and the clustering process is not affected by isolated customers, The clustering results can be effectively applied to the distribution center location, distribution cost optimization, distribution route optimization and distribution area division of vehicle scheduling optimization. |
