In this paper we address the in-port ship scheduling and tug assignment problem. This problem aims to determine a schedule of ship movements, and their escorting tugs, within a canal harbor. We formulate the problem as a Boolean satisfiability problem. In particular, we deal with canal-harbors, as this kind of harbors present strict constraints, e.g., on safety distance. We consider the Port of Venice, a medium size Italian harbor, as a case study

Integrating ship movement scheduling and tug assignment within a canal harbor

Giacomo Di Tollo;Raffaele Pesenti;Matteo Petris
2020

Abstract

In this paper we address the in-port ship scheduling and tug assignment problem. This problem aims to determine a schedule of ship movements, and their escorting tugs, within a canal harbor. We formulate the problem as a Boolean satisfiability problem. In particular, we deal with canal-harbors, as this kind of harbors present strict constraints, e.g., on safety distance. We consider the Port of Venice, a medium size Italian harbor, as a case study
AIRO Springer Series: Advances in Optimization and Decision Science for Society, Services and Enterprises
File in questo prodotto:
File Dimensione Formato  
DiTollo-Pesenti-Petris.pdf

non disponibili

Tipologia: Documento in Pre-print
Licenza: Accesso chiuso-personale
Dimensione 227.84 kB
Formato Adobe PDF
227.84 kB Adobe PDF   Visualizza/Apri

I documenti in ARCA 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: http://hdl.handle.net/10278/3714769
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact