基于改进的Weighted K-Means聚类的外卖员接单区域划分问题研究
Research on the Division of the Take-Out Order Region Based on Improved Weighted K-Means Clustering
摘要:
外卖行业蓬勃发展,人们对于外卖服务质量的要求也不断提升。因外卖员接单区域基本固定,合理划分外卖员负责区域并分配每个区域外卖员人数成为提升效率的关键。本项目基于查询算法模型,分析上海市2017年某时段的外卖数据,试图得到一个对于外卖接单区域的较为合理的划分标准并给出该划分。K-Means是一种常见的划分聚类算法,是在集中式系统框架无法对海量数据进行处理分析的基础上提出的。然而对于有权重的二维点集无法使用K-Means聚类算法,因此研究一种改进的Weighted K-Means算法显得尤为必要。本项目定义带权质心和带权距离,提出了新的Weighted K-Means算法,并使用改进前后的两种方法处理上海市外卖接单信息,给出合理可行的外卖员接单区域划分。对比两种方法的结果,改进的Weighted K-Means不仅方法可行,区域划分表现也更优秀。与此同时,使用该方法对外卖接单区域进行新的划分,有助于优化现有外卖模式、提升外卖效率以及顾客满意度。
Abstract:
The take-away industry is booming and
people's demands for the quality of take-away services are constantly
improving. Since the take-out area of the take-out is basically fixed, it is
the key to improve efficiency by reasonably dividing the area of the take-out
of the seller and assigning the number of the sellers in each area. Based on
the query algorithm model, this project analyzes the take-out data of Shanghai
during a certain period of time in 2017, trying to obtain a more reasonable
division standard for the take-out order area and give the division. K-Means is
a common partitioning clustering algorithm based on the inability of
centralized system frameworks to process and analyze massive amounts of data.
However, the K-Means clustering algorithm cannot be used for the
two-dimensional point set with weight information. Therefore, it is especially
necessary to study an improved Weighted K-Means algorithm. This project defines
the weighted centroid and weighted distance, proposes a new Weighted K-Means
algorithm, and uses the two methods before and after the improvement to deal
with the take-out information of Shanghai take-out orders, and gives a reasonable
and feasible division of the take-out area of the take-out. Comparing the
results of the two methods, the improved Weighted K-Means is not only feasible,
but also better in regional division. At the same time, using this method to
make a new division of the take-out order area helps to optimize the existing
take-away model, improve the take-out efficiency and customer satisfaction.
参考文献
|
[1]
|
龚心怡, 苏燕欣, 滕明宏, 钱永贵. 当前外卖配送模式中的问题及对策分析[J]. 中国商论, 2019(3): 32-33.
|
|
[2]
|
李桃迎, 吕晓宁, 李峰, 陈燕. 考虑动态需求的外卖配送路径优化模型及算法[J]. 控制与决策, 2019, 34(2): 406-413.
|
|
[3]
|
陈霞. 计算机数据挖掘技术的开发及其应用[J]. 现代营销(经营版), 2019(2): 130-132.
|
|
[4]
|
王妍捷. 外卖O2O市场下的物流策略研究[J]. 物流技术, 2015, 34(10): 23-25.
|
|
[5]
|
黄心, 吴学群, 袁清冽. 蚁群算法在外卖配送路径规划中的应用[J]. 价值工程, 2017, 36(5): 65-67.
|
|
[6]
|
赵刚, 李昆. 几种查找算法的比较[J]. 科技信息, 2010(9): 152-168.
|
|
[7]
|
王倩影. 外卖O2O行业配送模式选择研究[D]: [硕士学位论文]. 北京: 北京交通大学, 2017.
|
|
[8]
|
饿了么星选[EB/OL]. https://star.ele.me/waimai/shop/, 2018-10.
|
|
[9]
|
李翠霞, 于剑. 一种模糊聚类算法归类的研究[J]. 北京交通大学学报: 自然科学版, 2005, 29(2): 17-21.
|
|
[10]
|
刘叶, 吴晟, 周海河, 吴兴蛟, 韩林峄. 基于K-means聚类算法优化方法的研究[J]. 信息技术, 2019, 43(1): 66-70.
|