Integrating Ship Movement Scheduling and Tug Assignment Within a Canal Harbor

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

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.

Original languageEnglish
Title of host publicationAIRO Springer Series
PublisherSpringer Nature
Pages13-22
Number of pages10
DOIs
Publication statusPublished - 1 Jan 2019
Externally publishedYes

Publication series

NameAIRO Springer Series
Volume3
ISSN (Print)2523-7047
ISSN (Electronic)2523-7055

Keywords

  • Boolean satisfiability
  • Locomotive scheduling problem
  • Ship scheduling
  • Tug assignment

Fingerprint

Dive into the research topics of 'Integrating Ship Movement Scheduling and Tug Assignment Within a Canal Harbor'. Together they form a unique fingerprint.

Cite this