The Berth Scheduling Problem: Maximizing Berth Productivity and Minimizing Fuel Consumption and Emission Production.

Author(s)
Golias, M.M. Boile, M. Theofanis, S. & Efstathiou, C.
Year
Abstract

In this paper the authors deal with the discrete space berth scheduling problem at marine container terminals. Determining the best berth schedule depends on several factors including the type and function of the port, size of the port, location, nearby competition, and type of contractual agreement between the terminal and the carriers. In this paper the authors present a new environmentally friendly berth scheduling policy with the objective to: a) maximize the berth productivity by minimizing the total service time and delayed departures for all the vessels, and b) minimize the total emissions and fuel consumption for all the vessels while in transit totheir next port of call. A Genetic Algorithms based heuristic is presented to solve the resulting problem and a number of computational examples are presented to evaluate the proposed berth scheduling policy.

Request publication

7 + 5 =
Solve this simple math problem and enter the result. E.g. for 1+3, enter 4.

Publication

Library number
C 48216 (In: C 47949 DVD) /15 / ITRD E854566
Source

In: Compendium of papers DVD 89th Annual Meeting of the Transportation Research Board TRB, Washington, D.C., January 10-14, 2010, 16 p.

Our collection

This publication is one of our other publications, and part of our extensive collection of road safety literature, that also includes the SWOV publications.