Evaluation of the number of rehandles in container yards
Computers and Industrial Engineering - Special issue: new advances in analysis of manufacturing systems
ICC&IE Selected papers from the 22nd ICC&IE conference on Computers & industrial engineering
Re-marshaling export containers in port container terminals
ICC&IE Selected papers from the 22nd ICC&IE conference on Computers & industrial engineering
An optimization model for the container pre-marshalling problem
Computers and Operations Research
A New Binary Description of the Blocks Relocation Problem and Benefits in a Look Ahead Heuristic
EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
A Corridor Method-Based Algorithm for the Pre-marshalling Problem
EvoWorkshops '09 Proceedings of the EvoWorkshops 2009 on Applications of Evolutionary Computing: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG
A heuristic for retrieving containers from a yard
Computers and Operations Research
A heuristic rule for relocating blocks
Computers and Operations Research
Corridor Selection and Fine Tuning for the Corridor Method
Learning and Intelligent Optimization
| Hi-index | 0.01 |
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.