基于渐进服务半径的自提柜选址算法  

Location Algorithm of Lifting Cabinet Based on Gradual Service Radius

作　　者：肖卡飞 孙咏[2] 王嵩[2] 田月[2] 王美吉[2] XIAO Ka-Fei SUN Yong WANG Song TIAN Yue WANG Mei-Ji(University of Chinese Academy of Sciences, Beijing 100049, China Shenyang Institute of Computing Technology, Chinese Academy of Sciences, Shenyang 110168, China)

机构地区：[1]中国科学院大学,北京100049 [2]中国科学院沈阳计算技术研究所,沈阳110168

出　　处：《计算机系统应用》2017年第3期187-192,共6页Computer Systems & Applications

摘　　要：物流"最后一公里"是直接面向客户服务的物流末端环节,直接影响到物流的效率、成本和服务质量.针对此"最后一公里"问题,提出基于自提柜的末端物流配送解决方案.通过引入自提柜渐进服务半径的概念,用需求点到自提柜的距离来刻画需求点对自提柜的服务满意度,并用凹凸函数来表示,建立自提柜选址问题的混合整数规划模型.同时,充分考虑模型的各项约束性条件,设计出启发式拉格朗日松弛算法并进行模型求解.最后,运用大量算例进行检验,分析算法的迭代次数、迭代时间等指标,证明选址模型的准确性和求解算法的有效性,为实际工程应用提供了理论指导.The ＂last mile＂ in logistic is the terminal link of logistic service for users, and directly affects the efficiency, cost and service quality of logistic. This paper presents a solving method based on lifting cabinet for the ＂last mile＂ in logistic（this problem）. Based on the concept of gradual service radius, and the relationship between service satisfaction and distance from the demand point to lifting cabinet, this paper proposes a mixed integer programming model for lifting cabinet＇s location problem. Moreover, this paper designs a heuristic Lagrange＇s relaxation algorithm by taking into full account of the various constraints factors to solve the model. Finally, illustrative examples further analyze the number of iterations, iteration times and other indicators, which show the correctness of the results in this paper and the good performance of the proposed method.

关 键 词：最后一公里 渐进服务半径 服务满意度 混合整数规划 拉格朗日松弛算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]