Multi-Objective Optimization Methods for Train Load Planning in Seaport Container Terminals

In this paper we study the planning problem of loading trains in seaport container terminals, which consists in assigning containers to the wagon slots. The train load can be realized considering different objectives, in this work we focus on two very important objectives for terminal managers, that are the minimization of the number of reshuffles in the storage area and the minimization of the total distance covered by the handling equipment between the storage area and the wagons. To address this problem, some multi-objective methods are investigated in the paper, based on the \varepsilon -constraint approach and the lexicographic algorithm, allowing to find different sets of efficient solutions to be provided to train planners. The experimental tests, devised to compare the proposed multi-objective methods, show that the \varepsilon -constraint method integrated with a lexicographic approach is the most efficient choice since it allows to obtain a higher number of efficient solutions in shorter computational times. This method can be applied in decision support systems for train planners in order to allow them to decide the train load in an efficient way. Note to Practitioners-The automation and the process optimization in seaport container terminals is a relevant issue for terminal managers in order to face the strong competitiveness in the logistics and shipping sector and the new emerging problems due to the presence of mega vessels. Among the different operations to be optimally managed in a terminal, the loading of trains is becoming more and more significant, also due to the increase of freight traffic by rail, seen as a cheaper and more sustainable option compared with road transport. The optimal assignment of containers present in a storage area to the wagon slots is a crucial decision in order to reduce operational times and costs in a container terminal. In this paper, we address the train load planning problem considering two important objectives to be minimized, i.e. the number of reshuffles and the distance covered by the handling equipment. The multi-objective methods proposed in the paper are devised to find different efficient solutions in short computational times. The proposed algorithms are intended to be implemented within a decision support tool in which the solutions found are shown to the