Please use this identifier to cite or link to this item:

The berth allocation problem : models and solution methods

Authors Guan, Yong-Pei
Issue Date 2001
Summary We consider the problem of allocating vessels to a berth in a container terminal with the objective of minimizing total weighted berthing duration time of all vessels. Two mathematical formulations are developed to provide a guideline for a branch and bound method and offer a relatively efficient lower bound generated by a Lagrangian relaxation method respectively. The branch and bound method is developed to solve small-sized(15 vessels or so) problems. For large-sized problems, we develop a heuristic method based on multiprocessor task scheduling model with the consideration of consecutive processors requirement. Then we perform worst case analysis for two different types of weights. We also suggest a neighboring search algorithm to improve solution quality. The computational experiments show the efficiency of our solution approaches.
Note Thesis (M.Phil.)--Hong Kong University of Science and Technology, 2001
Language English
Format Thesis
Access View full-text via DOI
Files in this item:
File Description Size Format
th_redirect.html 341 B HTML
Copyrighted to the author. Reproduction is prohibited without the author’s prior written consent.