Research Information System
2017 International MultiConference of Engineers and Computer Scientists, IMECS 2017, Hong Kong, hkg, 15 - 17 March 2017, vol.2228, pp.979-984, (Full Text)
In this work, we address the unrestricted Dynamic Container Relocation Problem (DCRP). The DCRP is an extension of the Container Relocation Problem (CRP) that is NP-hard. The CRP aims to empty a single yard-bay, which contains containers with a given retrieval sequence from the yard-bay, such that the total number of relocations is minimized. The DCRP extends the CRP so that containers both arrive and depart at the yard-bay. The unrestricted DCRP relaxes a common assumption which enforces container relocations are performed only to retrieve containers that needs to leave the yard-bay. A mathematical formulation is suggested for the unrestricted DCRP. Then, three efficient heuristic methods are offered. An extensive set of computational experiments is performed on standard test instances. Our results indicate that savings can be achieved by using the suggested heuristic methods.