基于最短路径的外卖配送时间优化问题研究
Research on Optimization of Takeaway Delivery Time Based on Shortest Path
摘要: 针对送餐行业顾客的平均等待时间问题,以最短路径原则为基础,建立相应的数学模型。以某地区某天顾客的下单情况为研究对象,运用图论理论将该地区地理简图抽象为无向赋权图,建立顾客等待时间模型,并利用Dijkstra算法得出两区域之间的最短路径,采用随机模拟算法生成动态订单,估计出顾客的平均等待时间。在此基础上,通过改变配送中心选址、增加配送人员数以缩短顾客平均等待时间,达到模型优化的效果。
Abstract:
Aiming at the average waiting time of customers in the food delivery industry, a corresponding mathematical model is established based on the shortest path principle. Taking the order situation of customers in a certain area as the research object, using graph theory to abstract the geographic diagram of the area as an undirected weighted graph, building a customer waiting time model, and using Dijkstra algorithm to find the shortest distance between the two areas, using a random simulation algorithm to generate dynamic orders, and estimate the average waiting time of customers. On this basis, by changing the location of the distribution center and increasing the number of distribution personnel to shorten the average waiting time of customers, the effect of model optimization is achieved.
参考文献
|
[1]
|
吴丽敏. 基于顾客满意度的多目标配送中心选址方法研究[J]. 物流科技, 2014(6): 95-97.
|
|
[2]
|
杨粟涵, 于蕾. 基于遗传算法的快递配送路径优化问题研究[J]. 现代信息科技, 2020, 4(9): 99-103.
|
|
[3]
|
范立南, 吕鹏. 基于改进遗传算法的校园外卖配送路径规划[J]. 物流科技, 2021(1): 14-19.
|
|
[4]
|
黄驰, 黄耿石, 朱小玲. 基于遗传算法的送外卖最短路径研究[J]. 科技传播, 2016, 12(6): 94-95.
|
|
[5]
|
翟劲松, 台玉红. 基于时间窗约束下的外卖配送路径优化[J]. 物流科技, 2018(3): 15-18.
|