A Simulated Annealing Metaheuristic for a Rail-Road PI-Hub Allocation Problem
Résumé
In this paper, a rail-road π-hub allocation problem is considered. A set of π-containers must be transferred from wagons to outgoing π-trucks using the rail-road π-sorters. A simulated annealing metaheuristic is proposed and compared to an existing heuristic. The main performance objective is to minimize the distance covered by each container to arrive at dock destination. Different scenarios are constructed and tested to compare both methods.