Volume 39 Issue 1
Feb.  2021
Turn off MathJax
Article Contents
JIANG Yuxing, NIU Huimin, GAO Ruhu. A Dynamic Service Network Design for Railway Container Transportation and Benders Decomposition[J]. Journal of Transport Information and Safety, 2021, 39(1): 118-127. doi: 10.3963/j.jssn.1674-4861.2021.01.014
Citation: JIANG Yuxing, NIU Huimin, GAO Ruhu. A Dynamic Service Network Design for Railway Container Transportation and Benders Decomposition[J]. Journal of Transport Information and Safety, 2021, 39(1): 118-127. doi: 10.3963/j.jssn.1674-4861.2021.01.014

A Dynamic Service Network Design for Railway Container Transportation and Benders Decomposition

doi: 10.3963/j.jssn.1674-4861.2021.01.014
  • Received Date: 2020-08-07
  • Publish Date: 2021-02-28
  • A method of dynamic service network design for railway container transportation is studied, considering the transfer schemes of containers. A linear programming model of the dynamic service network design for railway container transportation is constructed to minimize the total cost.In accordance with the characteristics of the problem, a solution approach based on Benders decomposition is developed. Then, the formulation is decomposed into a master problem of service network design and subproblems of container flow allocation. The cuts of the master problem are constantly generated by utilizing the solutions of dual subproblems to solve them iteratively. Some valid inequalities are used to tighten the master problem, thus overcoming slow convergence. The effectiveness of the model and algorithm is demonstrated, taking the network constructed by railway container terminals in Beijing and Zhengzhou as a case study. The numerical results indicate that for the design of large-scale dynamic service network, the improved algorithm spends 46 s to obtain an optimized solution, and the Gap is 1.56%. The unimproved Benders decomposition takes the same time, and the Gap is 45.17%. The application of improved strategies can improve calculation. The total cost of the optimized service network is reduced by about 20% compared to the service network with direct transportation organization. Compared with the existing plans for container train service, the optimized departure time and operation frequency of container trains can meet the transportation demand, ensuring that each container flow can be delivered to the destination within the specified transit period.

     

  • loading
  • [1]
    CRAINIC T G. Service network design in freight transportation[J]. European Journal of Operational Research, 2000, 122 (2): 272-288. doi: 10.1016/S0377-2217(99)00233-7
    [2]
    DUAN L, TAVASSZY L A, REZAEI J. Freight service network design with heterogeneous preferences for transport time and reliability[J]. Transportation Research Part E: Logistics and Transportation Review, 2019(124): 1-12. http://www.sciencedirect.com/science/article/pii/S1366554518313450
    [3]
    LULLI G, PIETROPAOLI U, RICCIARDI N. Service net- work design for freight railway transportation: The Italian case[J]. Journal of the Operational Research Society, 2011, 62(12): 2107-2119. doi: 10.1057/jors.2010.190
    [4]
    王保华, 何世伟. 考虑车辆周转的铁路动态货运服务网络设计优化模型及其分支-定价-切割算法[J]. 铁道学报, 2018, 40 (2): 8-14. doi: 10.3969/j.issn.1001-8360.2018.02.002

    WANG Baohua, HE Shiwei. Optimization model and branch-pri ce-cut algorithm for design of railway dynamic freight service network considering rolling stock management[J]. Journal of the China Railway Society, 2018, 40(2): 8-14. (in Chinese) doi: 10.3969/j.issn.1001-8360.2018.02.002
    [5]
    沈睿. 铁路行包快运服务网络设计理论与方法研究[D]. 北京: 北京交通大学, 2006.

    SHEN Rui. Research on service network for china railway express parcel transportation[D]. Beijing: Beijing Jiaotong University, 2006. (in Chinese)
    [6]
    唐金金, 杨露萍, 周磊山. 基于服务网络动态配流的直达列车开行方案优化编制方法[J]. 中国铁道科学, 2016, 37(4): 115-120. doi: 10.3969/j.issn.1001-4632.2016.04.18

    TANG Jinjin, YANG Luping, ZHOU Leishan. Optimal planning method for operation plan of through train based on dynamic traffic assignment of service network[J]. China Railway Science, 2016, 37(4): 115-120. (in Chinese) doi: 10.3969/j.issn.1001-4632.2016.04.18
    [7]
    夏阳, 魏玉光, 赖艺欢, 等. 铁路集装箱旅客化运输系统开行方案研究[J]. 交通运输系统工程与信息, 2019, 19(2): 150-156.

    XIA Yang, WEI Yuguang, LAI Yihuan, et al. Line plan of passenger-like transport system of railway container[J]. Journal of Transportation Systems Engineering and Information Technology, 2019, 19(2): 150-156. (in Chinese)
    [8]
    张小强, 李保轶, 吴桐, 等. 铁路集装箱班列开行方案与定价综合优化研究[J]. 铁道学报, 2018, 40(11): 1-8.

    ZHANG Xiaoqiang, LI Baoyi, Wu Tong, et al. Research on comprehensive optimization of railway container train scheduling and pricing[J]. Journal of the China Railway Society, 2018, 40(11): 1-8. (in Chinese)
    [9]
    闫伟, 朱晓宁, 邓宇君, 等. 中欧班列去程运输组织优化模型[J]. 铁道学报, 2019, 41(2): 1-7. https://www.cnki.com.cn/Article/CJFDTOTAL-TDXB201902001.htm

    YAN Wei, ZHU Xiaoning, DENG Yujun, et al. Optimization model of outbound transportation organization for china railway express[J]. Journal of the China Railway Society, 2019, 41(2): 1-7. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-TDXB201902001.htm
    [10]
    SHINTANI K, IMAI A, NISHIMURA E, et al. The container shipping network design problem with empty container repositioning[J]. Transportation Research Part E: Logistics and Transportation Review, 2007, 43(1): 39-59. doi: 10.1016/j.tre.2005.05.003
    [11]
    NGAMCHAI S, LOVELL D J. Optimal time transfer in bus transit route network design using a genetic algorithm[J]. Journal of Transportation Engineering, 2003, 129(5): 510-521. doi: 10.1061/(ASCE)0733-947X(2003)129:5(510)
    [12]
    CRAINIC T G, HEWITT M, TOULOUSE M, et al. Service network design with resource constraints[J]. Transportation science, 2016, 50(4): 1380-1393. http://d.wanfangdata.com.cn/periodical/04d7d4825db7eca367190a8f48effa9b
    [13]
    HOLMBERG K, YUAN D. A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem[J]. Operations Research, 48(3): 461-481. doi: 10.1287/opre.48.3.461.12439
    [14]
    高如虎, 牛惠民, 江雨星. 基于多维网络的增开列车条件下高速铁路列车运行图调整[J]. 铁道学报, 2020, 42(5): 1-8. doi: 10.3969/j.issn.1001-8360.2020.05.001

    GAO Ruhu, NIU Huimin, JIANG Yuxing. Train timetable rescheduling based on a time-station-track multi-dimensional network under condition of running extra trains for highspeed railway[J]. Journal of the China Railway Society, 2020, 42(5): 1-8. (in Chinese) doi: 10.3969/j.issn.1001-8360.2020.05.001
    [15]
    FONTAIN P, MINNER S. Benders decomposition for the hazmat transport network design problem[J]. European Journal of Operational Research, 2018, 267: 996-1002. doi: 10.1016/j.ejor.2017.12.042
    [16]
    GELAREH S, PISINGER D. Fleet deployment, network design and hub location of liner shipping companies[J]. Transportation Research Part E: Logistics and Transportation Review, 2011, 47(6): 947-964. doi: 10.1016/j.tre.2011.03.002
    [17]
    何必胜. 高速铁路列车开行方案与列车运行图协调优化理论与方法研究[D]. 北京交通大学, 2014.
    [18]
    NAOUM S J, ELHEDHLI S. An interiorpoint Benders based branch-and-cut algorithm for mixed integer programs[J]. Annals of Operations Research, 2013, 210(1): 33-55. doi: 10.1007/s10479-010-0806-y
    [19]
    FORTZ B, POSS M. An improved Benders decomposition applied to a multilayer network design problem[J]. Operations Research Letters, 2009, 37(5): 359-364. doi: 10.1016/j.orl.2009.05.007
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Figures(4)  / Tables(6)

    Article Metrics

    Article views (464) PDF downloads(16) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return