This paper deals with the liner shipping routing and scheduling problem by proposing a model that incorporates port time windows and split deliveries in cases where port demand exceeds ship capacity. Additionally, it introduces the concept of limited berth availability at ports, that results in vessel arrival coordination requirements. Moreover, it tests the cost-efficiency of an extra constraint for further restricting the arrival times of ships serving the same port. It develops a novel mathematical formulation for the vehicle routing problem and solves it using tabu search algorithm. Numerical experiments in a hub-and-spoke network demonstrate the function and effectiveness of the model, as well as the fluctuations of the cost by altering various decision variables.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Container shipping route and schedule design with port time windows and coordinated arrivals


    Contributors:


    Publication date :

    2018-11-01


    Size :

    276058 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Liner ship route schedule design with port time windows

    Wang, Shuaian | Online Contents | 2014


    Liner ship route schedule design with port time windows

    Wang, Shuaian / Alharbi, Abdurahim / Davy, Pam | Elsevier | 2014


    Schedule Design and Container Routing in Liner Shipping

    Wang, Shuaian | Online Contents | 2011


    Schedule Design and Container Routing in Liner Shipping

    Wang, Shuaian / Meng, Qiang | Transportation Research Record | 2011