%0 Conference Proceedings
%T Robust Tabu Search Algorithm for Planning Rail-Truck Intermodal Freight Transport
%+ Wroclaw University of Science and Technology
%A Bożejko, Wojciech
%A Grymin, Radoslaw
%A Jagiełło, Szymon
%A Pempera, Jarosław
%Z Part 5: Scheduling in Manufacturing and Other Applications
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 15th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM)
%C Vilnius, Lithuania
%Y Khalid Saeed
%Y Władysław Homenda
%I Springer International Publishing
%3 Computer Information Systems and Industrial Management
%V LNCS-9842
%P 289-299
%8 2016-09-14
%D 2016
%R 10.1007/978-3-319-45378-1_26
%K Intermodal transport
%K Optimization
%K Tabu search
%Z Computer Science [cs]
%Z Humanities and Social Sciences/Library and information sciencesConference papers
%X 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.
%G English
%Z TC 8
%2 https://inria.hal.science/hal-01637497/document
%2 https://inria.hal.science/hal-01637497/file/419526_1_En_26_Chapter.pdf
%L hal-01637497
%U https://inria.hal.science/hal-01637497
%~ SHS
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC8
%~ IFIP-CISIM
%~ IFIP-LNCS-9842