基于泊位偏好与岸桥干扰的泊位和岸桥分配

运筹与管理 ›› 2014, Vol. 23 ›› Issue (1): 90-100.

基于泊位偏好与岸桥干扰的泊位和岸桥分配

乐美龙, 刘秀玲

上海海事大学物流研究中心,上海 201306

收稿日期:2012-06-18 出版日期:2014-01-25
作者简介:乐美龙(1964-),男,浙江宁波人,博士,教授,主要从事港口运作作业链一体化方面的研究;刘秀玲(1987-),女,河南安阳人,硕士研究生,主要从事港口运作作业链一体化方面的研究。
基金资助:
上海市自然科学基金创新行动计划资助项目(10190502500);上海市科委工程中心基金资助项目(09DZ2250400)

Berth and Quay Crane Allocation Considering Berth Preference and Quay Crane Interference

LE Mei-long, LIU Xiu-ling

Logistics Research Center, Shanghai Maritime University, Shanghai 201306, China

Received:2012-06-18 Online:2014-01-25

摘要/Abstract

摘要： 泊位和岸桥是集装箱港口资源中最紧缺的资源,合理的泊位分配和岸桥调度可以提高集装箱港口的资源利用率和港口的运作效率和效益。针对泊位偏离和岸桥工作损失两个因素,文章建立了集装箱港口泊位和岸桥的混合整数线性规划模型;运用采集自宁波某典型集装箱港口的数据,用Gurobi优化软件和两阶段启发式算法对模型进行了求解;对计算结果进行了经济性分析。计算结果表明:该港口的岸线资源利用率为46%时,1000m~1600m基本没被利用;18台岸桥要比16台岸桥的目标值更优,求解时间更短,而且18台岸桥的平均利用率为80%,为此,建议该港口再增加两台岸桥。同时发现:随着船舶规模的增加,Gurobi优化求解的时间增长较快,而两阶段启发式算法仍能在很短时间内求得准优解。

关键词: 泊位分配, 岸桥分配, 集装箱港口优化, 两阶段启发式算法, 集装箱港口经济性分析

Abstract: Berth and quay crane(QC)are the most important scarce resource in the container terminal. Reasonable berth allocation and quay crane scheduling can improve utilization of the resources and port operation effectiveness and efficiency. The paper firstly presents the integrated MILP model of both berth allocation and QC scheduling based on the deviation from the berth preference position and capacity loss of the QC. Then, using the data from a container terminal in Ningbo and Gurobi optimization solver, we solve the model. Finally the computational result is economically analyzed. The computational results show that the mean utilization rate of berth line of this port is 46%. Among them, the berth line from 1000 to 1600 meter is hardly used, and deploying 18 QCs is better than deploying 16 QCs in the terminal. The mean utilization rate of deploying 18 QCs is 80%, so the paper suggests the port should have two more QCs. Meanwhile we find that as vessels increase, the solving time by Gurobi increases quickly. At the same time, our method, so called two stage heuristic method, can still give the quasi-optimal solution in very short time.

Key words: Berth allocation, quay crane allocation, port operation optimization, two stage heuristic algorithm, the economical analysis of the container terminal

中图分类号:

U691.3

乐美龙, 刘秀玲. 基于泊位偏好与岸桥干扰的泊位和岸桥分配[J]. 运筹与管理, 2014, 23(1): 90-100.

LE Mei-long, LIU Xiu-ling. Berth and Quay Crane Allocation Considering Berth Preference and Quay Crane Interference[J]. Operations Research and Management Science, 2014, 23(1): 90-100.

参考文献

[1] Frank Meisel, Christian Bierwirth. A survey of berth allocation and quay crane scheduling problems in container terminals[J]. European Journal of Operational Research, 2010, (202): 615-627.
[2] Akio Imai, Etsuko Nishimura, Stratos Papadimitriou. The dynamic berth allocation problem for a container port[J]. Transportation Research Part E, 2001, (35): 401-417.
[3] Akio Imai, Etsuko Nishimura, Stratos Papadimitriou. Berth allocation with service priority[J]. Transportation Research Part B, 2003, (37): 437-457.
[4] Akio Imai, Etsuko Nishimura, Masahiro Hattori, Stratos Papadimitriou. Berth allocation at indented berths for mega-containerships[J]. European Journal of Operational Research, 2007, (179): 579-593.
[5] Akio Imai, Etsuko Nishimura, Stratos Papadimitriou. Berthing ships at a multi-user container terminal with a limited quay capacity[J]. Transportation Research Part E, 2008, (44): 136-151.
[6] Der-Horng Lee, Jiang Hang Chen, Jin Xin Cao. The continuous berth allocation problem: a greedy randomized adaptive search solution[J]. Transportation Research Part E, 2010, (46): 1017-1029.
[7] Akio Imai, Xin Sun, Etsuko Nishimura, Stratos Papadimitriou. Berth allocation in a container port: Using a continuous location space approach[J]. Transportation Research Part B, 2005, (39): 199-221.
[8] R Tavakkoli-Moghaddam, Makui, Salahi, Bazzazi. An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports[J]. Computers & Industrial Engineering, 2009, (56): 241-248.
[9] Frank Meisel, Christian Bierwirth. Heuristics for the integration of crane productivity in the berth allocation problem[J]. Transportation Research Part E, 2009, (45): 196-209.
[10] 赵坤强,韩晓龙,梁承姬.连续泊位下集装箱港口泊位与桥吊协同调度优化研究[J].武汉理工大学学报,2011,11(33):60-65.
[11] 乐美龙,刘菲.基于Memetic算法的泊位和岸桥分配问题[J].武汉理工大学,2011,11(33):66-71.
[12] Akio Imai, Hsieh Chia Chen, Etsuko Nishimura, Stratos Papadimitriou. The simultaneous berth and quay crane allocation problem[J]. Transportation Research Part E, 2008, (44): 900-920.
[13] Kap Hwan Kim, Young-Man Park. A scheduling method for berth and quay cranes[J]. OR Spectrum, 2003, (25): 1-23.
[14] Der-Horng Lee, Hui Qiu Wang.Integrated discrete berth allocation and quay crane scheduling in port container terminals[J]. Engineering Optimization, 2010, 42(8): 747-761.
[15] Chengji Liang, Youfang Huang, Yang Yang. A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning[J]. Computers & Industrial Engineering, 2009, (56): 1021-1028.