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.
that problem can be solved efficiently respect to optimality and computational time.
Original language | English |
---|---|
Publication date | 2014 |
Number of pages | 1 |
Publication status | Published - 2014 |
Event | 20th Conference of the International Federation of Operational Research Societies. - Barcelona International Convention Center, Barcelona, Spain Duration: 13 Jul 2014 → 18 Jul 2014 Conference number: 20 |
Conference
Conference | 20th Conference of the International Federation of Operational Research Societies. |
---|---|
Number | 20 |
Location | Barcelona International Convention Center |
Country/Territory | Spain |
City | Barcelona |
Period | 13/07/2014 → 18/07/2014 |