Optimisation des mouvements des conteneurs dans un terminal maritime.

摘要

Most of the researchers have shown the importance and the value of scheduling and optimization problems in a maritime terminal. In this work, we focus on the optimization problem for loading operations of outbound containers. Thus, the sequencing of each yard crane and of each yard truck is studied at the same time. Furthermore, we consider the possibility of potential interferences between yard cranes and rehandles which significantly influence the performance of yard cranes. In the literature about yard crane scheduling problems, there is no work that combines interference between yard cranes and rehandles at the same time which is the innovation point of our work.;The scheduling problem for loading operations is formulated as a mixed linear program model. The objective function is to minimize the makespan of loading operations by yard cranes. The mathematical model is based on various assumptions and it includes the potential interferences and the rehandle.;A heuristic method is developed for solving this problem, namely Adaptive Large Neighborhood Search (ALNS). This method has the potential to handle with optimization problems in a container terminal. In fact, the ALNS method is deemed to be efficient with different scale problems: 10, 20 and 100 containers. The data are fictitious and many instances are built by varying the number of containers or/and the number of equipments (yard crane and yard truck) in each time. Computational tests are made to evaluate the efficiency of the developed algorithm (ALNS) for that we used multiple strategies where we made different combinations of removal and insertion heuristics. These numerical results show the quality of solutions produced by ALNS method.;Keywords: container terminal, optimization, scheduling operations, adaptive large neighborhood search, mixed linear program.