Housekeeping operations are yard-to-yard movements of containers inside maritime terminals. We focus on the management of those movements occurring before the loading phase. The aim is to select the export containers to move to the buffer areas, i.e. the containers to be marshaled, taking into account the vessel stowage plan. The objective is to minimize the runtime costs, in terms of the distance traveled by the ground vehicles. We propose a 0-1 Linear Program, a Lagrangean decomposition scheme, a dual ascent procedure for solving the Lagrangean Dual. Numerical results are also discussed.
The stowage-plan driven marshaling problem
Sammarra Marcello;
2013
Abstract
Housekeeping operations are yard-to-yard movements of containers inside maritime terminals. We focus on the management of those movements occurring before the loading phase. The aim is to select the export containers to move to the buffer areas, i.e. the containers to be marshaled, taking into account the vessel stowage plan. The objective is to minimize the runtime costs, in terms of the distance traveled by the ground vehicles. We propose a 0-1 Linear Program, a Lagrangean decomposition scheme, a dual ascent procedure for solving the Lagrangean Dual. Numerical results are also discussed.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.


