交通运输系统工程与信息 ›› 2018, Vol. 18 ›› Issue (4): 178-187.

• 系统工程理论与方法 • 上一篇    下一篇

集装箱码头装船顺序和场桥行驶路径联合优化

郭文文,计明军*,祝慧灵,王清斌   

  1. 大连海事大学 交通运输工程学院,大连 116026
  • 收稿日期:2018-04-18 修回日期:2018-06-01 出版日期:2018-08-25 发布日期:2018-08-27
  • 作者简介:郭文文(1991-),女,山东潍坊人,博士生.
  • 基金资助:

    国家自然科学基金/National Natural Science Foundation of China(71572022);辽宁省“百千万人才工程”经费资助/ The Project is Sponsored by Liaoning BaiQianWan Talents Program(2016236).

Joint Optimization of Loading Sequence and Yard Crane Travel Route in Container Terminals

GUO Wen-wen, JI Ming-jun, ZHU Hui-ling, WANG Qing-bin   

  1. Transportation Engineering College, Dalian Maritime University, Dalian 116026, Liaoning, China
  • Received:2018-04-18 Revised:2018-06-01 Online:2018-08-25 Published:2018-08-27

摘要:

为降低倒箱量、缩短场桥作业时间,在已知船舶配载图和堆场堆存状况的条件下,研究了出口箱装船顺序及场桥行驶路径联合优化问题.以作业时间衡量装船顺序产生的倒箱量及场桥行驶路径,建立作业时间最短为目标的整数规划模型,设计均衡倒箱量和场桥作业时间的启发式算法对模型进行求解,提出了问题下界的求解方法,同时,设计算例比较了启发式算法与下界的差异,为码头调度人员提供决策支持.

关键词: 水路运输, 出口箱, 装船顺序, 场桥行驶路径, 启发式算法

Abstract:

To reduce the number of rehandles and the operation time of yard cranes, considering the known ship stowage plan and yard stacking status, this paper studies the joint optimization problem of loading sequence and crane travel route. The integer programming model is established to minimize the operation time, which measures the number of rehandles and the crane travel route by operation time. The heuristic algorithm considering the rehandles and yard crane operation time is designed to solve the problem. The lower bound is proposed to verify the effectiveness of algorithm. Meanwhile, numerical examples are designed to compare the heuristic algorithm and lower bound, which provides the decision making for terminal operator.

Key words: waterway transportation, export container, loading sequence, crane travel route, heuristic algorithm

中图分类号: