A Time-Space Diagram for Solving Dynamic Berth Allocation Problem at Container Terminal

As one of the most essential parts of the container transportation and optimization, the berth allocation problem is to assign a berthing position and a berthing time to every ship at a container terminal. In this paper, the authors consider a dynamic arrival of ships with discrete layout, that is, fixed arrival time are given for the ships, hence ships cannot berth before the expected arrival time and only one ship can be served at each single berth at a time. Aiming at minimizing the total service time (including handing time and waiting time) of all ships, where the handling time is decided by the ship's tonnage and handling efficiency, the actual physical condition of the berths and ships are carefully considered. An optimization model with time-space diagram is proposed and a genetic algorithm is developed to solve it. A numerical experiment is conducted and shows that the genetic algorithm performs well and could be helpful in the efficient management of the container terminals.

Language

  • English

Media Info

  • Media Type: Digital/other
  • Features: References;
  • Pagination: pp 2316-2321
  • Monograph Title: ICTE 2011

Subject/Index Terms

Filing Info

  • Accession Number: 01447435
  • Record Type: Publication
  • ISBN: 9780784411841
  • Files: TRIS, ASCE
  • Created Date: Aug 19 2011 4:43PM