The Dynamic Berth Allocation Problem: A linearized formulation

Ahmed Simrin, Ali Diabat

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish (US)
Pages (from-to)473-494
Number of pages22
JournalRAIRO - Operations Research
Volume49
Issue number3
DOIs
StatePublished - Jul 1 2015

Keywords

  • Container terminal
  • Dynamic berth allocation
  • Linear program
  • Non-linear program

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science Applications
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'The Dynamic Berth Allocation Problem: A linearized formulation'. Together they form a unique fingerprint.

Cite this