No abstract

No abstract

No abstract

In this chapter, the authors propose a mixed integer linear programming model (MILP) to address the shortest path problem when trans-shipments exist on combined freight transport operations. The objective is to minimize trip duration, cost, and CO2 emissions. For solving this problem, we propose an extension of Dijkstra's algorithm that identifies the optimal way of cargo movement with trans-shipment. We applied the proposed algorithm in real-life data by embracing three different types of transportation modes, namely road, rail, and inland waterways (IWW), and by testing it in three different cases where (1) goods should cross 2 or 3 South East Europe (SEE) countries, (2) goods should cover a distance more or less than 500 km, and (3) goods with origin the Port of Piraeus and destination four capital cities of SEE. The results show that the use of road transport is the most favorable solution if trip duration is the main criterion, whereas combined transport is selected when minimization of cost and CO2 emissions is the objective.