In this paper we propose a model for the in-port ship scheduling problem that consists in scheduling the movement of ships inside a canal harbor. Our model, which we name RECIP-MILP, is inspired by a model for scheduling trains, to exploit the analogies between a canal harbor and a single track railway network. Moreover, we show how to translate spatial safety constraints into time ones. We apply our model to instances representing ship movements in the Port of Venice. We test the performance of both the exact RECIP-MILP model and a heuristic solution algorithm based on it. We show that we can exactly solve most instances in few minutes.

Scheduling ships movements within a canal harbor

Giacomo di Tollo;
2018-01-01

Abstract

In this paper we propose a model for the in-port ship scheduling problem that consists in scheduling the movement of ships inside a canal harbor. Our model, which we name RECIP-MILP, is inspired by a model for scheduling trains, to exploit the analogies between a canal harbor and a single track railway network. Moreover, we show how to translate spatial safety constraints into time ones. We apply our model to instances representing ship movements in the Port of Venice. We test the performance of both the exact RECIP-MILP model and a heuristic solution algorithm based on it. We show that we can exactly solve most instances in few minutes.
2018
In-port ship scheduling problem
Ship scheduling
Mixed-integer linear programming
Venice
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.12070/59499
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 6
  • ???jsp.display-item.citation.isi??? 6
social impact