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

物流“最后一公里”是直接面向客户服务的物流末端环节,直接影响到物流的效率、成本和服务质量.针对此“最后一公里”问题,提出基于自提柜的末端物流配送解决方案.通过引入自提柜渐进服务半径的概念,用需求点到自提柜的距离来刻画需求点对自提柜的服务满意度,并用凹凸函数来表示,建立自提柜选址问题的混合整数规划模型.同时,充分考虑模型的各项约束性条件,设计出启发式拉格朗日松弛算法并进行模型求解.最后,运用大量算例进行检验,分析算法的迭代次数、迭代时间等指标,证明选址模型的准确性和求解算法的有效性,为实际工程应用提供了理论指导.

Location Algorithm of Lifting Cabinet Based on Gradual Service Radius

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.