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.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

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


    Beteiligte:

    Erschienen in:

    Erscheinungsdatum :

    2016



    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Print


    Sprache :

    Englisch



    Klassifikation :

    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


    Berth Allocation and Crane Assignment Problem in Continuous Berth Containers Vessels Terminals

    Abir Hussein / Amin El-Kharbotly / Tamer Ismail | DOAJ | 2022

    Freier Zugriff

    The stochastic discrete berth allocation problem

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