上海交通大学学报(英文版) ›› 2013, Vol. 18 ›› Issue (5): 606-619.doi: 10.1007/s12204-013-1441-y

• • 上一篇    下一篇

An Efficient Approach for Solving Yard Crane Scheduling in a Container Terminal

HE Jun-liang1,2* (何军良), ZHANG Wei-min1 (张为民), HUANG You-fang2 (黄有方), YAN Wei2 (严 伟)   

  1. (1. School of Mechanical Engineering, Tongji University, Shanghai 201804, China; 2. Engineering Research Center of Container Supply Chain Technology, Ministry of Education, Shanghai Maritime University, Shanghai 201306, China)
  • 出版日期:2013-10-31 发布日期:2013-12-05
  • 通讯作者: HE Jun-liang(何军良) E-mail:jlhe@shmtu.edu.cn

An Efficient Approach for Solving Yard Crane Scheduling in a Container Terminal

HE Jun-liang1,2* (何军良), ZHANG Wei-min1 (张为民), HUANG You-fang2 (黄有方), YAN Wei2 (严 伟)   

  1. (1. School of Mechanical Engineering, Tongji University, Shanghai 201804, China; 2. Engineering Research Center of Container Supply Chain Technology, Ministry of Education, Shanghai Maritime University, Shanghai 201306, China)
  • Online:2013-10-31 Published:2013-12-05
  • Contact: HE Jun-liang(何军良) E-mail:jlhe@shmtu.edu.cn

摘要: An efficient approach for yard crane (YC) scheduling is proposed in this paper. The definition of task group for YC scheduling is proposed. A mixed integer programming (MIP) model is developed. In the model, objective functions are subject to the minimization of the total delay of complete time for all task groups and the minimization of block-to-block movements of YCs. Due to the computational scale of the non-deterministic polynomial (NP) complete problem regarding YC scheduling, a rolling-horizon decision-making strategy is employed to solve this problem, by converting the MIP model into another MIP model in the scheduling of each rolling period. Afterwards, a heuristic algorithm based on modified A* search is developed to solve the converted model and obtain near optimal solution. Finally, the computational experiments are used to examine the performance of the proposed approach for YC scheduling.

关键词: container terminal, yard crane scheduling, mixed integer programming, heuristic algorithm

Abstract: An efficient approach for yard crane (YC) scheduling is proposed in this paper. The definition of task group for YC scheduling is proposed. A mixed integer programming (MIP) model is developed. In the model, objective functions are subject to the minimization of the total delay of complete time for all task groups and the minimization of block-to-block movements of YCs. Due to the computational scale of the non-deterministic polynomial (NP) complete problem regarding YC scheduling, a rolling-horizon decision-making strategy is employed to solve this problem, by converting the MIP model into another MIP model in the scheduling of each rolling period. Afterwards, a heuristic algorithm based on modified A* search is developed to solve the converted model and obtain near optimal solution. Finally, the computational experiments are used to examine the performance of the proposed approach for YC scheduling.

Key words: container terminal, yard crane scheduling, mixed integer programming, heuristic algorithm

中图分类号: