Robust Tabu Search Algorithm for Planning Rail-Truck Intermodal Freight Transport

Abstract : In this paper a new efficient tabu search algorithm for assigning freight to the intermodal transport connections was developed. There were also formulated properties of the problem that can be used to design robust heuristic algorithms based on the local search methods. The quality of solutions produced by the tabu search algorithm and by often recommended greedy approach were also compared.
Liste complète des métadonnées

Cited literature [22 references]  Display  Hide  Download

https://hal.inria.fr/hal-01637497
Contributor : Hal Ifip <>
Submitted on : Friday, November 17, 2017 - 3:45:10 PM
Last modification on : Saturday, November 18, 2017 - 1:16:40 AM
Document(s) archivé(s) le : Sunday, February 18, 2018 - 3:44:05 PM

File

419526_1_En_26_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Collections

Citation

Wojciech Bożejko, Radoslaw Grymin, Szymon Jagiełło, Jarosław Pempera. Robust Tabu Search Algorithm for Planning Rail-Truck Intermodal Freight Transport. 15th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Sep 2016, Vilnius, Lithuania. pp.289-299, ⟨10.1007/978-3-319-45378-1_26⟩. ⟨hal-01637497⟩

Share

Metrics

Record views

102

Files downloads

9