Skip to Main content Skip to Navigation
Book sections

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

Abstract : 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.
Document type :
Book sections
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03406854
Contributor : Kathleen Torck Connect in order to contact the contributor
Submitted on : Thursday, October 28, 2021 - 10:15:45 AM
Last modification on : Friday, October 29, 2021 - 3:58:23 AM

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

9