Study on berth planning problem in a container seaport: Using an integrated programming approach

Authors:
Liying Song;Tom Cherrett;Wei Guan
Affiliations:
School of Traffic and Transportation, Beijing Jiaotong University, Beijing, 100044, China;Department of Civil Engineering and the Environment, University of Southampton, Southampton SO17 1BJ, United Kingdom;School of Traffic and Transportation, Beijing Jiaotong University, Beijing, 100044, China
Venue:
Computers and Industrial Engineering
Year:
2012

Citing 4
Cited 0

A stochastic beam search for the berth allocation problem

Decision Support Systems
Models and Tabu Search Heuristics for the Berth-Allocation Problem

Transportation Science
A tabu search heuristic for the quay crane scheduling problem

Journal of Scheduling
A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper provides an integrated solution for two common processes in a container seaport: namely, the Berth Allocation Process (BAP) and the Crane Scheduling Process (QCSP). These are formulated through a Bi-Level Programming (BLP) approach, which is used to characterize the highly interrelated relationships between the two processes and simultaneously, identify an integrated solution for both. The upper-level problem (BAP) is termed 'NP-hard' as its computational complexity increases exponentially with the number of incoming ships for mooring, while the lower-level problem (QCSP) is a mixed-integer linear program. A revised genetic algorithm and a branch-and-bound method (B&B) are then applied for the solutions of upper and lower level problems, respectively.