Berth allocation at indented berths for mega-containerships

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 nonl...

Full description

Saved in:
Bibliographic Details
Published inEuropean journal of operational research Vol. 179; no. 2; pp. 579 - 593
Main Authors Imai, Akio, Nishimura, Etsuko, Hattori, Masahiro, Papadimitriou, Stratos
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 01.06.2007
Elsevier
Elsevier Sequoia S.A
SeriesEuropean Journal of Operational Research
Subjects
Allocations
Applied sciences
Berth allocation
Container terminal
Container transportation
Containerization
Exact sciences and technology
Genetic algorithms
Inventory control, production control. Distribution
Linear programming
Mathematical programming
Mega-containership
Operational research and scientific management
Operational research. Management science
Studies
Mega-containership
Container terminal
Container transportation
Berth allocation
Mathematical programming
Productivity
Linear programming
Numerical method
Non linear programming
Indentation
Integer programming
Container
Genetic algorithm
Feeder
Ship
Online AccessGet full text

Cover

More Information
Summary: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. A wide variety of numerical experiments were conducted and interesting findings were explored.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2006.03.034