基于逐渐覆盖的自提点选址模型与算法研究-计算机应用研究.PDFVIP

优先出版 计 算 机 应 用 研 究 第33 卷 基于逐渐覆盖的自提点选址模型与算法研究* 陈义友，陈以衡 (西南交通大学 交通运输与物流学院，成都 610031) 摘 要：实践表明自提点类型和自提点覆盖距离影响消费者自提服务的满意度。为解决消费者满意度选址问题，基于逐 渐覆盖理论，用凹凸函数刻画消费者的满意度，构建了基于逐渐覆盖的自提点选址模型。根据模型的特点，设计了相应 的拉格朗日松弛算法。最后，运用大量的随机算例进行计算，并与传统覆盖模型的选址结果进行了比较。算例分析结果 揭示了所构建的模型和算法在自提点选址决策中的有效性。 关键词：自提点；逐渐覆盖；设施选址；拉格朗日松弛算法；消费者满意度 中图分类号：C934 ；F224.3 Research on pickup point location model and algorithm in presence of gradual coverage Chen Yiyou, Chen Yiheng (School of Transportation Logistics, Southwest Jiaotong University, Chengdu 610031, China) Abstract: Social practices show that the pickup point’s type and covering distance affect consumer satisfaction level on pickup service. In order to solve consumer satisfaction location problem. we used convex and concave function to depict consumer satisfaction level. then based on the gradual coverage theory. proposed the pickup point location model in the presence of gradual coverage. According to the attributes of the model. we proposed a lagrangian relaxation algorithm. Finally. we calculated a large number of random examples and compared with the location results of traditional covering model . The numerical examples show that the proposed model and algorithm have the effectiveness in pickup point location decision . Key Words: pickup point ; gradual coverage; facility location; lagrangian relaxation algorithm; consumer satisfaction level 据统计，传统送货上门的快递交付方式一次投递失败比例 国外学者对于自提点选址模型的研究较少，主要集中在从