Hybrid Heuristic Approaches for Tactical Berth Allocation Problem

    Research output: Contribution to conferenceConference abstract for conferenceResearch

    Abstract

    Tactical berth allocation problem deals with: the berth allocation (as- signs and schedules vessels to berth-positions), and the quay crane (QC) assignment (finds number of QCs that will serve). In this work, we strengthen the current mathematical models (MM) with novel lower bounds and valid inequalities. And, we propose a hybrid heuristic which combines MM with greedy and search heuristics. Results show
    that problem can be solved efficiently respect to optimality and computational time.
    Original languageEnglish
    Publication date2014
    Number of pages1
    Publication statusPublished - 2014
    EventConference of the International Federation of Operational Research Societies. - Barcelona International Convention Center, Barcelona, Spain
    Duration: 13 Jul 201418 Jul 2014
    Conference number: 20

    Conference

    ConferenceConference of the International Federation of Operational Research Societies.
    Number20
    LocationBarcelona International Convention Center
    CountrySpain
    CityBarcelona
    Period13/07/201418/07/2014

    Fingerprint Dive into the research topics of 'Hybrid Heuristic Approaches for Tactical Berth Allocation Problem'. Together they form a unique fingerprint.

    Cite this