Volume 49, Number 3, July-September 2015
|Page(s)||473 - 494|
|Published online||06 February 2015|
The Dynamic Berth Allocation Problem: A linearized formulation
Department of Engineering Systems & Management, Masdar Institute of Science & Technology, Abu Dhabi, United Arab Emirates.
Received: 2 January 2014
Accepted: 3 July 2014
International shipping is a multi-billion dollar business which has undergone significant growth during the last decade. Considerable benefits could be gained by improving and optimizing container terminal operations. One specific challenge facing container terminals is the berth allocation problem, referred to as (BAP). In this paper, a new formulation is proposed for the dynamic berth allocation problem (DBAP). Initially the problem was formulated as a non-linear mixed integer program, followed by incorporating techniques to present an equivalent mixed integer program (MIP). A genetic algorithm (GA) heuristic was developed and applied to different instances of the problems, and through computational experiments the best, average, and worst case performances were analyzed to determine the efficiency of the algorithms.
Mathematics Subject Classification: 90Bxx
Key words: Container terminal / linear program / non-linear program / dynamic berth allocation
© EDP Sciences, ROADEF, SMAI, 2015
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.