A heuristic algorithm for drawing stowage plans for containerships (Comunicazione a convegno)

Type
Label
  • A heuristic algorithm for drawing stowage plans for containerships (Comunicazione a convegno) (literal)
Anno
  • 2009-01-01T00:00:00+01:00 (literal)
Alternative label
  • Monaco M. Flavia; Sammarra Marcello; Sorrentino Gregorio (2009)
    A heuristic algorithm for drawing stowage plans for containerships
    in 40th Annual Conference of the Italian Operational Research Society, Siena, 8-11 Settembre 2009
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Monaco M. Flavia; Sammarra Marcello; Sorrentino Gregorio (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#titoloVolume
  • Decision and Optimization Models for Evaluation and Management - Proceedings of the XL Annual Conference of the Italian Operational Research Society (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • Dipartimento di Elettronica, Informatica e Sistemistica - Università della Calabria; Istituto di calcolo e reti ad alte prestazioni - CNR; Dipartimento di Elettronica, Informatica e Sistemistica - Università della Calabria; (literal)
Titolo
  • A heuristic algorithm for drawing stowage plans for containerships (literal)
Abstract
  • In this talk we deal with the problem of stowing containers into a containership. As discussed in [1] the stowing process of a containership involves two decision-makers and as many sequential decision levels: the shipping line planner and the terminal planner. Both aim at reducing the ship berthing time: the first allocating containers on the basis of the port rotation so as to minimize on board shifts and to maximize also the ship utilization; the latter transporting outgoing containers from their location in the yard to the quay without unfruitful moves. At the first decisional level, the reference unit is not the specific container, but a class of containers, identified by several attributes: the size, the type, the destination port, the weight range. The shipping line planner assigns containers of the different classes to specific slots within the ship, preserving the stability. This pre-stow plan is then sent, together with the container loading list, to each port the containership will call during its journey and acts as guideline for the terminal planner. The terminal planner then complete the stowage plan assigning one container of a given class, selected in the yard, to a respective ship slot. In this phase the terminal planner has to comply with several constraints related to the distribution, both vertical and horizontal, of the weight within the containership. The objective is to minimize the transportation time of containers to the quay and to minimize the yard reshuffles. They are very time consuming unproductive moves occurring whenever some containers on the top of a yard stack have to be removed and then restacked in order to pick up a container on the bottom of the same stack. Here we present a Tabu Search algorithm for the second phase of the stowage planning process, which has been designed to comply with the problem as it arises at the Gioia Tauro Container Terminal. Preliminary numerical results are also discussed. (literal)
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Prodotto
Autore CNR di
Insieme di parole chiave di
data.CNR.it