期刊文献+

Competitive location problem of multi-level pickup point considering cooperative coverage 被引量:2

基于合作覆盖的多级自提点竞争选址问题(英文)
在线阅读 下载PDF
导出
摘要 To occupy a greater market share in terminal distribution, companies are urged to make full use of cooperative coverage formed with brand effect and information sharing in the layout of pickup points. Based on the diversity of pickup points, the piecewise function, signal intensity function and probability function are introduced. Meanwhile, considering the effect of distance satisfaction and cooperation coverage on customer behavior, the location model of the pickup point under competitive environments is established. The genetic algorithm is used to solve the problem, and the effectiveness of the model and algorithm is verified by a case. The results show that the sensitivity of weighted demand coverages to budget decreases gradually. The maximum weighted demand coverage increases at first and then decreases with the increase of the signal threshold, and there is a positive correlation with the change of the actual demand coverage to the senior customers, but it is negatively related to the intermediate and primary customers. When the number of high-level pickup points in a competitive enterprise is small, the advantage of the target enterprise is more significant. Through comparison, the cooperative coverage model is better than the non-cooperative coverage model, in terms of the weighted demand coverage, the construction cost and the attention paid to the important customers. 为了在末端配送中获取竞争优势,指导企业利用品牌作用和信息共享形成的联合覆盖进行自提点选址布局.在考虑自提网点多样性的基础上,引入分段函数、信号强度函数和概率函数,同时考虑距离感知和联合覆盖对顾客行为的影响,建立竞争环境下自提点选址模型.针对优化问题,采用遗传算法进行求解,并用算例验证了模型和算法的有效性.结果表明,加权需求覆盖量对预算的敏感度逐渐减小;最大加权需求覆盖量随着信号量阈值的增加大体上呈现出先增后降的趋势,并与高级顾客实际需求覆盖量的变化呈正相关,而与中、初级顾客呈负相关;当竞争企业高等级网点较少时,目标企业占据市场份额的优势更显著.通过模型对比,联合覆盖模型无论是在加权需求覆盖量、覆盖成本和对重要顾客的关注方面都优于非联合覆盖模型.
作者 Han Xun Zhang Jin Zeng Qian 韩珣;张锦;曾倩(西南交通大学交通运输与物流学院,成都610031;西南交通大学综合交通运输智能化国家地方联合工程实验室,成都610031;重庆工商大学商务策划学院,重庆400067)
出处 《Journal of Southeast University(English Edition)》 EI CAS 2019年第1期111-117,共7页 东南大学学报(英文版)
基金 The National Social Science Foundation of China(No.16CGL018)
关键词 pickup point cooperative coverage multi-level facility layout competitive conditions genetic algorithm 自提点 合作覆盖 多级设施选址 竞争环境 遗传算法
  • 相关文献

参考文献3

二级参考文献40

  • 1何波,杨超,张华.废弃物回收的多层逆向物流网络优化设计问题研究[J].中国管理科学,2007,15(3):61-67. 被引量:37
  • 2Roper J, Marsden G. Valuing home delivery-Where' s my stuff [J]. Wasted Miles, Wasted Money (a less congested, more energy efficient future), 2006 : 53-60.
  • 3Esper T L, Jensen T D,Turnipseed F L, et al. The last mile:an examination of effects of online retail delivery strategies on consumers[J]. Journal of Business Logistics, 2003, 24 (2) : 177-203.
  • 4Browne M, Allen J, Anderson S. Overview of home delivery in the UK[R]. Westminster: University of Westminster, 2001.
  • 5Punakivi M,Yrjola H, Holmstrom J. Solving the last mile issue: reception box or delivery box? [J]. International Journal of Physical Distribution > Logistics Management, 2001, al (6) :427-439.
  • 6Kgm/ir/iinen V, Saranen J, Holmstr6m J. The reception box impact on home delivery efficiency in the e-grocery business [J]. International Journal of Physical Distribution Logistics Management, 2001,31 (6) = 414-426.
  • 7Su X. Bounded rationality in newsvendor models [J ]. Manufacturing Service Operations Management, 2008, 10 (4) :566-589.
  • 8Chen Y, Su X, Zhao X. Modeling Bounded Rationality in Capacity Allocation Games with the Quantal Response Equilibrium [J]. Management Science, 2012, 58 (10): 1952-1962.
  • 9Hayel Y, Quadri D, Jimfinez T, et al. Decentralized optimization of last-mile delivery services with non-cooperative bounded rational customers[J]. Annals of Operations Research, 2014:1- 19.
  • 10Benati S, Hansen P. The maximum capture problem with random utilities Problem formulation and algorithms [J]. European Journal of Operational Research, 2002, 143 (3) : 518-530.

共引文献62

同被引文献21

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部