Data for container relocation problem

This data set includes problem instances for the container relocation problem. It is assumed that containers will be retrieved in a fixed order from a bay. The crane has only access to the containers on the the top level. So in order to access containers below, the containers on that prevent access should be removed and relocated to other possible locations. The problem is to find out how to relocate these containers so that one retrieves all the containers efficiently. Here efficient may mean "with the minimum number of movements" or "with the minimum total time".