Tabu Search Algorithm for Cost Optimization in Multimodal Transport

In presented article, the multimodal transport problem between a set of transshipment depots and a set of final recipients using non-homogenous vehicle fleet is being considered. A mathematical model was proposed with real-life constraints such as load and capacity limitations, the number of vehicles in a given depot, and the inability to divide the order. As solving methods, greedy and Tabu Search algorithms were implemented. The results show that for given problem Tabu Search can improve initial solution obtained by greedy algorithm in all cases. For Tabu Search algorithm, applying aspiration criteria, bigger iteration number and longer tabu list, can lead to better results.