[1] Kim K H. Evaluation of the number of re-handles in container yards [J]. Computers and Industrial Engineering (S0360-8352), 1997, 32(4): 701-711.
[2] Kim K H, Park Y M, Ryu K R. Deriving decision rules to locate export containers in container yards [J]. European Journal of Operational Research (S0377-2217), 2000, 124(2): 89-101.
[3] Kim K H, Hong G P. A heuristic rule for relocating blocks [J]. Computers and Operations Research (S0305-0548), 2006, 33(4): 940-954.
[4] 张维英,林焰,纪卓尚,等.出口集装箱堆场取箱作业优化模型研究[J].武汉理工大学学报:交通科学与工程版,2006,30(2):314-317.
Zhang Weiying, Lin Yan, Ji Zhuoshang, et al. Research of optimal formulation of retrieving operation of out-bounding containers in container port [J]. Journal of Wuhan University of Technology: Transportation Science & Engineering, 2006, 30(2): 314-317.
[5] 白治江,王晓峰. 集装箱翻箱优化方案设计[J].水运工程,2008(4):57-61.
Bai Zhijiang, Wang Xiaofeng. Designation of reshuffling optimal solution of containers [J].Water Transportation Engineering, 2008 (4): 57-61.
[6] 李斌.基于动态规划的贝位内集装箱翻箱优化[D].大连:大连海事大学,2011.
Li Bin. The Optimization Research for Container’s Upset Operation within A Container Bay through Dynamic Programming Method [D]. Dalian: Dalian Maritime University, 2011.
[7] 陈庆伟.基于遗传算法的堆场贝位分配优化问题研究[D].青岛:青岛大学,2007.
Chen Qingwei. Research of Bay Allocation Optimization Problem in Terminal Yard based on Genetic Algorithm [D]. Qingdao: Qingdao University, 2007.
[8] 周留井.基于遗传算法的进口箱堆场贝位分配优化模型研究[D].广州:中山大学,2008.
Zhou Liujing. Research of Bay Allocation Optimization Problem in In-Bounding Container Terminal Yard based on Genetic Algorithm [D]. Guangzhou: Zhongshan University, 2008.
[9] 金健.如何减少集装箱箱区两次翻箱[J].集装箱化.2002(1):42-43.
Jing Jian. How to lower the second re-handling in container blocks [J]. Containerized, 2002(1): 42-43.
[10] 金鹏,黄有方,严伟.位内集装箱翻箱操作的启发式优化[J].上海海事大学学报,2009, 30(4):13-16.
Jing Peng, Huang Youfang, Yan Wei. Optimization of heuristic algorithm of container re-handling operation in bays [J]. Journal of Shanghai Maritime University, 2009, 30(4): 13-16
|