Skip to Main content Skip to Navigation
Journal articles

A rail-road PI-hub allocation problem: Active and reactive approaches

Abstract : This research concerns an allocation problem in the context of the physical internet aimed at improving rail-road π-hub efficiency by optimizing the distance travelled by each container to the dock, as well as the number of trucks used. To achieve this, heuristic, metaheuristic and Multi-agent-based approaches are proposed. When given the sequence of all the containers in the train, the proposed heuristic approach can assign these containers to outbound doors. Then, the Simulating Annealing (SA) method improves this allocation by minimizing the distance travelled. In addition, a multi-agent system model is proposed to generate reactive solutions which take dynamic aspects into account. The experimental results show that the proposed SA yields an improvement of about 2.42-7.67% in relation to the solution generated by the heuristic; it provides good results within a reasonable time. Conversely, the multi-agent-based approach provides good solutions in case of perturbations or unexpected events
Document type :
Journal articles
Complete list of metadata
Contributor : Mylène Delrue Connect in order to contact the contributor
Submitted on : Friday, November 12, 2021 - 6:43:28 PM
Last modification on : Wednesday, May 18, 2022 - 10:23:30 AM




Faiza Walha, Abdelghani Bekrar, Sondès Chaabane, Taicir Moalla Loukil. A rail-road PI-hub allocation problem: Active and reactive approaches. Computers in Industry, Elsevier, 2016, 81, pp.138-151. ⟨10.1016/j.compind.2016.04.007⟩. ⟨hal-03427034⟩



Record views