Evaluation of the number of rehandles in container yards
Computers and Industrial Engineering - Special issue: new advances in analysis of manufacturing systems
Re-marshaling export containers in port container terminals
ICC&IE Selected papers from the 22nd ICC&IE conference on Computers & industrial engineering
An Optimal Routing Algorithm for a Transfer Crane in Port Container Terminals
Transportation Science
Optimising container transfers at multimodal terminals
Mathematical and Computer Modelling: An International Journal
Proceedings of the 2009 ACM symposium on Applied Computing
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
Modeling and evaluation of harbor crane work
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Domain-dependent planning heuristics for locating containers in maritime terminals
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part I
Generating a rehandling-free intra-block remarshaling plan for an automated container yard
Journal of Intelligent Manufacturing
A tree search procedure for the container relocation problem
Computers and Operations Research
Integrated intelligent techniques for remarshaling and berthing in maritime terminals
Advanced Engineering Informatics
Intelligent planning for allocating containers in maritime terminals
Expert Systems with Applications: An International Journal
Heuristic algorithms for container pre-marshalling problems
Computers and Industrial Engineering
A decision support system for managing combinatorial problems in container terminals
Knowledge-Based Systems
Pre-Marshalling Problem: Heuristic solution method and instances generator
Expert Systems with Applications: An International Journal
Extended mis-overlay calculation for pre-marshalling containers
ICCL'12 Proceedings of the Third international conference on Computational Logistics
Simulation for performance evaluation of the housekeeping process
Proceedings of the Winter Simulation Conference
A Survey on Container Processing in Railway Yards
Transportation Science
Multi-crane scheduling in steel coil warehouse
Expert Systems with Applications: An International Journal
| Hi-index | 0.01 |
In most container yards around the world, containers are stacked high to utilize yard space more efficiently. In these yards, one major factor that affects their operational efficiency is the need to re-shuffle containers when accessing a container that is buried beneath other containers. One way to achieve higher loading efficiency is to pre-marshal the containers in such a way that it fits the loading sequence. In this research, we present a mathematical model for the container pre-marshalling problem. With respect to a given yard layout and a given sequence that containers are loaded onto a ship, the model yields a plan to re-position the export containers within the yard, so that no extra re-handles will be needed during the loading operation. The optimization goal is to minimize the number of container movements during pre-marshalling. The resulting model is an integer programming model composed of a multi-commodity flow problem and a set of side constraints. Several possible variations of the model as well as a solution heuristic are also discussed. Computation results are provided.