.png){kind=icon}
Return
A tree search procedure for the container relocation problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2011.04.004.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In the container relocation problem (CRP) n items are given that belong to G different item groups (g = 1, ... , G). The items are piled up in up to S stacks with a maximum stack height H. A move can either shift one item from the top of a stack to the top of another one (relocation) or pick an item from the top of a stack and entirely remove it (remove). A move of the latter type is only feasible if the group index of the item is minimum compared to all remaining items in all stacks. A move sequence of minimum length has to be determined that removes all items from the stacks. The CRP occurs frequently in container terminals of seaports. It has to be solved when containers, piled up in stacks, need to be transported to a ship or to trucks in a predefined sequence. This article presents a heuristic tree search procedure for the CRP. The procedure is compared to all known solution approaches for the CRP and turns out to be very competitive. (C) 2011 Elsevier Ltd. All rights reserved.
Keywords:
Transportation
Logistics
Seaport
Container relocation problem
Tree search
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
View more