A Corridor Method-Based Algorithm for the Pre-marshalling Problem

Authors:
Marco Caserta;Stefan Voß
Affiliations:
University of Hamburg, Hamburg, Germany 20146;University of Hamburg, Hamburg, Germany 20146
Venue:
EvoWorkshops '09 Proceedings of the EvoWorkshops 2009 on Applications of Evolutionary Computing: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG
Year:
2009

Citing 5
Cited 6

Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment

INFORMS Journal on Computing
An optimization model for the container pre-marshalling problem

Computers and Operations Research
A heuristic rule for relocating blocks

Computers and Operations Research
A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem

Discrete Optimization

Hybrid metaheuristics in combinatorial optimization: A survey

Applied Soft Computing
A tree search procedure for the container relocation problem

Computers and Operations Research
Pre-Marshalling Problem: Heuristic solution method and instances generator

Expert Systems with Applications: An International Journal
A math-heuristic for the multi-level capacitated lot sizing problem with carryover

EvoCOMNET'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part II
Extended mis-overlay calculation for pre-marshalling containers

ICCL'12 Proceedings of the Third international conference on Computational Logistics
A MIP-based framework and its application on a lot sizing problem with setup carryover

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

To ease the situation and to ensure a high performance of ship, train and truck operations at container terminals, containers sometimes are pre-stowed near to the loading place and in such an order that it fits the loading sequence. This is done after the stowage plan is finished and before ship loading starts. Such a problem may be referred to as pre-marshalling. Motivated by most recent publications on this problem we describe a metaheuristic approach which is able to solve this type of problem. The approach utilizes the paradigm of the corridor method.