A Simulated Annealing Metaheuristic for a Rail-Road PI-Hub Allocation Problem

Faiza Walha , Sondès Chaabane (1) , Abdelghani Bekrar (1) , Taicir Loukil

1 LAMIH - Laboratoire d'Automatique, de Mécanique et d'Informatique industrielles et Humaines - UMR 8201

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.

Mots clés: Physical internet; Rail-road allocation; Heuristic; Simulated annealing

Domaines: Automatique / Robotique

Faiza Walha, Sondès Chaabane, Abdelghani Bekrar, Taicir Loukil. A Simulated Annealing Metaheuristic for a Rail-Road PI-Hub Allocation Problem. Service Orientation in Holonic and Multi-agent Manufacturing, 594, Springer International Publishing, pp.307-314, 2015, Studies in Computational Intelligence, ⟨10.1007/978-3-319-15159-5_28⟩. ⟨hal-03406854⟩