Modeling and solving the train load planning problem in seaport container terminals

In this paper we present two mathematical formulations and a heuristic approach for the train load planning problem of import containers at a seaport container terminal. The problem consists of determining how to assign a set of containers of different length and weight to the wagons of a train in order to satisfy capacity constraints of both the wagons and the train, while minimizing the rehandling operations in the stocking area where containers are waiting for being loaded on trains and maximizing the train utilization. Some computational results will be reported in the paper in which the heuristic approach is compared with the solution of the mathematical programming formulation.