Joint Optimization of Block Allocation and Transfer for Shared Yards at Sea-rail Intermodal Container Terminals

被引:0
|
作者
Wang, Xiaohan [1 ]
Jin, Zhihong [1 ]
机构
[1] College of Transportation Engineering, Dalian Maritime University, Liaoning, Dalian,116026, China
基金
中国国家自然科学基金;
关键词
Integer programming - Intermodal transportation - Nonlinear programming - Railroad transportation - Railroads;
D O I
10.16097/j.cnki.1009-6744.2024.05.026
中图分类号
学科分类号
摘要
Sea-rail intermodal container terminals facilitate shared yards, allowing sea-rail intermodal containers to be stored in blocks at port and railway container terminals, and containers to be transferred between different yard blocks. There are significant differences in the operation of equipment and block utilization between different storage systems. To effectively utilize space resources at sea-rail intermodal container terminals, the joint optimization of block allocation and transfer is determined by considering import and export container flows based on shared yards. An integer nonlinear programming model is developed to minimize the total transshipment costs. Based on the characteristics of the problem, a co-evolutionary genetic algorithm is designed to adaptively balance population diversity and global convergence by incorporating Q-learning principles to obtain solutions. Various numerical experiments are conducted to verify the effectiveness of the model and the algorithm. The results show that the proposed algorithm has better convergence accuracy. Compared with the other three traditional storage forms, the proposed shared and transferred form can effectively balance the transfer cost and handling efficiency, resulting in an average reduction of 15.17%, 11.96%, and 15.09% in the total handling cost. Finally, a sensitivity analysis to multiple unit costs is performed to verify the universality of the algorithm. © 2024 Science Press. All rights reserved.
引用
收藏
页码:283 / 294
相关论文
共 33 条
  • [1] Transshipment operations optimization of sea-rail intermodal container in seaport rail terminals
    Yan, Baicheng
    Zhu, Xiaoning
    Lee, Der-Horng
    Jin, Jian Gang
    Wang, Li
    COMPUTERS & INDUSTRIAL ENGINEERING, 2020, 141 (141)
  • [2] Container route optimization in a sea-rail intermodal network
    Zhao, Y.
    Zhang, X.
    Xue, Q. W.
    PROCEEDINGS OF THE 2016 5TH INTERNATIONAL CONFERENCE ON CIVIL, ARCHITECTURAL AND HYDRAULIC ENGINEERING (ICCAHE 2016), 2016, 95 : 952 - 958
  • [3] Optimization of Subsidies for Container Sea-rail Intermodal Transportation
    Wu Y.
    Xie Q.
    Zhang R.
    Jiaotong Yunshu Xitong Gongcheng Yu Xinxi/Journal of Transportation Systems Engineering and Information Technology, 2024, 24 (01): : 35 - 45
  • [4] Collaborative Optimization of Multi-Equipment Scheduling and Intersection Point Allocation for U-Shaped Automated Sea-Rail Intermodal Container Terminals
    Wang, Xiaohan
    Jin, Zhihong
    IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2024,
  • [5] Optimization of Gantry Crane Scheduling in Container Sea-Rail Intermodal Transport Yard
    Luo, Tian
    Chang, Daofang
    Gao, Yinping
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2018, 2018
  • [6] A New Synchronous Handling Technology of Double Stack Container Trains in Sea-Rail Intermodal Terminals
    Zhao, Zhongbin
    Wang, Xifu
    Cheng, Suxin
    Liu, Wei
    Jiang, Lijun
    SUSTAINABILITY, 2022, 14 (18)
  • [8] Integrated scheduling in sea-rail intermodal terminals with flexible transshipment routes
    Li, Wenfeng
    Zhong, Lingchong
    He, Lijun
    Guo, Wenjing
    SWARM AND EVOLUTIONARY COMPUTATION, 2025, 93
  • [9] Optimization of sea-rail intermodal container collection and distribution under novel port layout
    Ji, Shengzhong
    Ji, Mingjun
    Gao, Zhendi
    Kong, Lingrui
    Ji, Jialu
    JOURNAL OF RAIL TRANSPORT PLANNING & MANAGEMENT, 2025, 33
  • [10] Joint slot allocation and dynamic pricing of container sea-rail multimodal transportation
    Di Liu
    Hualong Yang
    Journal of Traffic and Transportation Engineering(English Edition), 2015, 2 (03) : 198 - 208