Comparison of solution approaches for the train load planning problem in seaport terminals

• The train load planning problem arising in seaport container terminals is considered.
• Different solution approaches based on mathematical programming are compared.
• Three extensive experimental campaigns are realized.
• The best solution method can provide good solutions in acceptable computational times.

In this paper the train load planning problem arising in a seaport container terminal is considered. This problem consists in determining the optimal assignment of containers to wagon slots in order to maximize the train utilization and, at the same time, to minimize unproductive operations in the terminal. Different solution approaches based on a mathematical programming model are compared. The best solution procedure, satisfactory both in terms of quality of the obtained solutions and for the computational times, is identified through extensive experimental tests. This procedure could be included in a planning tool to be used in real seaport terminals.