The paper deals with the problem of scheduling the loading/discharging operations of two simultaneously berthed vessels, assuming that some of the containers discharged from a vessel must be directly loaded on the other one. For these containers also the stowage position must be decided. The aim is to minimize the time needed to complete all the operations required by the involved vessels. For this problem we present a mathematical model, a heuristic algorithm and discuss the computational results on a set of randomly generated instances.

Skipping the Storage Phase in Container Transshipment Operations

Sammarra M
2018

Abstract

The paper deals with the problem of scheduling the loading/discharging operations of two simultaneously berthed vessels, assuming that some of the containers discharged from a vessel must be directly loaded on the other one. For these containers also the stowage position must be decided. The aim is to minimize the time needed to complete all the operations required by the involved vessels. For this problem we present a mathematical model, a heuristic algorithm and discuss the computational results on a set of randomly generated instances.
2018
Istituto di Calcolo e Reti ad Alte Prestazioni - ICAR
978-3-030-00898-7
Container terminal
Direct transshipment
Stowage plan
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.14243/376584
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? 0
social impact