Problème intégré d'allocation des zones d'accostage et de grues de manutention dans un terminal à conteneurs : application au terminal tunisien de Radès

Abstract

The issue known through the literature as Berth Allocation and Crane Assignment Problem is the first link in the container terminal logistics chain. The first link, though, if optimized, a certain efficiency of operation of the terminal is guaranteed. These two terminal resources have the characteristic of being critical. and the criticality comes from the fact that they are limited. Therefore an efficient and optimized operation management of these two resources must be applied in a container terminal which aims to be competitive. In this research work, the discrete variant of the Quay layout and the dynamic variant of the vessels arrival is studied more closely. Approximate optimization methods, in particular metaheuristics, have been focused to solve this problem. In a first step, a reference mathematical model was studied to be solved by the local search Extended Great Deluge algorithm. A new variant of this algorithm for multi-objective problems has been proposed. Subsequently, the Tunisian container terminal of Radès was the background for the original contribution of this research work. Two mathematical models for both crane assignment strategies (invariable in-time and variable-in-time) were constructed and solved using the nature -based meta-heuristic, Artificial Bee Colony.

Date	14 Feb 2018
Original language	French
Awarding Institution	École de technologie supérieure
Supervisor	Thien-My Dao (Supervisor) & Hanen Bouchriha Temimi (Co-supervisor)