[1] GHAREHGOZLI A H, LAPORTE G, YU Y, et al. Scheduling twin yard cranes in a container block[J]. Transportation Science, 2014, 49(3):686-705.
[2] 祝慧灵,计明军,郭文文,等.基于配载计划的集装箱提箱顺序和倒箱策略优化[J].交通运输 系统工程与信息,2016,16(2):191-199.
ZHU Huiling, JI Mingjun, GUO Wenwen, et al. Optimization of the container retrieving sequence and rehandling strategy based on stowage plan[J]. Journal of Transportation Systems Engineering and Information Technology, 2016, 16(2): 191-199.
[3] 初良勇,阮志毅,李淑娟.基于遗传算法的港口集装箱堆场场桥智能调度优化[J].中国航海, 2018,1:48-52.
CHU Liangyong, RUAN Zhiyi, LI Shujuan. Intelligent scheduling optimization of yard crane in container terminal based on genetic algorithm [J]. Navigation of China, 2018, 1: 48-52.
[4] KIM K Y, KIM K H. A routing algorithm for a single transfer crane to load export containers onto a containership[J]. Computer and Industrial Engineering, 1997, 33 (3/4):673-676.
[5] KIM K H, KIM K Y. An optimal routing algorithm for a transfer crane in port container terminals[J]. Transportation Science, 1999, 33(1):17-33.
[6] GHAREHGOZLI A H, YU Y, DE KOSTER R, et al. An exact method for scheduling a yard crane[J]. European Journal of Operational Research, 2014, 235(2):431-447.
[7] NG W C, MARK K L. An effective heuristic for scheduling a yard crane to handle jobs with different ready times[J]. Engineering Optimization, 2005, 37(8):867-877.
[8] 陈雷雷,乐美龙,黄有方.基于状态节点网络的龙门吊路径优化问题研究[J].运筹与管理, 2016,25(2):82-87.
CHEN Leilei, LE Meilong, HUANG Youfang. Research on container yard crane routing problem based on state-node network optimization[J]. Operations Research and Management Science, 2016, 25(2): 82-87.
[9] VIS I F A, CARLO H J. Sequencing two cooperating automated stacking cranes in a container terminal[J]. Transportation Science, 2010, 44(2): 169-182.
[10] 边展,杨惠云,靳志宏.基于两阶段混合动态规划算法的龙门吊路径优化[J].运筹与管理, 2014,23(3):56-63.
BIAN Zhan, YANG Huiyun, JIN Zhihong. Optimization on loading scheduling for multiple gantry cranes based on two-stage hybrid dynamic programming[J]. Operations Research and Management Science, 2014, 23 (3): 56-63. |