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

Location Algorithm of Lifting Cabinet Based on Gradual Service Radius
Author:
  • 摘要
  • | |
  • 访问统计
  • |
  • 参考文献 [22]
  • |
  • 相似文献 [20]
  • | | |
  • 文章评论
    摘要:

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

    Abstract:

    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.

    参考文献
    1 周速华.以用户体验为核心赢在最后一公里.现代家电, 2015,(3):27-29.
    2 刘柳,马英才.智能物流上演"最后一公里"争夺战.互联网经济,2014,(7):16-19.
    3 McKinnon AC, Tallam D. Unattended delivery to the home:an assessment of the security implications. International Journal of Retail & Distribution Management, 2003, 31(1):30-41.
    4 Punakivi M, YrjoÈlaÈ H, HolmstroÈm J. Solving the last mile issue:Reception box or delivery box. International Journal of Physical Distribution & Logistics Management, 2001, 31(6):427-439.
    5 Punakivi M, Tanskanen K. Increasing the cost efficiency of e-fulfilment using shared reception boxes. International Journal of Retail & Distribution Management, 2002, 30(10):498-507.
    6 McLeod F, Cherrett T, Song L. Transport impacts of local collection/delivery points. International Journal of Logistics, 2006, 9(3):307-317.
    7 杨晓农,王振蒙.基于服务功能的公共图书馆服务半径理论研究.图书馆,2014,(6):17-19.
    8 杨珺,张敏,陈新.一类带服务半径的服务站截流选址-分配问题.系统理论与实践,2006,26(1):117-120.
    9 杨晓飞,马健宵,仲小飞.公交服务半径及服务水平研究.森林工程,2011,27(1):61-64.
    10 江从发,龚国华.配送中心最佳服务半径分析.物流技术,2003,(9):19-20.
    11 高洁,李锦飞.基于服务水平的区域物流中心优化选址模型研究.物流技术,2005,(10):279-281.
    12 王非,徐渝,李毅学.离散设施选址问题研究综述.运筹与管理,2006,15(5):64-69.
    13 乔联宝. 覆盖类选址问题分类及研究综述. 物流科技,2015,38(3):59-66.
    14 Daskin M. A maximum expected covering location model:fprmulation, properties and heuristic solution. Transportion Science, 1983, 17(1):48-70.
    15 Batta R, Dolan J. The maximal expected covering location problem:Revisited. Transportation Science, 1989, 23(4):277-287.
    16 Home J, Smith J. Dynamic programming algorithms for the conditional covering problem on path and extended star graphs. Networks, 2005, 46(4):177-185.
    17 Hassin R, Segev D. The multi-radius cover problem. Lecture Notes in Computer Science, 2005, 3608:24-35.
    18 Drezner Z, Wesolowsky GO, Drezner T. The gradual covering problem. Naval Research Logistics, 2004, 51(6):841-855.
    19 Saaty TL. Fundamentals of Decision Making and Priority Theory with the Analytic Hierarchy Process. RWS Publications, 1994.
    20 Berman O, Krass D. The generalized maximal covering locationproblem. Computers & Operations Research, 2002, 29(6):563-581.
    21 褚玉婧,马良,张慧珍.时间满意逐渐覆盖电动骑车充电站选址及算法.数学的实践与认识,2015,45(10):101-106.
    22 Berman O, Krass D. The generalized maximal covering location problem. Computers and Operations Research, 2002, 29(6):563-581.
    引证文献
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

肖卡飞,孙咏,王嵩,田月,王美吉.基于渐进服务半径的自提柜选址算法.计算机系统应用,2017,26(3):187-192

复制
分享
文章指标
  • 点击次数:1314
  • 下载次数: 2716
  • HTML阅读次数: 0
  • 引用次数: 0
历史
  • 收稿日期:2016-06-12
  • 最后修改日期:2016-07-25
  • 在线发布日期: 2017-03-11
文章二维码
您是第11226217位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京海淀区中关村南四街4号 中科院软件园区 7号楼305房间,邮政编码:100190
电话:010-62661041 传真: Email:csa (a) iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号