Tugboat service is important for maintaining the safety and efficiency of ship movements in container ports. In practice, requests for tugboat service are not fully known when the planning horizon begins, but continually revealed while the existing tugboat scheduling is being performed. Thus, a tangible method is required to schedule tugboats to fulfill the continually arrived requests. However, there is no study on addressing this issue. Thus, we propose a dynamic tugboat scheduling problem, formulate the problem mathematically, and develop a tailored solution method that dynamically updates tugboat scheduling as new service requests arrive, so as to minimize the tugboat operation cost of whole planning horizon. We evaluate the effectiveness of the proposed solution method by comparing it with a benchmark method, and show that the solution method is able to achieve satisfactory performance within a reasonable computation time. In addition, we investigate managerial insights via computational experiments on a variety of instances created based on real-life container port operations.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Dynamic tugboat scheduling for container ports


    Beteiligte:
    Wei, Xiaoyang (Autor:in) / Meng, Qiang (Autor:in) / Lim, Andrew (Autor:in) / Jia, Shuai (Autor:in)

    Erschienen in:

    Erscheinungsdatum :

    19.05.2023


    Format / Umfang :

    23 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Unbekannt




    Tugboat

    BANGSLUND THOMAS | Europäisches Patentamt | 2023

    Freier Zugriff

    Tugboat

    THOMAS BANGSLUND | Europäisches Patentamt | 2019

    Freier Zugriff

    Tugboat

    Europäisches Patentamt | 2018

    Freier Zugriff

    Tugboat

    BANGSLUND THOMAS | Europäisches Patentamt | 2023

    Freier Zugriff

    Tugboat

    BANGSLUND THOMAS | Europäisches Patentamt | 2023

    Freier Zugriff