用户名: 密码: 验证码:
基于可靠性的集装箱班轮轴辐式网络设计
详细信息    查看全文 | 推荐本文 |
  • 英文篇名:Reliability-based Design of Container Liner Hub-and-spoke Network
  • 作者:陈江涛 ; 钟铭
  • 英文作者:Chen Jiangtao;Zhong Ming;School of Traffic & Transportation Engineering, Dalian Maritime University;
  • 关键词:水路运输 ; 集装箱运输 ; 轴辐式网络 ; 备选枢纽港 ; 整数规划
  • 英文关键词:waterway transportation;;container transportation;;hub-and-spoke network;;alternative hub port;;integer programming
  • 中文刊名:WLJS
  • 英文刊名:Logistics Technology
  • 机构:大连海事大学交通运输工程学院;
  • 出版日期:2019-01-25
  • 出版单位:物流技术
  • 年:2019
  • 期:v.38;No.388
  • 基金:辽宁省交通科技项目(201704);; 辽宁省高等学校教育教学改革研究项目(PI201507);; 国家重点研发计划资助(2017YFC0805309)
  • 语种:中文;
  • 页:WLJS201901014
  • 页数:5
  • CN:01
  • ISSN:42-1307/TB
  • 分类号:85-89
摘要
集装箱班轮运输航线网络的可靠性进行了研究,同时解决枢纽港选择、支线港配置和备选枢纽港选择三个问题。在模型中引入决策备选枢纽港的变量,并设置枢纽失灵产生的惩罚成本。设计算例进行分析,结果表明每个枢纽港都能够找到相应的备选枢纽港,作为应急预案,有效地提高了航线网络的可靠性,提升了班轮公司对突发事件的响应能力,弥补事后干扰恢复的被动性和高成本。算例验证了模型的可行性,可辅助班轮公司在航线网络规划阶段进行决策,并为海运网络可靠性的研究提供借鉴。
        In the design of the shipping route network, the key to the successful completion of shipping tasks is whether the hub port can operate normally. Susceptible to emergency events such as adverse weather, natural disasters, and labor disputes, etc., once disturbed, the hub port should be replaced by an alternative hub port in terms of transportation tasks and services. Based on this consideration, this paper studies the reliability of the container liner shipping route network, and attempts to solve the three issues of hub port selection, feeder port deployment and alternative hub port selection. It first introduces the decision-making variable for the selection of the alternative hub port in the model and set the penalty cost in case of hub failure. Next a numerical example is used, the result of which shows that each hub port can correspond to an alternative hub port as its contingency plan, which can effectively improve the reliability of the shipping route network and the liner company's responsiveness to emergencies, and make up for the passivity and high cost due to ex post interference or recovery.
引文
[1]Takano K,M Arai.A genetic algorithm for the hub-and-spoke problem applied to containerized cargo transport[J].Journal of Marine Science and Technology,2009,14(2):256-274.
    [2]Kian R,K Kargar.Comparison of the formulations for a huband-spoke network design problem under congestion[J].Computers&Industrial Engineering,2016,101:504-512.
    [3]Ghaffari-Nasab N,M Ghazanfari,E Teimoury.Robust optimization approach to the design of hub-and-spoke networks[J].The International Journal of Advanced Manufacturing Technology,2015,76(5-8):1 091-1 110.
    [4]Z Drezner,G Wesolowsky.Network design:selection and design of links and facility location[J].Transp.Res. Part A,2003,37(3):241-256.
    [5]L V Snyder,M S Daskin.Reliability models for facility location:the expected failure cost case[J].Transp.Sci,2005,39:400-416.
    [6]An Y,et al.Reliable p-median facility location problem:twostage robust models and algorithms[J].Transportation Research Part B:Methodological,2014,64:54-72.
    [7]An Y, Y Zhang, B Zeng. The reliable hub-and-spoke design problem:Models and algorithms[J]. Transportation Research Part B:Methodological,2015,77:103-122.
    [8]Mohammadi M, et al. Design of a reliable logistics network with hub disruption under uncertainty[J].Applied Mathematical Modelling,2016,40(9-10):5 621-5 642.
    [9]Nader Azizi, Satyaveer Chauhan. The impact of hub failure in hub-and-spoke networks:Mathematical formulations and solution techniques[EB/OL].http://doi.org//0.1016/j.cor.2014.05.012.
    [10]Peng P,et al.Reliable logistics networks design with facility disruptions[J].Transportation Research Part B:Methodological,2011,45(8):1 190-1 211.
    [11]管峰.集装箱班轮轴辐式网络区间规划模型研究[D].大连:大连海事大学,2014.
    [12]Xinchang Wang, Qiang Meng. Discrete intermodal freight transportation network design with route choice behavior of intermodal operators[J].Transportation Research Part B Methodological,2017,95:76-104.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700