A Simulated Annealing Metaheuristic for a Rail-Road PI-Hub Allocation Problem - Université Polytechnique des Hauts-de-France Access content directly
Book Sections Year : 2015

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.

Domains

Automatic
No file

Dates and versions

hal-03406854 , version 1 (28-10-2021)

Identifiers

Cite

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⟩
11 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More