计算机应用研究2016，Vol.33Issue(8)：2275-2277,2297,4.DOI:10.3969/j.issn.1001-3695.2016.08.007
基于逐渐覆盖的自提点选址模型与算法研究
Research on pickup point location model and algorithm in presence of gradual coverage
摘要
Abstract
Social practices show that the pickup point’s type and covering distance affect consumer satisfaction level on pic-kup service.In order to solve consumer satisfaction location problem,this paper 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 pres-ence of gradual coverage.According to the attributes of the model,it proposed a Lagrangian relaxation algorithm.Finally,it cal-culated 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分类
信息技术与安全科学引用本文复制引用
陈义友,陈以衡..基于逐渐覆盖的自提点选址模型与算法研究[J].计算机应用研究,2016,33(8):2275-2277,2297,4.基金项目
四川省软科学研究计划资助项目 （）
