考虑顾客自提需求的社区团购城市配送网络设计
Urban Distribution Network Design for Community Group Purchases Considering Customer Self-Pickup Demand
摘要: 针对社区团购平台面对多个团长点申请时如何选择申请通过的问题,考虑到团长点服务范围需要覆盖所有顾客点,结合顾客在面对多个团长点可自提取货时,往往会优先选择接受最近的团长点的服务的现实情况,构建了基于联合覆盖思想的团长点选址模型,以团长点服务覆盖程度最大化、顾客自提效用最大化为目标,运用非支配遗传算法对模型进行求解,从46个团长点中选出了35个开放服务,解决了平台在面对众多团长申请时如何决策的问题,帮助平台开拓城市网点服务。此外,以网格仓运输成本最小化为目标,优化生成网格仓配送路径,优化结果建议使用6辆车辆对团长点进行配送,车辆行驶总距离为502.19,总配送成本为622.19。
Abstract: For the community group-buying platform to face the problem of how to choose to apply for the application when more than one group leader point application, taking into account that the service scope of the group leader point needs to cover all customer points, combined with the fact that customers in the face of more than one group leader point can pick up the goods, often give priority to accepting the services of the nearest group leader point, constructed a group leader point location model based on the idea of joint coverage to maximize the degree of coverage of the service of the group leader point and maximize the utility of the self-pickup of the customer as the goal. With the maximization of self-pickup utility as the goal, the model is solved by using non-dominated genetic algorithm, and 35 open services are selected from 46 head points, which solves the problem of how to make decisions when the platform is facing many applications from the head, and helps the platform to develop the service of urban outlets. In addition, with the goal of minimizing the transportation cost of the grid warehouse, the optimization generates the distribution path of the grid warehouse, and the optimization result suggests the use of 6 vehicles to distribute to the headman points, and the total distance traveled by the vehicles is 502.19, and the total distribution cost is 622.19.
文章引用:钱春杏. 考虑顾客自提需求的社区团购城市配送网络设计[J]. 运筹与模糊学, 2024, 14(2): 933-945. https://doi.org/10.12677/orf.2024.142193

参考文献

[1] Liu, P. and Li, Y. (2020) Multiattribute Decision Method for Comprehensive Logistics Distribution Center Location Selection Based on 2-Dimensional Linguistic Information. Information Sciences, 538, 209-244. [Google Scholar] [CrossRef
[2] Yazdani, M., Chatterjee, P., Pamucar, D., et al. (2020) Development of an Integrated Decision Making Model for Location Selection of Logistics Centers in the Spanish Autonomous Communities. Expert Systems with Applications, 148, Article ID: 113208. [Google Scholar] [CrossRef
[3] 张子卿, 王林, 王思睿, 张金隆. 考虑两种服务功能的粮食产后服务中心选址问题及Benders分解算法[J/OL]. 中国管理科学: 1-10. 2024-04-20.[CrossRef
[4] 易海燕, 章圳琰. 基于新鲜度损耗的社区团购电商配送中心选址研究[J]. 交通运输工程与信息学报, 2020, 18(2): 59-67.
[5] 彭大江, 宁爱兵, 尚春剑, 张惠珍. 最大覆盖选址问题的一种降阶回溯算法[J]. 系统管理学报, 2020, 29(2): 346-353.
[6] 刘慧, 杨超, 张宗祥. 基于选址效益的联合覆盖模型研究[J]. 运筹与管理, 2017, 26(5): 95-101.
[7] Galvao, R.D. and Revelle, C. (1996) A Lagrangean Heuristic for the Maximal Covering Location Problem. European Journal of Operational Research, 88, 114-123. [Google Scholar] [CrossRef
[8] Maximo, V.R., Nascimento, M.C.V. and Carvalho, A.C.P.L.F. (2017) Intelligent-Guided Adaptive Search for the Maximum Covering Location Problem. Computers and Operations Research, 78, 129-137. [Google Scholar] [CrossRef
[9] He, Z., Fan, B., Cheng, T.C.E., et al. (2016) A Mean-Shift Algorithm for Large-Scale Planar Maximal Covering Location Problems. European Journal of Operational Research, 250, 65-76. [Google Scholar] [CrossRef
[10] Berman, O. and Wang, J. (2011) The Minmax Regret Gradual Covering Location Problem on a Network with Incomplete Information of Demand Weights. European Journal of Operational Research, 208, 233-238. [Google Scholar] [CrossRef
[11] Barkaoui, M., Berger, J. and Boukhtouta, A. (2015) Customer Satisfaction in Dynamic Vehicle Routing Problem with Time Windows. Applied Soft Computing Journal, 35, 423-432. [Google Scholar] [CrossRef
[12] 刘畅, 姚建明. 社区团购场景下供应链末端配送资源整合优化研究[J]. 管理学报, 2022, 19(8): 1231-1239.
[13] 刘嘉文, 代颖, 杨斐, 马祖军. 共享单车停放点联合覆盖选址及车辆配置模型[J]. 工业工程与管理, 2020, 25(1): 127-135.
[14] 杨聚平, 杨长春, 姚宣霞. 电商物流中“最后一公里”问题研究[J]. 商业经济与管理, 2014(4): 16-22 32.
[15] 陈义友, 张锦, 罗建强, 蹇萍. 顾客有限理性对最后一公里配送服务系统的影响[J]. 系统管理学报, 2020, 29(1): 149.
[16] Deb, K., Pratap, A., Agarwal, S., et al. (2002) A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6, 182-197. [Google Scholar] [CrossRef