集装箱港口泊位配置优化  

Optimization of Berth Allocation Problem in Container Terminals

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

机构地区：[1]上海海事大学经济管理学院,上海200135

出　　处：《系统工程理论方法应用》2006年第3期275-278,共4页Systems Engineering Theory·Methodology·Applications

基　　金：国家自然科学基金资助项目(70371012);上海市重点学科建设资助项目(T0602)

摘　　要：基于泊位资源关系到整个集装箱港口的作业效率,将泊位配置问题抽象为二维装箱问题,建立了同时考虑泊位和桥吊资源的整数规划模型,模型的目标函数是广义时间最短。由于问题的NP性,给出了模型的回溯算法,并通过一个算例证明了该模型和算法的有效性。As a precious resource in container terminals, berth has much impact on the efficiency of the container terminal. In this paper, berth allocation problem is abstracted as package problem, and an integer model is presented which considered simultaneously berth and quay cranes. The objective of the model is to minimize the generalized time. Because of the problem＇s NP property, a trace method is applied to obtain the near-optimal solution. Finally, the model and trace method are proved efficient by a numerical example.

关 键 词：集装箱港口 泊位配置 装箱问题 回溯法 

分 类 号：F502[经济管理—产业经济]