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

The PDF file did not load properly or your web browser does not support viewing PDF files. Download directly to your device: Download PDF document

Original document

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

http://dx.doi.org/10.1007/978-3-319-45378-1_26 under the license cc-by-nc
https://academic.microsoft.com/#/detail/2509721294 under the license http://www.springer.com/tdm
under the license http://creativecommons.org/licenses/by/
Back to Top

Document information

Published on 01/01/2016

Volume 2016, 2016
DOI: 10.1007/978-3-319-45378-1_26
Licence: Other

Document Score


Views 0
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?