Berth allocation in a container port: using a continuous location space approach
نویسندگان
چکیده
This paper addresses the berth allocation problem in a multi-user container terminal. There are two typical schemes for berth allocation: one in discrete locations and the other in continuous locations. The former has the advantage of easiness in scheduling but it has a weakness in that terminal usage is not fully efficient. The latter exhibits the complete opposite characteristics. In previous papers, the authors have developed and presented the discrete location version of the berth allocation problem. In view of the steadily growing trend in increasing the container ship size, more flexible berth allocation planning is mandatory, especially in busy hub ports where ships of various sizes are calling. In this paper, a heuristic for the berth allocation problem in continuous locations is presented. A wide variety of experiments were conducted and the results showed that the heuristic works well from a practical point of view. 2004 Elsevier Ltd. All rights reserved.
منابع مشابه
A new multi-objective model for berth allocation and quay crane assignment problem with speed optimization and air emission considerations (A case study of Rajaee Port in Iran)
Over the past two decades, maritime transportation and container traffic worldwide has experienced rapid and continuous growth. With the increase in maritime transportation volume, the issue of greenhouse gas (GHG) emission has become one of the new concerns for port managers. Port managers and government agencies for sustainable development of maritime transportation considered "green ports" t...
متن کاملA Multi-Objective Decision and Analysis Approach for the Berth Scheduling Problem
Berth scheduling can be described as the resource allocation problem of berth space to vessels in a container terminal. When defining the allocation of berths to vessels container terminal operators set several objectives which ideally need to be optimized simultaneously. These multiple objectives are often non-commensurable and gaining an improvement on one objective often causes degrading per...
متن کاملSimulation-Optimization Models for the Dynamic Berth Allocation Problem
Container terminals are designed to provide support for the continuous changes in container ships. The most common schemes used for dock management are based on discrete and continuous locations. In view of the steadily growing trend in increasing container ship size, more flexible berth allocation planning is mandatory. The consideration of continuous location in the container terminal is a go...
متن کاملMulti-objective Decision and analysis approach for the Berth Scheduling Problem
Berth scheduling can be described as the resource allocation problem of berth space to vessels in a container terminal. When defining the allocation of berths to vessels container terminal operators set several objectives which ideally need to be optimized simultaneously. These multiple objectives are often non-commensurable and gaining an improvement on one objective often causes degrading per...
متن کاملWorking Paper The berth allocation problem with mobile quay walls
The berth allocation problem (BAP), which de nes a processing interval and a berth at the quay wall for each ship to be (un-)loaded, is an essential decision problem for e ciently operating a container port. In this paper we integrate mobile quay walls into the BAP. Mobile quay walls are huge propelled oating platforms, which encase ships moored at the immobile quay and provide additional quay ...
متن کامل