Optimization and simulation approach of containers handling operations at intermodal terminals

The paper deals with the problem of minimizing reshuffling of containers in an inland intermodal terminal. The problem is tackled according to a simulation-optimization approach. A simulation model computes the operational costs of containers, related to storage and pick-up operations in an inland yard. The optimization is carried out by a double genetic algorithm that applies two genetic algorithms in series. The first optimizes the locations of the containers to store in the yard and identifies the blocking containers that have to be reshuffled. The second genetic algorithm takes the solution of the first and optimizes the reshuffling of blocking containers together with the unloaded ones. The proposed optimization method has been tested on a theoretical example of a realistic size. Results highlighted that the double genetic algorithm reduces the total operational costs by 5% with respect to the single genetic algorithm.