Séminaire conjoint CRT-Chaire de recherche du Canada en distributique-Chaire de recherche du Canada en logistique et en transport

TITRE : The Group Allocation Problem in a Transshipment Container Terminal

CONFÉRENCIER : Luigi Moccia, Laboratorio di Logistica, Università della Calabria, Italy

DATE et ENDROIT : 8 septembre 2006, 10h30, salle 5441, Pavillon André-Aisenstadt, Campus de l’Université de Montréal

RESPONSABLE : Jean-François Cordeau (514-340-6278)

RÉSUMÉ : The Group Allocation Problem (GAP) is an operational problem arising in the yard management of a container transshipment terminal. The objective is the minimization of the container handling inside the yard. The yard management must decide where to allocate or reallocate containers groups. A container group is a set of containers which share the following attributes: the containers are of the same type, they arrive with the same inbound vessel, and they leave the terminal with the same outbound vessel. The GAP assumes deterministic and known in advance data for the container groups like the arrival and departure times and the arrival and departure positions along the quay. When unloading a vessel the discharged container groups must be allocated to yard positions close enough to the vessel berthing point in order to speed up the vessel handling. Throughout the duration-of-stay of these groups, occupied yard positions close to the quay could become necessary to the loading or unloading of incoming vessels. Furthermore, when the departure position of a group is far from its arrival position the group must be reallocated before the arrival of the outbound vessel. Therefore, the yard management deals with a dynamic allocation of groups through their duration-of-stay inside the terminal. Operational constraints are: the capacity of the yard positions, the maximum allowed distance between the vessel berthing point and the yard allocation when loading or unloading, the maximum container handling workload for a given time shift, etc.