The allocation of berths and quay cranes by using a sub-gradient optimization technique

Authors:
Canrong Zhang;Li Zheng;Zhihai Zhang;Leyuan Shi;Aaron J. Armstrong
Affiliations:
Department of Industrial Engineering, Tsinghua University, Beijing 100084, China and Department of Industrial and Systems Engineering, University of Wisconsin-Madison, Madison, WI 53706, USA;Department of Industrial Engineering, Tsinghua University, Beijing 100084, China;Department of Industrial Engineering, Tsinghua University, Beijing 100084, China;Department of Industrial and Systems Engineering, University of Wisconsin-Madison, Madison, WI 53706, USA;Department of Industrial and Systems Engineering, University of Wisconsin-Madison, Madison, WI 53706, USA
Venue:
Computers and Industrial Engineering
Year:
2010

Citing 7
Cited 4

Surrogate gradient algorithm for Lagrangian relaxation

Journal of Optimization Theory and Applications - Special issue in honor of Yu-Chi Ho
Interblock Crane Deployment in Container Terminals

Transportation Science
A stochastic beam search for the berth allocation problem

Decision Support Systems
A tabu search heuristic for the quay crane scheduling problem

Journal of Scheduling
A queuing network model for the management of berth crane operations

Computers and Operations Research
A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning

Computers and Industrial Engineering
The Berth Allocation Problem: A Strong Formulation Solved by a Lagrangean Approach

Transportation Science

An Integrated Model for Berth Template and Yard Template Planning in Transshipment Hubs

Transportation Science
An optimization approach for coupling problem of berth allocation and quay crane assignment in container terminal

Computers and Industrial Engineering
A Framework for Integrated Berth Allocation and Crane Operations Planning in Seaport Container Terminals

Transportation Science
A decision support system for quayside operations in a container terminal

Decision Support Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper examines the allocation of berths and quay cranes for vessels arriving at container terminals. Previous work in this area has either ignored or deemphasized the coverage range limitations of quay cranes or imposed too loose or too rigid assumptions about whether quay cranes can be adjusted during loading and discharging, thus making the extracted models less applicable to the actual situation. This paper takes into consideration the coverage ranges of quay cranes and allows for limited adjustments of quay cranes during loading and discharging. A mixed integer programming model is constructed, and a sub-gradient optimization algorithm is applied to solving the problem. Using actual data, the performance of the algorithm is demonstrated.