This paper addresses an in-port multi-ship routing and scheduling problem in maritime transportation. The key objective is to find an optimal routing and schedule for multiple ships that are planned to pick up or deliver cargos located in the various terminals of a port with different draft limits. Using the multiple traveling salesman problem (mTSP) as a base, we formulate a multi-ship routing and scheduling model with draft limits and time windows constraints. To solve the developed model, a two-stage solution method based on dynamic programming and branch-and-bound algorithms is developed. The solution approach is applied to 41 real-sized problem instances. Our experiments revealed that the proposed method outperforms CPLEX by accurately solving the problem instances in a reasonable time. The formulated problem and presented solution can be implemented in fleet operations of autonomous ships in smart maritime transportation systems of the future.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    In-port multi-ship routing and scheduling problem with draft limits



    Published in:

    Publication date :

    2021-10-03


    Size :

    22 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown




    A Ship Routing and Scheduling Problem Considering Pickup and Delivery, Time Windows and Draft Limit

    Ghasemi-Sardabrud, Mahsa / Zarkandi, Mina / Mahmoodjanloo, Mehdi | IEEE | 2019


    Port ship scheduling method and system

    FANG SU / SHI LUQIANG / ZHANG BO | European Patent Office | 2022

    Free access

    Liner ship scheduling with time-dependent port charges

    Zheng, Jianfeng / Hou, Xuejing / Qi, Jingwen et al. | Taylor & Francis Verlag | 2022



    The traveling salesman problem with pickups, deliveries, and draft limits

    Malaguti, Enrico / Martello, Silvano / Santini, Alberto | BASE | 2018

    Free access