The 3-D Yard Allocation Problem for Break Bulk Cargo consists in finding the optimal disposition of the cargo (granite blocks) that minimizes the handling time to move the cargo to/from vessels that are moored in specific berthing positions. Here we develop a Variable Neighborhood Search and Branching based on a Mixed Integer Linear Programming formulation of the problem introduced in a previous work. The solution method has been tested on some real world instances built for the port yard of Vitoria (Espirito Santo, Brazil) with encouraging results.
Solving the 3-D yard allocation problem for break bulk cargo via variable neighborhood search branching
BRUGLIERI, MAURIZIO;MAJA, ROBERTO;
2015-01-01
Abstract
The 3-D Yard Allocation Problem for Break Bulk Cargo consists in finding the optimal disposition of the cargo (granite blocks) that minimizes the handling time to move the cargo to/from vessels that are moored in specific berthing positions. Here we develop a Variable Neighborhood Search and Branching based on a Mixed Integer Linear Programming formulation of the problem introduced in a previous work. The solution method has been tested on some real world instances built for the port yard of Vitoria (Espirito Santo, Brazil) with encouraging results.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
main_granito.pdf
Accesso riservato
Descrizione: Articolo_principale
:
Publisher’s version
Dimensione
248.94 kB
Formato
Adobe PDF
|
248.94 kB | Adobe PDF | Visualizza/Apri |
Solving the 3-D Yard Allocation Problem_11311-986629_Bruglieri.pdf
accesso aperto
:
Post-Print (DRAFT o Author’s Accepted Manuscript-AAM)
Dimensione
238.15 kB
Formato
Adobe PDF
|
238.15 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.