Reshuffling is one of the most costly operations at container yards for loading the containers onto thecontainerships since it increases the berthing time. In this paper, a shared stacking policy is proposed to stack the containers of multiple ships in one block of containers. A dynamic programming model is suggested to determine the exact storage positions of the export containers based on their retrieval times in order to minimize the expected number of reshufflings. Dynamic programming is not capable of solving realistically-sized problems in a reasonable time, so a heuristic algorithm is suggested. The main aim of the heuristic algorithm is to build decision trees whichcan be applied to solve large scale problems.
|Title of host publication||Proceedings of the 2009 Conference on Value Chain Sustainability (ICOVACS 2009), 19-21 October 2009, Louisville, KY, U.S.A.|
|Place of Publication||United States, Louisville, KY|
|Publication status||Published - 2010|