Improved formulations and an Adaptive Large Neighborhood Search heuristic for the integrated berth allocation and quay crane assignment problem

    Research output: Contribution to journalJournal articleResearchpeer-review

    Abstract

    This paper focuses on the integrated berth allocation and quay crane assignment problem in container terminals. We consider the decrease in the marginal productivity of quay cranes and the increase in handling time due to deviation from the desired position. We consider a continuous berth, discretized in small equal-sized sections. A number of enhancements over the state-of-the-art formulation and an Adaptive Large Neighborhood Search (ALNS) heuristic are presented. Computational results reveal that the enhancements improve many of the best-known bounds, and the ALNS outperforms the state-of-the-art heuristics for many instances. We also conduct further analysis on a new larger benchmark.
    Original languageEnglish
    JournalTransportation Research. Part E: Logistics and Transportation Review
    Volume105
    Pages (from-to)123-147
    ISSN1366-5545
    DOIs
    Publication statusPublished - 2017

    Keywords

    • Business and International Management
    • Transportation
    • Management Science and Operations Research
    • Gruidae

    Cite this