Iterative deepening A* algorithms for the container relocation problem

Wenbin Zhu, Hu Qin, Andrew Lim, Huidong Zhang

    Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

    141 Citations (Scopus)

    Abstract

    The container relocation problem, where containers that are stored in bays are retrieved in a fixed sequence, is a crucial port operation. Existing approaches using branch and bound algorithms are only able to optimally solve small cases in a practical time frame. In this paper, we investigate iterative deepening A* algorithms (rather than branch and bound) using new lower bound measures and heuristics, and show that this approach is able to solve much larger instances of the problem in a time frame that is suitable for practical application. We also examine a more difficult variant of the problem that has been largely ignored in existing literature. © 2004-2012 IEEE.
    Original languageEnglish
    Article number6216460
    Pages (from-to)710-722
    JournalIEEE Transactions on Automation Science and Engineering
    Volume9
    Issue number4
    DOIs
    Publication statusPublished - 2012

    Research Keywords

    • Container relocation problem
    • Container yard operation
    • Iterative deepening A*

    Fingerprint

    Dive into the research topics of 'Iterative deepening A* algorithms for the container relocation problem'. Together they form a unique fingerprint.

    Cite this