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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barnhart, C., Donald, H.R.: Modeling Intermodal Routing. Journal of Business Logistics. 14(1), 205–223 (1993)
Boardman, B.S., Malstrom, E.M., Butler, D.P., Cole, M.H.: Computer Assisted Routing of Intermodal Shipments. Computers and Industrial Engineering. 33(1-2), 311–314 (1997)
Chen, Y.L., Chin, Y.H.: The Quickest Path Problem. Computer Operations Research 17(2), 153–161 (1990)
Descrochers, M., Soumis, F.: A Generalized Permanent Labeling Algorithm for the Shortest Path Problem with Time Windows. INFOR 26, 191–212 (1988)
Jang, Y., Kim, E.: Study on the Optimized Model of Intermodal Transport Using Genetic Algorithm. Shipping Logistics Research (45), 75–98 (2005)
Macharis, C., Bontekoning, Y.M.: Opportunities for OR in Intermodal Freight Transport Research: A Review. European Journal of Operational Research 153, 400–416 (2004)
Martins, E.Q.V.: On a Multicriteria Shortest Path Problem. European Journal of Operational Research. 1, 236–245 (1984)
Min, H.: International Intermodal Choices via Chance-constrained Goal Programming. Transportation Research Part A: General 25(6), 351–362 (1991)
Moore, M.H.: On the Fastest Route for Convey-type Traffic in Flowrate-contrained Networks. Transportation Science 10, 113–124 (1976)
Pasquale, A., Maurizio, B., Antonio, S.: A Penalty Function Heuristic for the Resource constrained Shortest Path Problem. European Journal of Operational Research 142, 221–230 (2002)
Rosen, J.B., Sun, S.Z., Xue, G.L.: Algorithm for the Quickest Path Problem and the Enumeration of Quickest Paths. Computer Operations Research 18(6), 579–584 (1991)
Yu, I., Kim, J., Cho, G., So, S., Park, Y.: Study on the Evaluation Standards to Select Third Party Logistics Firms. Journal of Korea Information and Strategy Society 8(1), 579–584 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Cho, J.H., Kim, H.S., Choi, H.R., Park, N.K., Kang, M.H. (2007). An Intermodal Transport Network Planning Algorithm Using Dynamic Programming. In: Okuno, H.G., Ali, M. (eds) New Trends in Applied Artificial Intelligence. IEA/AIE 2007. Lecture Notes in Computer Science(), vol 4570. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73325-6_101
Download citation
DOI: https://doi.org/10.1007/978-3-540-73325-6_101
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73322-5
Online ISBN: 978-3-540-73325-6
eBook Packages: Computer ScienceComputer Science (R0)