Simulation-Optimization Models for the Dynamic Berth Allocation Problem

This article addresses the berth allocation problem with continuous dock, which is called dynamic berth allocation problem. In view of the steadily growing trend in increasing container ship size, more flexible berth allocation planning is mandatory. The article discusses how container terminals (CTs) are designed to provide support for the continuous changes in container ships. The most common schemes used for dock management are based on discrete and continuous locations and the consideration of continuous location in the CT is a good option. The article proposes a mathematical model that develops a heuristic procedure, which is based on a genetic algorithm, in order to solve the corresponding mixed integer problem. The article discusses how allocation planning aims to minimize distances traveled by the forklifts and the quay crane, for container loading and unloading operations for each ship, according to the quay crane scheduling. Arena software and experimental analysis are used to create simulations for the most important CT in Spain.

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01496593
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Oct 24 2013 2:06PM