An intermodal transport network planning algorithm using dynamic programming

Abstract

This paper presents a dynamic programming algorithm to draw optimal intermodal freight routing with regard to international logistics of container cargo for export and import. This study looks into the characteristics of intermodal transport using two or more modes, and presents a Weighted Constrained Shortest Path Problem (WCSPP) model. This study draws a Pareto optimal solution that can simultaneously meet two objective functions by applying the Label Setting algorithm, one of the Dynamic Programming algorithms, after setting feasible area using the objective function values drawn in the model. To improve the algorithm performance, pruning rules have also been presented. The algorithm is applied to real transport paths from Busan to Rotterdam. This study quantitatively measures the savings effect of transport cost and time by comparing single transport modes with existing intermodal transport paths. Lastly, this study applies the multiple Pareto optimal solutions drawn, to a mathematical model and MADM model, and compares the two evaluation methods as a means to evaluate the solutions. © Springer-Verlag Berlin Heidelberg 2007.