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.
Type de document :
Communication dans un congrès
Khalid Saeed; Władysław Homenda. 15th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Sep 2016, Vilnius, Lithuania. Springer International Publishing, Lecture Notes in Computer Science, LNCS-9842, pp.289-299, 2016, Computer Information Systems and Industrial Management. 〈10.1007/978-3-319-45378-1_26〉
Liste complète des métadonnées

Littérature citée [22 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01637497
Contributeur : Hal Ifip <>
Soumis le : vendredi 17 novembre 2017 - 15:45:10
Dernière modification le : samedi 18 novembre 2017 - 01:16:40

Fichier

 Accès restreint
Fichier visible le : 2019-01-01

Connectez-vous pour demander l'accès au fichier

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Collections

Citation

Wojciech Bożejko, Radoslaw Grymin, Szymon Jagiełło, Jarosław Pempera. Robust Tabu Search Algorithm for Planning Rail-Truck Intermodal Freight Transport. Khalid Saeed; Władysław Homenda. 15th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Sep 2016, Vilnius, Lithuania. Springer International Publishing, Lecture Notes in Computer Science, LNCS-9842, pp.289-299, 2016, Computer Information Systems and Industrial Management. 〈10.1007/978-3-319-45378-1_26〉. 〈hal-01637497〉

Partager

Métriques

Consultations de la notice

16