Dynamic container relocation problem

Abstract

The container relocation problem supposes that the whole retrieval chain is identified in advance. This is practical for vessels where the shipment plan is known ahead in time. But, exact truck arrivals can barely be predicted and are exposed over time. As a result, the retrieval order is not known in advance. This paper deals with a dynamic and more practical version of the container relocation problem, where information about container retrievals becomes revealed over time.