本文已被:浏览 1210次 下载 1951次
Received:March 19, 2019 Revised:April 17, 2019
Received:March 19, 2019 Revised:April 17, 2019
中文摘要: 铁路集装箱中心站作为内陆腹地运输网络中的重要节点.转运作为主要的站内作业活动,对其开展调度研究,能够有效缩短不同运输方式之间的转运周期,从而保证铁路集装箱多式联运的整体运作效率.为了快速制定堆场作业计划,现有铁路集装箱站场转运作业均要求班列间的集装箱转运须经堆场方可实现.在该模式下,必然发生两次装卸和一次暂存作业.为了避免暂存中转作业,采用集装箱班列同步转运作业模式构建了以同步转运集装箱箱数最大化为目标的数学规划模型,提出突破性局部搜索框架实现对大规模问题的求解.最后通过算例分析验证了所提出的启发式算法效率.
Abstract:Railway container terminals are regarded as the important nodes in hinterland transportation network. Transferring operation is main activity in operations management of container terminals. Scheduling the transferring activities optimally can be able to shorten the operating cycle among different transport vehicles, and improve the efficiency of cargo transportation in rail multimodal transportation. To make the operation plan of stacking yard rapidly, the transferring operation requires the container movement must be stacked intermediately via yard at present. In that scenario, two loading/discharging activities and one stacking activity must be occurred. For avoiding idly extra activities, synchronized transferring should be recommended. In this study, a mixed integer programming model with maximizing the number of synchronized transferring containers is proposed. Due to its intractability, a breakout local search algorithm is designed to solve this problem under study, especially for large-sized instances. The computational experiments are performed to evaluate the performance of the proposed algorithm.
文章编号: 中图分类号: 文献标志码:
基金项目:国家自然科学基金(51405403);中央高校基本科研业务费专项资金(2682018CX09)
引用文本:
何迅,郭鹏,栾玉麟.基于突破性局部搜索的集装箱班列同步转运作业调度优化.计算机系统应用,2019,28(10):183-189
HE Xun,GUO Peng,LUAN Yu-Lin.Breakout Local Search for Scheduling Freight Trains with Synchronized Transferring Operations.COMPUTER SYSTEMS APPLICATIONS,2019,28(10):183-189
何迅,郭鹏,栾玉麟.基于突破性局部搜索的集装箱班列同步转运作业调度优化.计算机系统应用,2019,28(10):183-189
HE Xun,GUO Peng,LUAN Yu-Lin.Breakout Local Search for Scheduling Freight Trains with Synchronized Transferring Operations.COMPUTER SYSTEMS APPLICATIONS,2019,28(10):183-189