Finding intermodal and multi-objective time-dependent best routes with exact algorithm

The paper presents a solution of finding the Pareto front for the intermodal and multi-objective time-dependent shortest path problem from a source to a destination. In the considered case, the travel time and route cost must be minimized. A mathematical model of the multimodal time-dependent freight transport network is constructed and then an exact multi-objective algorithm is proposed and implemented. Finally, the performance and effectiveness of the method are assessed by analyzing the algorithm's behavior when different network's parameters change.