Decreasing the crane working time in retrieving the containers from a bay

Given the initial layout of a container terminal with a bay, the container retrieval problem aims at obtaining a movement sequence for the crane to retrieve all the containers arranged in a pre-defined order. in this study, we develop a computationally efficient heuristic, called constant summation (csum), to minimize the total working time of crane, required to retrieve all the containers from a given bay. numerical results show that csum is very promising in dealing with the container retrieval problems and outperforms the best known approaches recently presented in the literature in terms of the crane's working time.