This paper presented a two-phase hybrid dynamic algorithm aiming at obtaining an optimized container retrieving sequence for a crane to retrieve all the containers from a given yard to the ship. The optimization goal was to minimize the number of container relocation operations. The two phases of the proposed dynamic procedure are as follows: in the first phase, a heuristic algorithm was developed to retrieve the containers which needed no relocation directly onto the ship; in the second phase, a dynamic programming within heuristic rules was used to solve the retrieving sequences problem for the rest of the containers. Computational experiments showed that the model and the hybrid dynamic algorithm could solve the retrieving problem of container terminals efficiently.