转运(资讯保安)
容器(类型理论)
火车
地铁列车时刻表
运筹学
停留时间
工程类
铁路货物运输
整数规划
计算机科学
运输工程
操作系统
机械工程
医学
地理
临床心理学
地图学
算法
作者
Baicheng Yan,Xiaoning Zhu,Der‐Horng Lee,Jian Gang Jin,Wang Li
标识
DOI:10.1016/j.cie.2020.106296
摘要
This paper tackles the sea-rail transshipment operation problem of seaport rail terminals, which includes two key sub-problems involved in sea-rail intermodal container transportation, namely train schedule template and transshipment plan of inbound containers. With limited resources and time constraints, operators need to decide the placed-in and taken-out time of trains to coordinate with vessels' unloading time and the transshipment plan of inbound containers (i.e. the amount of containers that are transshipped between different vessels and trains in each time slot) to maximize the number of direct-transshipment containers while minimizing the storage time and dwell time of inbound containers. The problem is formulated as an integer programming model, and a tailored rolling horizon approach with the adaptive horizon and backtracking strategy is proposed. The performance of the algorithm is verified by a set of instances. The results suggest that the handling capacity of rail-mounted gantry cranes shows a more significant effect on the performance of transshipment operation than other factors. The negative effect caused by insufficient handling capacity could be alleviated by methods like prolonging the feasible service time of trains and enhancing the operational capacity of shunting engines.
科研通智能强力驱动
Strongly Powered by AbleSci AI