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

Abstract

Part 5: Scheduling in Manufacturing and Other Applications; International audience; 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.

Document type: Conference object

Full document

Original document

The different versions of the original document can be found in:

• https://doi.org/10.1007/978-3-319-45378-1_26 under the license http://creativecommons.org/licenses/by/

• http://link.springer.com/content/pdf/10.1007/978-3-319-45378-1_26,

http://dx.doi.org/10.1007/978-3-319-45378-1_26 under the license cc-by-nc

• https://dblp.uni-trier.de/db/conf/cisim/cisim2016.html#BozejkoGJP16,

https://link.springer.com/chapter/10.1007%2F978-3-319-45378-1_26,

https://hal.inria.fr/hal-01637497/document,

https://hal.inria.fr/hal-01637497,

https://academic.microsoft.com/#/detail/2509721294 under the license http://www.springer.com/tdm

• https://hal.inria.fr/hal-01637497,

https://hal.inria.fr/hal-01637497/document,

https://hal.inria.fr/hal-01637497/file/419526_1_En_26_Chapter.pdf

under the license http://creativecommons.org/licenses/by/