The Berth Allocation Problem: A Formulation Reflecting Service Delay Penalties and Early Premiums

The berth-allocation problem (BAP) aims to optimally schedule and assign ships to berthing areas along a quay. In this paper the dynamic BAP (DBAP) is formulated as a linear MIP problem with the objective to simultaneously minimize the cost from ships’ late departures and maximize the benefits from ships’ early departures. These dates may be determined through contractual agreements between the port operator and the carrier, in terms of time of departure after the ship’s arrival at the port. We present a proof that the formulation is the general case of an existing DBAP formulation. A numerical example is presented to demonstrate possible benefits of the proposed berth scheduling policy to the port operator and the vessel owner.


  • English

Media Info

  • Media Type: CD-ROM
  • Features: Figures; References; Tables;
  • Pagination: 15p
  • Monograph Title: TRB 86th Annual Meeting Compendium of Papers CD-ROM

Subject/Index Terms

Filing Info

  • Accession Number: 01049295
  • Record Type: Publication
  • Report/Paper Numbers: 07-2084
  • Files: TRIS, TRB
  • Created Date: Feb 8 2007 6:47PM