In the berth-allocation problem (BAP) the aim is to optimally schedule and assign ships to berthing areas along a quay. The objective is the minimization of the total (weighted) service time for all ships, defined as the time elapsed between the arrival in the harbor and the completion of handling. Two versions of the BAP are considered: the discrete case and the continuous case. The discrete case works with a finite set of berthing points. In the continuous case ships can berth anywhere along the quay. Two formulations and a tabu search heuristic are presented for the discrete case. Only small instances can be solved optimally. For these sizes the heuristic always yields an optimal solution. For larger sizes it is always better than a truncated branch-and bound applied to an exact formulation. A heuristic is also developed for the continuous case. Computational comparisons are performed with the first heuristic and with a simple constructive procedure.

Models and tabu search heuristics for the berth allocation problem

LEGATO Pasquale;MOCCIA, Luigi
2005-01-01

Abstract

In the berth-allocation problem (BAP) the aim is to optimally schedule and assign ships to berthing areas along a quay. The objective is the minimization of the total (weighted) service time for all ships, defined as the time elapsed between the arrival in the harbor and the completion of handling. Two versions of the BAP are considered: the discrete case and the continuous case. The discrete case works with a finite set of berthing points. In the continuous case ships can berth anywhere along the quay. Two formulations and a tabu search heuristic are presented for the discrete case. Only small instances can be solved optimally. For these sizes the heuristic always yields an optimal solution. For larger sizes it is always better than a truncated branch-and bound applied to an exact formulation. A heuristic is also developed for the continuous case. Computational comparisons are performed with the first heuristic and with a simple constructive procedure.
2005
maritime container terminal; berth allocation; vehicle routing; scheduling; tabu search; time windows
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.11770/123662
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 306
  • ???jsp.display-item.citation.isi??? 252
social impact