关键词: 自提点, 网格密度, 聚类算法, 顾客满意度, 最大覆盖选址模型

Abstract: To research the integrated location problem of number and position of pickup points based on the customer-points distribution in E-retailing distribution model,according to the distribution of customer-points,the grid dynamic density clustering algorithm was designed to determine the number and the alternative locations of pickup points.The model of pickup point location was established with the customer satisfaction and the gradually maximal covering as the bi-objective.The case was solved in IBM CPLEX,and the results verify the effectiveness of the algorithm and model,and two pickup point location strategies were proposed for E-retailing distribution with the calculation results.

Key words: pickup point, grid density, clustering algorithm, customer satisfaction, maximal covering location model