Berth and crane allocation problem based on cost  analysis of quay cranes for container terminal

DONG Pan; HU Zhi-Hua; TAO Sha

doi:10.16411/j.cnki.issn1006-7736.2013.02.016

Journal of Dalian Maritime University >

2013 , Vol. 39 >Issue 2: 60 - 64

DOI: https://doi.org/10.16411/j.cnki.issn1006-7736.2013.02.016

Original Paper

Berth and crane allocation problem based on cost analysis of quay cranes for container terminal

DONG Pan ,
HU Zhi-Hua ,
TAO Sha

Expand

1. Logistics Research Center, Shanghai Maritime University, Shanghai 201306,China;2.School of Economics and Management, Tongji University, Shanghai 200092, China

Received date: 2012-12-25

Online published: 2023-05-26

Fold

Abstract

Aiming at the influence of the quay crane’s operational costs on handing activities, a discrete berth and quay crane integrated mixed integer linear programming model is established. Then a specific example is given to verify the efficiency of the model, and commercial software of operations research is used to find a solution. Through the comparisons among different cost ratios for berthing, the optimal ratio of waiting cost and handing cost is obtained. Based on the settings of cost ratios, the optimal number of total quay cranes is obtained under the consideration of different total numbers of quay cranes lead to different trends of vessel berthing cost. Results indicate that the fixed costs of quay cranes can affect the berth and crane allocation problem.

Key words： container terminal; discrete berth allocation; berth and quay crane allocation; cost analysis; mixed integer linear programming

Cite this article

DONG Pan , HU Zhi-Hua , TAO Sha . Berth and crane allocation problem based on cost analysis of quay cranes for container terminal[J]. Journal of Dalian Maritime University, 2013 , 39(2) : 60 -64 . DOI: 10.16411/j.cnki.issn1006-7736.2013.02.016

References

［1］IMAI A, NAGAIWA K, TAT C W. Efficient planning of berth allocation for container terminals in Asia［J］. Journal of Advanced Transportation, 1997, 31(1): 75-94.

［2］NAM K C, KWAK K S, YU M S. Simulation study of container terminal performance［J］. Transportation Research Part E, 2002, 128(3): 126-132.

［3］DRAGOVIC B, PARK N K, RADMILOVIC Z. Ship-berth link performance evaluation :simulation and analytical approaches［J］. Maritime Policy and Management, 2006, 33(3): 281-299.

［4］IMAI A, NISHIMURA E, PAPADIMITRIOU S. Berthing ships at a multi-user container terminal with a limited quay capacity［J］. Transportation Research Part E, 2008, 44(1): 136-151.

［5］GIALLOMBARDO G, MOCCIA L, SALANI M. The tactical berth allocation problem with quay crane assignment and transhipment-related quadratic yard costs［J］. European Transport Conference, 2008: 1-27.

［6］MEISEL F, BIERWIRTH C. Heuristics for the integration of crane productivity in the berth allocation problem［J］. Transportation Research Part E, 2009, 45(1): 196-209.

［7］LIANG C, HUANG Y. A quay crane dynamic scheduling problem by hybird evolutionary algorithm for berth allocation planning［J］. Computers and Industrial Engineering, 2009, 56(3): 1021-1028.

［8] ZHANG H, KIM K H. Maximizing the number of dual-cycle operations of quay cranes in container terminals［J］. Computers and Industrial Engineering, 2009, 56(3): 979-992.

［9］BIERWIRTH C, MEISEL F. A survey of berth allocation and quay crane scheduling problem in container terminals［J］. European Journal of Operational Research, 2010, 202(3): 615-627.

［10］BUHRKAL K， ZUGLIAN S， ROPKE S. Models for the discrete berth allocation problem: A computational comparison［J］. Transportation Research Part E, 2011, 47(4): 461-473.

［11］MEISEL F, BIERWIRTH C. A unified approach for the evaluation of quay crane scheduling models and algorithms［J］. Computers and Operations Research, 2011, 38(3): 683-693.

［12］JIN Z, LI N. Optimization of quay crane dynamic scheduling based on berth schedules in container terminal［J］. Journal of Transportation Systems Engineering and Information Technology, 2011, 11(3): 58-64.

［13］DEMIRCI E. Simulation modelling and analysis of a port investment［J］. Simulation, 2003, 79(2): 94-105.

［14］KIM K H, PARK Y M. A crane scheduling method for port container terminals［J］. European Journal of Operational Research, 2004, 156(3): 752-768.

［15］CHEN H C, IMAI A, NISHIMURA E. The simultaneous berth and quay crane allocation problem［J］. Transportation Research Part E, 2008, 44(5): 900-920.

［16］BIERWIRTH C, MEISEL F. A fast heuristic for quay crane scheduling with interference constraints［J］. Journal of Scheduling, 2009, 12(4): 345-360.

［17］TAVAKKOLI-MOGHADDAM R, MAKUI A, SALAHI S. An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports［J］. Computers and Industrial Engineering, 2009, 56(1): 241-248.

［18］WANG S, ZHENG J, ZHENG K. Multi resource scheduling problem based on an improved discrete particle swarm optimization［J］. Physics Procedia, 2012, 25: 576-582.

［19］YANG C, WANG X, LI Z. An optimization approach for coupling problem of berth allocation and quay crane assignment in container terminal［J］. Computers and Industrial Engineering, 2012, 63(1): 243-253.

［20］OLIVEIRA R M D, MAURI G R, LORENA L A N. Clustering search for the berth allocation problem［J］. Expert Systems with Applications, 2012, 39(5): 5499-5505.

［21］彭传圣. 岸桥集装箱起重机作业能耗分析［J］. 港口装卸, 2010(5): 8-11. PENG Chuan-sheng. Analysis on operation energy consumption of quayside container crane［J］. Port Operation, 2010(5): 8-11.(in Chinese)

［22］彭传圣. 集装箱码头前沿设备配置数量研究［J］. 集装箱化, 2005(7): 23-27. PENG Chuan-sheng. Container terminal apron number of device configuration ［J］. Containerization, 2005(7): 23-27.(in Chinese)

Options

Outlines

模态框（Modal）标题

Abstract

Cite this article

References