This paper presents a new formulation for the discrete space berth-scheduling problem at marine container terminals. This formulation reflects an environmentally friendly berth-scheduling policy with the objectives of (a) maximizing berth productivity by minimizing the total service time and delayed departures for all vessels and (b) minimizing the total emissions and fuel consumption for all vessels while in transit to their next port of call. A genetic algorithms–based heuristic is presented to solve the resulting problem, and computational examples are presented to evaluate the proposed berth-scheduling policy.


    Access

    Download

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    The Berth-Scheduling Problem


    Subtitle :

    Maximizing Berth Productivity and Minimizing Fuel Consumption and Emissions Production


    Additional title:

    Transportation Research Record: Journal of the Transportation Research Board


    Contributors:


    Publication date :

    2010-01-01




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Discrete Berth-Scheduling Problem

    Golias, M. M. / Boile, M. / Theofanis, S. | Transportation Research Record | 2010


    A Berth Scheduling Problem under Sailing Schedule Disruption

    Yang, Chunxia / Wang, Nuo / Zhao, Bing | ASCE | 2010


    A Berth Scheduling Problem under Sailing Schedule Disruption

    Yang, C. / Wang, N. / Zhao, B. et al. | British Library Conference Proceedings | 2010