基于部分集卡到达信息的码头进口箱翻箱优化

交通运输系统工程与信息 ›› 2017, Vol. 17 ›› Issue (1): 191-198.

基于部分集卡到达信息的码头进口箱翻箱优化

曾庆成*，李厚源，吴萍

大连海事大学交通运输管理学院，辽宁大连116026

收稿日期:2016-06-02 修回日期:2016-09-03 出版日期:2017-02-25 发布日期:2017-02-27
作者简介:曾庆成(1978-)，男，山东沂南人，教授，博士.
基金资助:
国家自然科学基金/National Natural Science Foundation of China (71370137, 71431001).

Re-handling Strategies for Import Containers Based on Partial Truck Arrival Information in Container Terminals

ZENG Qing-cheng, LI Hou-yuan, WU Ping

School of Transport Management, Dalian Maritime University, Dalian 116026, Liaoning, China

Received:2016-06-02 Revised:2016-09-03 Online:2017-02-25 Published:2017-02-27

摘要/Abstract

摘要：

集装箱码头进口箱提箱作业过程中，由于外集卡到达时间的不确定性，存在外集卡提箱顺序与目标箱的堆存位置不一致，从而产生大量翻箱.为了解决这一问题，本文以期望翻箱量最小为落箱位置的选择原则，提出最小化二次翻箱启发式算法，利用算例验证算法的有效性，分析集卡到达的信息质量对进口箱提箱翻箱的影响，根据集卡到达信息质量的不同选择最佳翻箱规则.结果表明：提出的翻箱策略可以在获得部分集卡到达信息下有效地减少翻箱，针对不同的集卡到达信息质量，采取相应翻箱规则进行翻箱作业能有效减少翻箱，提高码头堆场的作业效率.

关键词: 水路运输, 最小二次翻箱启发式算法, 进口箱, 集装箱码头, 部分集卡到达信息

Abstract:

During the import container retrieval progress, this is unproductive but unavoidable re-handling work if truck arrivals are a stochastic process, as the truck arrival sequence seldom matches the container storage sequence. This paper proposes a minimum re-handling heuristic algorithm for container pickup process, based on the principle choosing the stock which expected re-handling is minimum as the location, in order to analyze the effect of container re-handling problem and to optimize the re-handling strategy under different levels of information. Through the computer simulation, the results demonstrate that the proposed re- handling strategies can substantially reduce the number of re- handling under incomplete arrival information. According to different levels of information, taking appropriate strategy, can more effectively reduce re-handling operation and improve the productivity of container yard.

Key words: waterway transportation, minimum re-handling heuristic algorithm, import container, container terminal, partial arrival information of external trucks

中图分类号:

U691

曾庆成，李厚源，吴萍. 基于部分集卡到达信息的码头进口箱翻箱优化[J]. 交通运输系统工程与信息, 2017, 17(1): 191-198.

ZENG Qing-cheng, LI Hou-yuan, WU Ping. Re-handling Strategies for Import Containers Based on Partial Truck Arrival Information in Container Terminals[J]. Journal of Transportation Systems Engineering and Information Technology, 2017, 17(1): 191-198.

导出引用管理器 EndNote|Ris|BibTeX

链接本文: http://www.tseit.org.cn/CN/abstract/abstract19362.shtml

http://www.tseit.org.cn/CN/Y2017/V17/I1/191

参考文献

[1] 靳志宏, 毛钧, 李娜. 基于混合动态规划的集装箱堆场贝位内翻箱作业调度优化[J]. 交通运输系统工程与信息, 2011, 11(6): 131- 136. [JIN Z H, MAO J, LI N. Scheduling of relocating containers within a bay in container yard based on hybrid dynamic programming[J]. Journal of Transportation Systems Engineering and Information Technology, 2011, 11(6): 131-136.]

[2] CASERTA M, SCHWARZE S, VOß S. A mathematical formulation and complexity considerations for the blocks relocation problem[J]. European Journal of Operational Research, 2012, 219(1): 96-104.

[3] KIM K H, HONG G P. A heuristic rule for relocating blocks[J]. Computers & Operations Research, 2006, 33 (4): 940-954.

[4] 徐亚，陈秋双，龙磊，等. 集装箱倒箱问题的启发式算法研究[J]. 系统仿真学报, 2008, 20(14): 3666-3674. [XU Y, CHEN Q S, LONG L, et al. Heuristics for container relocation problem[J]. Journal of System Simulation, 2008, 20(14): 3666-3674.]

[5] ÜNLÜYURT T, AYDIN C. Improved rehandling strategies for the container retrieval process[J]. Journal of Advanced Transportation. 2012, 46(4): 378-393.

[6] LEE Y, CHAO S L. A neighborhood search heuristic for pre-marshalling export containers[J]. European Journal of Operational Research, 2009, 196(2): 468-475.

[7] LEE Y, HSU N Y. An optimization model for the container pre-marshalling problem[J]. Computers & Operations Research, 2007, 34(11): 3295-3313.

[8] WAN Y, LIU J, TSAI P C. The assignment of storage locations to containers for a container stack[J]. Naval Research Logistics, 2009, 56(8): 699-713.

[9] TANG L, JIANG W, LIU J, et al. Research into container reshuffling and stacking problems in containner terminal yards[J]. IIE Transactions, 2015, 47 (7): 751-766.

[10] CASERTA M, SCHWARZE S, VOß S. A mathematical formulation and complexity considerations for the blocks relocation problem[J]. European Journal of Operational Research, 2012, 219(1): 96-104.

[11] ZHU W, QIN H, LIM A, et al. Iterative deepening A* algorithms for the container relocation problem[J]. IEEE Transactions on Automation Science and Engineering, 2012, 9(4):710-722.

[12] FLORIAN FORSTER, ANDREAS BORTFELDT. A tree search procedure for the container relocation problem[J]. Computers & Operations Research, February 2012, ISSN 0305-0548.

[13] GIULIANO G, O’BRIEN T. Reducing port- related truck emissions: the terminal gate appointment system at the Ports of Los Angeles and Long Beach[J]. Transportation Research Part D, 2007, 12(7): 460-473.

[14] ZEHENDNER E, FEILLET D. Benefits of a truck appointment system on the service quality of inland transport modes at a multimodal container terminal[J]. European Journal of Operational Research, 2014, 235 (2): 461-469.

[15] NAMBOOTHIRIA R, ERERA A L. Planning local container drayage operations given a port access appointment system[J]. Transportation Research Part E, 2008, 44(2):185-202.

[16] 曾庆成，张笑菊，陈文浩，等. 基于BCMP排队网络的码头集卡预约优化模型[J]. 系统工程学报, 2013, 28(5): 592-599. [ZENG Q C, ZHANG X J, CHEN W H, et al. Optimization model for truck appointment based on BCMP queuing network[J]. Journal of Systems Engineering, 2013, 28(5): 592-599.]

[17] ZHAO W, GOODCHILD A V. The impact of truck arrival information on container terminal rehandling[J]. Transportation Research Part E, 2010, 46(3): 327-343.