A bi-objective model for robust berth allocation scheduling

Authors:
Lu Zhen;Dao-Fang Chang
Affiliations:
School of Management, Shanghai University, 99 Shangda Road, Shanghai 200444, China;School of Logistics Engineering, Shanghai Maritime University, Shanghai, China
Venue:
Computers and Industrial Engineering
Year:
2012

Citing 5
Cited 1

Models and Tabu Search Heuristics for the Berth-Allocation Problem

Transportation Science
Proactive and reactive strategies for resource-constrained project scheduling with uncertain resource availabilities

Journal of Scheduling
"Squeaky Wheel" optimization

Journal of Artificial Intelligence Research
An Integrated Model for Berth Template and Yard Template Planning in Transshipment Hubs

Transportation Science
The berth planning problem11This research is part of a project the author has with the Port of Singapore Authority. The author was a senior technical consultant in that project. This research was supported in part by the NUS Research Front RP3972679.

Operations Research Letters

A decomposition method to analyze the performance of frame bridge based automated container terminal

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Berth allocation is an important port operation problem for container terminals. This paper studies how to develop a robust schedule for berth allocation that incorporates a degree of anticipation of uncertainty (e.g., vessels' arrival time and operation time) during the schedule's execution. This study proposes a bi-objective optimization model for minimizing cost and maximizing robustness of schedules. A heuristic is also developed for solving the bi-objective model in large-scale problem cases. Numerical experiments are conducted to validate the effectiveness and efficiency of the proposed model and method. Managerial implications are also discussed.