Optimization on the container loading sequence based on hybrid dynamic programming

  • Bian Z
  • Shao Q
  • Jin Z
  • 4


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.


AbstractRetrieving export containers from a container yard is an important part of the ship loading process during which arranging the retrieving sequence to enhance port efficiency has become a vital issue. This paper presents a twophase hybrid dynamic algorithm aiming at obtaining an optimized container loading sequence for a crane to retrieve all the containers from the yard to the ship. The optimization goal is to minimize the number of relocation operations which has a direct impact upon container loading operation efficiency. The two phases of the proposed dynamic algorithms are designed as follows: at the first phase, a heuristic algorithm is developed to retrieve the containers subset which needs no relocation and may be loaded directly onto the ship; at the second phase, a dynamic programming with heuristic rules is applied to solve the loading sequence problem for the rest of the containers. Numerical experiments showed the effectiveness and practicability of the model and the algorithm by compa...

Author-supplied keywords

  • container relocations
  • container terminal
  • dynamic programming
  • heuristic rules
  • loading sequence

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Zhan Bian

  • Qianqian Shao

  • Zhihong Jin

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free