交通运输工程学报
JOURNAL OF TRAFFIC AND TRANSPORTATION ENGINEERING
2005 Vol.5 No.1 P.70-74


码头堆场龙门起重机动态配置优化模型

Crane dynamic deployment model of container storage yard

李建忠 

摘 要:为了优化轮胎式龙门起重机的动态配置,建立一个多目标非线性数学规划模型,以各箱区总的未按计划完成工作箱量所需的龙门起重机时间和龙门起重机闲置时间的最小化为目标函数,采用基于启发式方法的Lagrangian松弛算法,求取轮胎式龙门起重机的动态配置近似最优解.算例测试表明,算法的平均相对对偶间隙为1%,平均计算时间为4 min,这种方法对于港口堆场内轮胎式龙门起重机的动态优化配置是有效的.
关键词:港口;堆场;集装箱;龙门起重机;拉格朗日松弛算法;配置
分类号:U653.921 文献标识码:A

文章编号:1671-1637(2005)01-0070-05

基金项目:国家自然科学基金项目(70371012)
作者简介:李建忠(1980-),男,河北沧州人,上海海事大学硕士研究生,从事港口资源配置研究.
作者单位:李建忠(上海海事大学,经济管理学院,上海,200135) 

参考文献:

[1]周秀菁.码头堆场设备选型[J].集装箱化,2002,5(6):33-34.ZHOU Xiu-jing. Selection of yard machine in port[J]. Containerization, 2002, 5(6):33-34. (in Chinese)
[2]刘刚,宋德星.西部水路集装箱堆场门式起重机选型[J].交通运输工程学报,2001,1(4):111-114.LIU Gang, SONG De-xing. Approach to type selection for container stack gantry crane in waterway port in west of China[J].Journal of Traffic and Transportation Engineering, 2001, 1(4):111-114. (in Chinese)
[3]Lai K K,Lam K. A study of container yard equipment allocation strategy in Hongkong [J]. International Journal of Modeling and Simulation,1994,14(3):134-138.
[4]Ballis A. A container terminal simulation model with animation capabilities [J]. Journal of Advanced Transportation,1996,30(1):37-55.
[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]Kozan P. Genertic algorithm to schedule container transfer at multimodal terminals[J]. International Transportation in Operational Research , 1999,6(3): 311-328.
[7]Fisher M L. The Lagrangian relaxation method for solving interger programming problem[J]. Management Science, 1981,27(1):1-18.
[8]Geoffrion A M. Lagrangian relaxation for interger programming[J]. Mathematical Programming Study, 1974, 29 (6):82-114.
[9]Luh P B, Hoitomt D J. Scheduling of manufacturing systems using the Lagrangian relaxation technique[J]. IEEE Transactions on Automatic Control, 1993,38(7):1 066-1 079.
[10]Pirkul H,Schilling D A. An efficient procedure for designing single allocation hub and spoke systems[J]. Management Science, 1991,44(12):235-242.
[11]Polyak B T. Minimization of unsmooth functionals[J]. USSR Computational Mathematics and Mathematical Physics, 1969,9(6):14-29.
[12]王朝晖,甘文泉,陈浩勋,等.具有模糊缓冲库存约束的化工批处理过程的调度[J].系统工程理论与实践,1998,8(7):63-67.WANG Zhao-hui, GAN Wen-quan, CHEN Hao-xun, et al.Batch chemical processes scheduling with fuzzy constraints [J]. System Engineering Theory and Practice, 1998, 8 (7):63-67. (in Chinese)
[13]唐立新,杨自厚,王梦光.新的Lagrangian松弛法求解CLSP问题[J].系统工程学报,1999,14(1):11-13.TANG Li-xin,YANG Zi-hou,WANG Meng-guang. New Lagrangian relaxation algorithms to solve CLSP[J]. Journal of System Engineering,1999,14(1):11-13. (in Chinese)

收稿日期:2004年11月21日

出版日期:2005年3月1日