Name
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 heuri... |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/TASE.2012.2198642 | IEEE Transactions on Automation Science and Engineering |
Keywords | Field | DocType |
Iterative algorithms,Algorithm design and analysis,Throughput | Relocation,Mathematical optimization,Branch and bound,Time frame,Computer science,Iterative method,Upper and lower bounds,Algorithm,Facility location problem,Heuristics,Iterative deepening depth-first search | Journal |
Volume | Issue | ISSN |
9 | 4 | 1545-5955 |
Citations | PageRank | References |
31 | 1.11 | 9 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenbin Zhu | 1 | 214 | 15.34 |
| Hu Qin | 2 | 201 | 16.49 |
| Andrew Lim | 3 | 937 | 89.78 |
| Huidong Zhang | 4 | 31 | 1.11 |