This paper considers the berth allocation problem (BAP) with time-varying water depth at a tidal river port. Both integer programming (IP) and constraint programming (CP) models are developed. Numerical experiments find that CP tends to be superior to IP when the feasible domain is small (e.g. dynamic vessel arrivals), when the restriction of the objective towards decision variables is loose (e.g. makespan, departure delay), or when the size of IP models is too large due to fine time resolution. Meanwhile, CP's incapability of proving optimality can be compensated by post-optimization with IP, by using a simple CP/IP hybrid procedure.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Evaluating the solution performance of IP and CP for berth allocation with time-varying water depth


    Contributors:


    Publication date :

    2016



    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English



    Classification :

    BKL:    85.00 / 55.82 Güterverkehr



    Berth allocation with service priority

    Imai, Akio | Online Contents | 2003


    Berth allocation with service priority

    Imai, Akio / Nishimura, Etsuko / Papadimitriou, Stratos | Elsevier | 2002


    The stochastic discrete berth allocation problem

    Schepler, Xavier / Absi, Nabil / Feillet, Dominique et al. | Online Contents | 2019


    The continuous Berth Allocation Problem: A Greedy Randomized Adaptive Search Solution

    Lee, Der-Horng / Chen, Jiang Hang / Cao, Jin Xin | Elsevier | 2010