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 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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-13022-9_4 | IEA/AIE (1) |
Keywords | Field | DocType |
larger instance,small case,crucial port operation,time frame,container relocation problem,new lower bound measure,fixed sequence,practical application,practical time frame,bound algorithm,branch and bound,branch and bound algorithm,lower bound,heuristics | Relocation,Mathematical optimization,Branch and bound,Time frame,Upper and lower bounds,Computer science,Branch and cut,Algorithm,Heuristics,Iterative deepening depth-first search | Conference |
Volume | ISSN | ISBN |
6096 | 0302-9743 | 3-642-13021-6 |
Citations | PageRank | References |
12 | 0.57 | 3 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Huidong Zhang | 1 | 12 | 0.57 |
| Songshan Guo | 2 | 46 | 6.50 |
| Wenbin Zhu | 3 | 29 | 3.09 |
| Andrew Lim | 4 | 150 | 13.57 |
| Brenda Cheang | 5 | 125 | 10.73 |