Simultaneous Allocation of Berths and Quay Cranes under Discrete Berth Situation

This paper examines the simultaneous allocation of berths and quay cranes under discrete berth situation in container terminals. The berths of discrete type have been broadly applied in realistic production especially for the terminals whose berths are not aligned in a straight line. The typical features of such berths including wharf length constraints, water depth constraints, and berth-bound quay cranes have been considered in this paper. In contrast to the previous work which only deployed the number of quay cranes besides the assignment of berths, this paper assigns berths and quay cranes simultaneously. In addition, to better fit the realistic production, some practical features related to quay cranes including the interference between quay cranes, the berth-dependent productivity of quay cranes, and limited adjustments of the assigned quay cranes during operations have also been considered in this paper. An integer programming model is formulated for this problem, and a sub-gradient-based Lagrangian relaxation algorithm is proposed. A simple but efficient greedy insertion heuristics is developed to solve the decomposed primal problems to optimality. Based on actual data, numerical experiments are conducted to test the performance of the proposed algorithm.

[1]  Jesper Larsen,et al.  Models for the discrete berth allocation problem: A computational comparison , 2011 .

[2]  Pasquale Legato,et al.  Berth planning and resources optimisation at a container terminal via discrete event simulation , 2001, Eur. J. Oper. Res..

[3]  Kap Hwan Kim,et al.  A crane scheduling method for port container terminals , 2004, Eur. J. Oper. Res..

[4]  Akio Imai,et al.  The simultaneous berth and quay crane allocation problem , 2008 .

[5]  Li-feng Xi,et al.  A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time , 2010, Eur. J. Oper. Res..

[6]  Akio Imai,et al.  Berth allocation at indented berths for mega-containerships , 2007, Eur. J. Oper. Res..

[7]  Kap Hwan Kim,et al.  Berth scheduling by simulated annealing , 2003 .

[8]  K. L. Mak,et al.  Quay crane scheduling in container terminals , 2006 .

[9]  Andrew Lim,et al.  A stochastic beam search for the berth allocation problem , 2007, Decis. Support Syst..

[10]  Roberto Musmanno,et al.  A queuing network model for the management of berth crane operations , 2008, Comput. Oper. Res..

[11]  Christian Bierwirth,et al.  A survey of berth allocation and quay crane scheduling problems in container terminals , 2010, Eur. J. Oper. Res..

[12]  Youfang Huang,et al.  A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning , 2009, Comput. Ind. Eng..

[13]  Iris F. A. Vis,et al.  Transshipment of containers at a container terminal: An overview , 2003, Eur. J. Oper. Res..

[14]  Changchun Liu,et al.  A Decision Model for Berth Allocation Under Uncertainty Considering Service Level Using an Adaptive Differential Evolution Algorithm , 2016, Asia Pac. J. Oper. Res..

[15]  Lixin Miao,et al.  Quay crane scheduling with handling priority in port container terminals , 2008 .

[16]  Lixin Miao,et al.  Quay crane scheduling with non-interference constraints in port container terminals , 2008 .

[17]  Changchun Liu,et al.  Behavior perception-based disruption models for berth allocation and quay crane assignment problems , 2016, Comput. Ind. Eng..

[18]  Stefan Voß,et al.  Operations research at container terminals: a literature update , 2007, OR Spectr..

[19]  Daofang Chang,et al.  Integrating Berth Allocation and Quay Crane Assignments , 2010 .

[20]  Maria Flavia Monaco,et al.  The Berth Allocation Problem: A Strong Formulation Solved by a Lagrangean Approach , 2007, Transp. Sci..

[21]  Leyuan Shi,et al.  The allocation of berths and quay cranes by using a sub-gradient optimization technique , 2010, Comput. Ind. Eng..

[22]  Akio Imai,et al.  BERTH ALLOCATION IN A CONTAINER PORT: USING A CONTINUOUS LOCATION SPACE APPROACH , 2005 .

[23]  M. F. Monaco,et al.  A tabu search heuristic for the quay crane scheduling problem , 2007 .

[24]  Christian Bierwirth,et al.  A fast heuristic for quay crane scheduling with interference constraints , 2009, J. Sched..

[25]  Kap Hwan Kim,et al.  Berth scheduling for container terminals by using a sub-gradient optimization technique , 2002, J. Oper. Res. Soc..

[26]  Lei Wang,et al.  Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures , 2006 .

[27]  R. Gomory,et al.  Multistage Cutting Stock Problems of Two and More Dimensions , 1965 .