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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Dynamic tugboat scheduling for container ports


    Contributors:
    Wei, Xiaoyang (author) / Meng, Qiang (author) / Lim, Andrew (author) / Jia, Shuai (author)

    Published in:

    Publication date :

    2023-05-19


    Size :

    23 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown




    Tugboat

    BANGSLUND THOMAS | European Patent Office | 2023

    Free access

    Tugboat

    THOMAS BANGSLUND | European Patent Office | 2019

    Free access

    Tugboat

    European Patent Office | 2018

    Free access

    Tugboat

    BANGSLUND THOMAS | European Patent Office | 2023

    Free access

    Tugboat

    BANGSLUND THOMAS | European Patent Office | 2023

    Free access