Scheduling optimization of yard crane for import containers based on truck batch arrival pattern

被引：0
|
作者：
Shao Q.-Q. [1 ]
Xu T.-T. [2 ]
Yang H.-Y. [3 ]
Jin Z.-H. [1 ]
机构：
[1] College of Transportation Management, Dalian Maritime University, Dalian
[2] Zhejiang Maritime Safety Administration of People's Republic of China, Hangzhou
[3] Dalian Port Logistics Technology Co Ltd, Dalian
来源：
Jin, Zhi-Hong (jinzhihong@dlmu.edu.cn) | 1654年 / Northeast University卷 / 31期
关键词：
Batch arrival; Container; Relocation; Yard crane scheduling;
D O I：
10.13195/j.kzyjc.2015.0875
中图分类号：
学科分类号：
摘要：
In the configuration process of import containers, external trucks who serve the same customer own the same arrival time, therefore the trucks' arrival regularity present the characteristics of arrival in batch. The task assignment for trucks in the same batch will directly affect the operation efficiency of the corresponding yard crane, which implies the large optimization space. To solve this problem, based on the actual constraint that relocation operation can not be carried out across different bays, the yard crane scheduling is deconstructed into moving path scheduling and relocation scheduling. Accordingly, the mathematical optimization model for these two parts are formulated respectively. In order to get the optimal solution of the yard crane moving path optimization model, a polynomial time algorithm is developed and two auxiliary theorems are proved to support it. Meanwhile, a bilevel heuristic algorithm based on memory simulated annealing is developed to obtain satisfying solutions of the relocation optimization model. Experimental results show the effectiveness and robust of the optimization models and algorithms. © 2016, Editorial Office of Control and Decision. All right reserved.
引用
收藏
页码：1654 / 1662
页数：8
相关论文
共 20 条
  • [1] Kim K.Y., Kim K.H., A routing algorithm for a single transfer crane to load export containers onto a containership, Computers & Industrial Engineering, 33, 3-4, pp. 673-676, (1997)
  • [2] Kim K.H., Kim K.Y., An optimal routing algorithm for a transfer crane in port container terminals, Transportation Science, 33, 1, pp. 17-33, (1999)
  • [3] Kim K.Y., Kim K.H., Heuristic algorithm for routing yardside equipment for minimizing loading times in container terminals, Naval Research Logistics, 50, 5, (2003)
  • [4] Narasimhan A., Palekar U.S., Analysis and algorithms for the transtainer routing problem in container port operations, Transportation Science, 36, 1, pp. 63-78, (2002)
  • [5] Ng W.C., Mark K.L., Yard crane scheduling in port container terminals, Applied Mathematical Modelling, 29, 3, pp. 263-276, (2005)
  • [6] Li W., Wu Y., Petering M.E.H., Et al., Discrete time model and algorithms for container yard crane scheduling, European J of Operational Research, 198, 1, pp. 165-172, (2009)
  • [7] Jiang X., Lee L.H., Chew E.P., Et al., A container yard storage strategy for improving land utilization and operation efficiency in a transshipment hub port, European J of Operational Research, 221, 1, pp. 64-73, (2012)
  • [8] Yu M., Qi X., Storage space allocation models for inbound containers in an automatic container terminal, European J of Operational Research, 226, 1, pp. 32-45, (2013)
  • [9] Zheng H.X., Yu K., Yard crane scheduling in the mixture storage block based on hybrid genetic algorithm, J of Transportation Systems Engineering and Information Technology, 13, 5, pp. 150-158, (2013)
  • [10] Watanabe I., Characteristics and analysis method of efficiencies of container terminal: An approach to the optimal loading/unloading method, Container Age, 3, pp. 36-47, (1991)
12