Robust Tabu Search Algorithm for Planning Rail-Truck Intermodal Freight Transport
Résumé
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.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...
