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.
Main Research Area:
Conference of the International Federation of Operational Research Societies., 2014