The berth-scheduling problem is considered with the objective of increasing customer satisfaction by minimizing the late berthing or departure and maximizing the early and timely berthing or departure of vessels. Vessel priority also is considered through the use of weights. An adaptive local search heuristic is developed to solve the resulting problem using a Markovian walk and a time window partitioning approach to improve convergence patterns and the objective function values. Results obtained from the heuristic are shown to be robust, and convergence rates and patterns are promising.


    Zugriff

    Download

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Adaptive Algorithm Based on Time Window Partitioning for Discrete and Dynamic Berth-Scheduling Problem


    Weitere Titelangaben:

    Transportation Research Record


    Beteiligte:


    Erscheinungsdatum :

    2009-01-01




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Discrete Berth-Scheduling Problem

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


    The Berth-Scheduling Problem

    Golias, Mihalis / Boile, Maria / Theofanis, Sotiris et al. | Transportation Research Record | 2010



    The stochastic discrete berth allocation problem

    Schepler, Xavier / Absi, Nabil / Feillet, Dominique et al. | Online Contents | 2019