Journal of Guangxi Normal University(Natural Science Edition) ›› 2016, Vol. 34 ›› Issue (2): 81-89.doi: 10.16088/j.issn.1001-6600.2016.02.012

Previous Articles     Next Articles

A Quay Crane Scheduling of Group-based Strategy and DirectTransshipment at Automated Container Terminal

ZHOU Xiudan, HU Zhihua, WEI Chen   

  1. Logistics Research Center, Shanghai Maritime University, Shanghai 201306, China
  • Received:2015-11-22 Published:2018-09-14

Abstract: Aiming at the quay crane scheduling problem of group-based strategy and direct transshipment at automated container terminal, this paper studies the relationship of the completion time of transfer process, the waiting time of quay cranes and the number of container blocks is studied in this paper. First of all, an optimization model is established to minimize the makespan. Then, based on this model, a multi-objective model is established to minimize the makespan and the waiting time of quay crane. Through numerical examples, in the case of different container groups, the completion time and the starting time of the container group are obtained, and the influence of the number of containers on the time of transfer and the waiting time of quay crane is analyzed, which extends the research of quay crane scheduling and provides a reference for the operation of container terminal.

Key words: automated container terminal, group-based strategy, direct transshipment, quay crane
scheduling

CLC Number: 

  • U693.35
[1] 匡海波, 牛文元. 集装箱港口多期投资优化决策模型研究[J]. 管理科学学报, 2012, 15(5):76-82.
[2] 董岗, 朱道立. 港口集疏运通道投资与多车型拥挤收费均衡[J]. 管理科学学报, 2013, 16(5):83-94.
[3] WU Yue, LUO Jiabin, ZHANG Dali, et al. An integrated programming model for storage management and vehicle scheduling at container terminals[J]. Research in Transportation Economics, 2013,42(1):13-27. DOI:10.1016/j.retrec.2012.11.010.
[4] FU Yimin, DIABAT A, TSAI I T. A multi-vessel quay crane assignment and scheduling problem:Formulation and heuristic solution approach[J]. Expert Systems with Applications, 2014, 41(15):6959-6965. DOI:10.1016/j.eswa.2014.05.002.
[5] TIERNEY K, PACINO D, JENSEN R M. On the complexity of container stowage planning problems[J]. Discrete Applied Mathematics, 2014, 169:225-230. DOI:10.1016/j.dam.2014.01.005.
[6] CARLO H J, VIS I F A, ROODBERGEN K J. Storage yard operations in container terminals:Literature overview, trends, and research directions[J]. European Journal of Operational Research, 2014, 235(2):412-430. DOI:10.1016/j.ejor.2013.10.054.
[7] 毛钧,李娜,靳志宏.基于混堆模式的集装箱码头堆场空间资源配置优化[J]. 大连海事大学学报, 2014,40(1):117-122. DOI:10.16411/j.cnki.issn1006-7736.2014.01.017.
[8] 魏航.集装箱码头堆场取箱时间窗优化研究[J].管理科学学报,2011,14(9):21-36.
[9] 孙凯.关于集装箱码头前沿操作工艺应对船舶大型化的研究[J]. 中国远洋航务, 2015(1):60-62.
[10] 林浩,唐勤华.新型集装箱自动化码头装卸工艺方案探讨[J]. 水运工程, 2011(1):158-163. DOI:10.16233/j.cnki.issn1002-4972.2011.01.004.
[11] 郑见粹,李海波,谢文宁,等. 自动化集装箱码头装卸工艺系统比较研究[J].水运科学研究, 2011(2):26-33.
[12] 邢曦文, 毛钧, 张睿,等. 基于混合流水作业组织的集装箱码头装卸作业集成调度优化[J]. 中国管理科学, 2014, 22(10):97-105.
[13] 范志强, 乐美龙. 最小化最大完工时间与等待时间的岸桥作业调度双目标优化及其遗传算法[J]. 系统管理学报, 2013, 22(1):120-127.
[14] ZHANG Haipeng, KIM K H. Maximizing the number of dual-cycle operations of quay cranes in container terminals[J]. Computers & Industrial Engineering, 2009, 56(3):979-992. DOI:10.1016/j.cie.2008.09.008.
[15] DIABAT A, THEODOROU E. An integrated quay crane assignment and scheduling problem[J]. Computers & Industrial Engineering, 2014, 73:115-123. DOI:10.1016/j.cie.2013.12.012.
[16] FU Yimin, DIABAT A. A lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem[J]. Applied Mathematical Modelling, 2015, 39(3/4):1194-1201. DOI:10.1016/j.apm.2014.07.006.
[17] NGUYEN S, ZHANG Mengjie, JOHNSTON M, et al. Hybrid evolutionary computation methods for quay crane scheduling problems[J]. Computers & Operations Research, 2013, 40(8):2083-2093. DOI:10.1016/j.cor.2013.03.007.
[18] EXPÓSITO-IZQUIERDO C, GONZÁLEZ-VELARDE J L, MELIÁN-BATISTA B, et al. Hybrid estimation of distribution algorithm for the quay crane scheduling problem[J]. Applied Soft Computing, 2013, 13(10):4063-4076. DOI:10.1016/j.asoc.2013.05.006.
[19] KAVESHGAR N, HUYNH N, RAHIMIAN S K. An efficient genetic algorithm for solving the quay crane scheduling problem[J]. Expert Systems with Applications, 2012, 39(18):13108-13117. DOI:10.1016/j.eswa.2012.05.091.
[20] HOMAYOUNI S M, TANG S H, MOTLAGH O, A genetic algorithm for optimization of integrated scheduling of cranes, vehicles, and storage platforms at automated container terminals[J]. Journal of Computational and Applied Mathematics, 2014, 270:545-556. DOI:10.1016/j.cam.2013.11.021.
[21] CHEN Jianghang, LEE D H, GOH M. An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem[J]. European Journal of Operational Research, 2014, 232(1):198-208. DOI:10.1016/j.ejor.2013.06.051.
No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!