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

Authors:
Lu Zhen;Ek Peng Chew;Loo Hay Lee
Affiliations:
School of Management, Shanghai University, 200444 Shanghai, China;Department of Industrial and Systems Engineering, National University of Singapore, Singapore 119260, Republic of Singapore;Department of Industrial and Systems Engineering, National University of Singapore, Singapore 119260, Republic of Singapore
Venue:
Transportation Science
Year:
2011

Citing 10
Cited 2

An approach to determine storage locations of containers at seaport terminals

Computers and Operations Research
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 queuing network model for the management of berth crane operations

Computers and Operations Research
A genetic algorithm to solve the storage space allocation problem in a container terminal

Computers and Industrial Engineering
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
The allocation of berths and quay cranes by using a sub-gradient optimization technique

Computers and Industrial Engineering
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 multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis

Operations Research Letters

A bi-objective model for robust berth allocation scheduling

Computers and Industrial Engineering
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

This paper studies two tactical level decision problems arising in transshipment hubs: berth template planning that is concerned with allocating berths and quay cranes to arriving vessels, and yard template planning that is concerned with assigning yard storage locations to vessels. These two tactical level decisions interact with each other. A mixed-integer programming model is proposed to integrate the berth template and the yard template planning with the aim to minimize the service cost that is incurred by the deviation from vessels' expected turnaround time intervals, and the operation cost that is related to the route length of transshipment container flows in yard. Moreover, a heuristic algorithm is developed for solving the problem in large-scale realistic environments. Numerical experiments are conducted to prove the necessity of the proposed model and also validate the efficiency of the proposed heuristic algorithm. For a set of real-world like instances, the heuristic algorithm can obtain good berth and yard templates within a reasonable time.