Column generation for the container relocation problem

Abstract : Container terminals offer transfer facilities to move containers from vessels to trucks, trains and barges and vice versa. Within the terminal the container yard serves as a temporary buffer where incoming containers are piled up in stacks. Only the topmost container of each stack can be accessed. If another container has to be retrieved, containers stored above it must be relocated first. Containers need to be transported to a ship or to trucks in a predefined sequence as fast as possible. Generally, this sequence does not match the stacking order within the yard. Therefore, a sequence of retrieval and relocation movements has to be determined that retrieves containers from the bay in the prescribed order with a minimum number of relocations. This problem is known as the container relocation problem. We apply an exact and a heuristic column generation approach to this problem. First results are very promising since both approaches provide very tight lower bounds on the minimum number of relocations.
Type de document :
Communication dans un congrès
International Material Handling Research Colloquium (IMHRC 2012), Jun 2012, Gardanne, France. to be published, 2012
Liste complète des métadonnées

https://hal-emse.ccsd.cnrs.fr/emse-00731423
Contributeur : Elisabeth Zehendner <>
Soumis le : mercredi 12 septembre 2012 - 16:48:35
Dernière modification le : mercredi 29 novembre 2017 - 10:06:53

Identifiants

  • HAL Id : emse-00731423, version 1

Collections

Citation

Elisabeth Zehendner, Dominique Feillet. Column generation for the container relocation problem. International Material Handling Research Colloquium (IMHRC 2012), Jun 2012, Gardanne, France. to be published, 2012. 〈emse-00731423〉

Partager

Métriques

Consultations de la notice

103