AbstractThe objective of the berth-scheduling problem is to determine the berthing times and positions of containerships in port container terminals. Every vessel requires a specific amount of space in a wharf for a predetermined length of time to unload and load containers. In this study, a mixed-integer-linear-programming (MIP) model was formulated for the berth-scheduling problem. The simulated annealing algorithm was applied to the berth-scheduling problem to find near-optimal solutions. Experimental results showed that the simulated annealing algorithm obtains solutions that are similar to the optimal solutions found by the MIP model.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Berth scheduling by simulated annealing


    Beteiligte:
    Kim, Kap Hwan (Autor:in) / Moon, Kyung Chan (Autor:in)

    Erschienen in:

    Erscheinungsdatum :

    28.03.2002


    Format / Umfang :

    20 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Berth scheduling by simulated annealing

    Kim, Kap Hwan | Online Contents | 2003


    Simulated Annealing Algorithm for Berth Allocation Problems

    Line, Shih-Wei / Ting, Ching-Jung | Springer Verlag | 2013


    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


    A Perspective of Berth Scheduling Study

    Imai, Akio | British Library Online Contents | 2015