基于逐渐覆盖的自提点选址模型与算法研究  

Research on pickup point location model and algorithm in presence of gradual coverage

作　　者：陈义友[1] 陈以衡[1] 

机构地区：[1]西南交通大学交通运输与物流学院,成都610031

出　　处：《计算机应用研究》2016年第8期2275-2277,2297,共4页Application Research of Computers

基　　金：四川省软科学研究计划资助项目(2014ZR0065;2014ZR0032)

摘　　要：实践表明自提点类型和自提点覆盖距离影响消费者对自提服务的满意度。为解决消费者满意度选址问题,基于逐渐覆盖理论,用凹凸函数刻画消费者的满意度,构建了基于逐渐覆盖的自提点选址模型;根据模型的特点,设计了相应的拉格朗日松弛算法;最后,运用大量的随机算例进行计算,并与传统覆盖模型的选址结果进行了比较。算例分析结果揭示了所构建的模型和算法在自提点选址决策中的有效性。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 pr,~posed model and algorithm have the effectiveness in pickup point location decision.

关 键 词：自提点 逐渐覆盖 设施选址 拉格朗日松弛算法 消费者满意度 

分 类 号：TP181[自动化与计算机技术—控制理论与控制工程] F253.4[自动化与计算机技术—控制科学与工程]