Iterative deepening A* algorithms for the container relocation problem
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
| Original language | English |
|---|---|
| Article number | 6216460 |
| Pages (from-to) | 710-722 |
| Journal / Publication | IEEE Transactions on Automation Science and Engineering |
| Volume | 9 |
| Issue number | 4 |
| Publication status | Published - 2012 |
Link(s)
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.
Research Area(s)
- Container relocation problem, Container yard operation, Iterative deepening A*
Citation Format(s)
Iterative deepening A* algorithms for the container relocation problem. / Zhu, Wenbin; Qin, Hu; Lim, Andrew et al.
In: IEEE Transactions on Automation Science and Engineering, Vol. 9, No. 4, 6216460, 2012, p. 710-722.Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
