Hub-and-spoke network design for container shipping in inland waterways

被引:21
|
作者
Zhou, Saiqi [1 ]
Ji, Bin [1 ]
Song, Yalong [1 ]
Yu, Samson S. [2 ]
Zhang, Dezhi [1 ]
Van Woensel, Tom [3 ]
机构
[1] Cent South Univ, Sch Traff & Transportat Engn, Changsha 410075, Hunan, Peoples R China
[2] Deakin Univ, Sch Engn, Waurn Ponds, Vic 3216, Australia
[3] Eindhoven Univ Technol, Dept Ind Engn & Innovat Sci, Eindhoven, Netherlands
基金
中国国家自然科学基金;
关键词
Hub-and-spoke network design; Inland waterway container shipping; Integer linear programming model; Decomposition-based math-heuristic; Enhanced genetic algorithm; LOCATION-PROBLEMS; YANGTZE-RIVER; ALGORITHM; MODELS;
D O I
10.1016/j.eswa.2023.119850
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The enormous growth in the volume of river transportation and the upgrade of inland waterways make inland shipping more and more important in transportation and logistics. This work proposes a hub-and-spoke network design (HSND) for container shipping in inland waterways based on the tree-like structure river. Firstly, the characteristics of the hub-and-spoke network in the inland waterways are presented in detail. Then, an integer linear programming model is proposed to simultaneously determine the optimal hub location, feeder port allocation, and fleet deployment to minimize the total cost of ships, transportation, and transshipment. A decomposition-based math-heuristic method and an enhanced genetic algorithm are then proposed to solve the HSND. A case study based on the traffic on the Yangtze River and extensive computational experiments are conducted to verify the effectiveness of the proposed models and methods. In addition, the impacts of the number of hub ports and the economies of scale resulting from the hub-and-spoke network are investigated from the economic and network structure perspectives, which leads to some managerial insights.
引用
收藏
页数:13
相关论文
共 50 条
  • [21] Hub-and-spoke network design under operational and disruption risks
    Zhalechian, M.
    Torabi, S. Ali
    Mohammadi, M.
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2018, 109 : 20 - 43
  • [22] Hub-and-spoke airline network design under competitive market
    Yang, Ta-Hui
    Huang, Yu
    JOURNAL OF INDUSTRIAL AND PRODUCTION ENGINEERING, 2015, 32 (03) : 186 - 195
  • [23] Factors Affecting Container Shipping Through Inland Waterways
    Totakura, Bangar Raju
    Narasinganallur, Nilakantan
    Jalil, Syed Aqib
    Ajith, P. J.
    JOURNAL OF ETA MARITIME SCIENCE, 2022, 10 (03) : 156 - 167
  • [24] Carbon peak simulation and peak pathway analysis for hub-and-spoke container intermodal network
    Guo, Xiaoyan
    He, Junliang
    Yu, Hang
    Liu, Mei
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2023, 180
  • [25] Fleet Assignment Problem in Hub-and-Spoke Network
    Yan, Ke-wu
    Zhu, Jin-fu
    ISBIM: 2008 INTERNATIONAL SEMINAR ON BUSINESS AND INFORMATION MANAGEMENT, VOL 1, 2009, : 59 - 62
  • [26] Hub-and-spoke emergency rescue network planning
    Ma C.-X.
    Shi C.-W.
    Du B.
    Jiaotong Yunshu Gongcheng Xuebao/Journal of Traffic and Transportation Engineering, 2023, 23 (03): : 198 - 208
  • [27] Topology Characteristic of Hub-and-spoke Transportation Network
    Deng Ya-juan
    Hu Shao-rong
    SUSTAINABLE CITIES DEVELOPMENT AND ENVIRONMENT PROTECTION, PTS 1-3, 2013, 361-363 : 2030 - +
  • [28] Comparison of the formulations for a hub-and-spoke network design problem under congestion
    Kian, Ramez
    Kargar, Kamyar
    COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 101 : 504 - 512
  • [29] Hub-and-spoke network design under congestion: A learning based metaheuristic
    Karimi-Mamaghan, Maryam
    Mohammadi, Mehrdad
    Pirayesh, Amir
    Karimi-Mamaghan, Amir Mohammad
    Irani, Hassan
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2020, 142
  • [30] A VNDS Approach for the Liner Shipping Transport in a Structure of Hub-and-Spoke with Sub-Hub
    da Costa Fontes, Fabio Francisco
    Goncalves, Gilles
    IFAC PAPERSONLINE, 2018, 51 (11): : 247 - 252