Berth allocation at indented berths for mega-containerships

Berth allocation at indented berths for mega-containerships

0.00 Avg rating0 Votes
Article ID: iaor2009515
Country: Netherlands
Volume: 179
Issue: 2
Start Page Number: 579
End Page Number: 593
Publication Date: Jun 2007
Journal: European Journal of Operational Research
Authors: , , ,
Keywords: programming: mathematical
Abstract:

This paper addresses the berth allocation problem at a multi-user container terminal with indented berths for fast handling of mega-containerships. In a previous research conducted by the authors, the berth allocation problem at a conventional form of the multi-user terminal was formulated as a nonlinear mathematical programming, where more than one ship are allowed to be moored at a specific berth if the berth and ship lengths restriction is satisfied. In this paper, we first construct a new integer linear programming formulation for easier calculation and then the formulation is extended to model the berth allocation problem at a terminal with indented berths, where both mega-containerships and feeder ships are to be served for higher berth productivity. The berth allocation problem at the indented berths is solved by genetic algorithms.

Reviews

Required fields are marked *. Your email address will not be published.