集装箱港口龙门吊配置优化研究  

Yard Crane Allocation and Optimization in Container Terminal

作　　者：韩晓龙[1] 丁以中[1] 

机构地区：[1]上海海事大学,上海200135

出　　处：《中国航海》2008年第1期6-8,14,共4页Navigation of China

基　　金：国家自然科学基金资助项目(70371012);上海市教委资助项目(06FZ010)

摘　　要：为提高整个港口的作业效率,讨论了集装箱港口装卸过程中的龙门吊配置优化问题,建立了龙门吊配置优化的两阶段规划模型。第1阶段模型中将龙门吊配置问题抽象为网络最小流问题,建立了用于确定按时完成任务计划所需要的龙门吊最小配置数量的规划模型,第2阶段模型在第1阶段模型的基础上对龙门吊的任务分配进行优化,使龙门吊的行走时间最短。对模型求解可以得到龙门吊的配置数量以及各龙门吊的任务分配。最后通过一个算例说明了模型是有效的。To improve operation efficiency of container terminals, yard cranes allocation and optimization in loading/ unloading process is discussed. The two-phase models are presented. In the first phase, the yard crane allocation problem is described as a network minimum flow problem. A model with a minimum number of yard cranes needed to complete tasks on time is setup. The second phase model is to optimize assignment of the tasks so as to minimize the yard cranes＇ running distances. A numerical example is given to Drove the models.

关 键 词：水路运输 集装箱港口 龙门吊 最小流 分派问题 

分 类 号：U691.73[交通运输工程—港口、海岸及近海工程]