HKUST Library Institutional Repository Banner

HKUST Institutional Repository >
Industrial Engineering and Logistics Management >
IELM Master Theses  >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1783.1/4928
Title: The berth allocation problem : models and solution methods
Authors: Guan, Yong-Pei
Issue Date: 2001
Abstract: 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.
Description: Thesis (M.Phil.)--Hong Kong University of Science and Technology, 2001
ix, 58 leaves : ill. ; 30 cm
HKUST Call Number: Thesis IEEM 2001 Guan
URI: http://hdl.handle.net/1783.1/4928
Appears in Collections:IELM Master Theses

Files in This Item:

File Description SizeFormat
th_redirect.html0KbHTMLView/Open

All items in this Repository are protected by copyright, with all rights reserved.