Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

An intermodal transport network planning algorithm using dynamic programming—A case study: from Busan to Rotterdam in intermodal freight routing

  • Published:
Applied Intelligence Aims and scope Submit manuscript

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 multi-modes, and presents a Weighted Constrained Shortest Path Problem (WCSPP) model. This study draws Pareto optimal solutions that can simultaneously meet two objective functions by applying the Label Setting algorithm, a type of Dynamic Programming algorithms, after setting the feasible area. To improve the algorithm performance, pruning rules have also been presented. The algorithm is applied to real transport paths from Busan to Rotterdam, as well as to large-scale cases. This study quantitatively measures the savings in both transport cost and time by comparing single transport modes with intermodal transport paths. Last, this study applies a mathematical model and MADM model to the multiple Pareto optimal solutions to estimate the solutions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Barnhart C, Donald HR (1993) Modeling intermodal routing. J Bus Logist 14(1):205–223

    Google Scholar 

  2. Min H (1991) International intermodal choices via chance-constrained goal programming. Transp Res Part A: Gen 25(6):351–362

    Article  MathSciNet  Google Scholar 

  3. Yu I, Kim J, Cho G, So S, Park Y (2004) Study on the evaluation standards to select third party logistics firms. J Korea Inform Strategy Soc 8(1):579–584

    Google Scholar 

  4. Boardman BS, Malstrom EM, Butler DP, Cole MH (1997) Computer-assisted routing of intermodal shipments. Comput Ind Eng 33(1–2):311–314

    Article  Google Scholar 

  5. Macharis C, Bontekoning YM (2004) Opportunities for OR in intermodal freight transport research: a review. Eur J Oper Res 153:400–416

    Article  MATH  Google Scholar 

  6. Jang Y, Kim E (2005) Study on the optimized model of intermodal transport using genetic algorithm. Shipping Logist Res 45:75–98

    Google Scholar 

  7. Martins EQV (1984) On a multicriteria shortest path problem. Eur J Oper Res 1:236–245

    Article  Google Scholar 

  8. Pasquale A, Maurizio B, Antonio S (2002) A penalty function heuristic for the resource constrained shortest path problem. Eur J Oper Res 142:221–230

    Article  Google Scholar 

  9. Chen YL, Chin YH (1990) The quickest path problem. Comput Oper Res 17(2):153–161

    Article  MathSciNet  MATH  Google Scholar 

  10. Moore MH (1976) On the fastest route for convey-type traffic in flowrate-contrained networks. Transp Sci 10:113–124

    Article  Google Scholar 

  11. Rosen JB, Sun SZ, Xue GL (1991) Algorithm for the quickest path problem and the enumeration of quickest paths. Comput Oper Res 18(6):579–584

    Article  MathSciNet  MATH  Google Scholar 

  12. Descrochers M, Soumis F (1988) A generalized permanent labeling algorithm for the shortest path problem with time windows. INFOR 26:191–212

    Google Scholar 

  13. Hwang CL, Yoon KS (1981) Multiple attribute decision making: methods and applications. Lecture notes in economics and mathematical systems. Springer, Berlin

    MATH  Google Scholar 

  14. Chang TS (2008) Best routes selection in international intermodal networks. Comput Oper Res 35:2877–2891

    Article  MATH  Google Scholar 

  15. Andersen J, Crainic TG, Christiansen M (2009) Service network design with management and coordination of multiple fleets. Eur J Oper Res 193:377–389

    Article  MathSciNet  MATH  Google Scholar 

  16. Caramia M, Guerriero F (2009) A heuristic approach to long-haul freight transportation with multiple objective functions. Omega 37:600–614

    Article  Google Scholar 

  17. Macharis C, Bontekoning YM (2004) Opportunities for OR in intermodal freight transport research: a review. J Oper Res 153:400–416

    MATH  Google Scholar 

  18. Southworth F, Peterson BE (2000) Intermodal and international freight network modeling. Transp Res Part C 8:147–166

    Article  Google Scholar 

  19. Androutsopoulos KN, Zografos KG (2009) Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network. J Oper Res 192:18–28

    MathSciNet  MATH  Google Scholar 

  20. Dumitrescu I, Boland N (2001) Algorithms for the weight constrained shortest path problem. Int Trans Oper Res 8(1):15–29

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of International Business and Area Studies, Pusan University of Foreign Studies, 55-1 Uam-dong, Nam-gu, Busan, 608-738, South Korea

    Jae Hyung Cho

  2. Department of Management Information Systems, Dong-A University, 1, 2-ga, Bumin-dong, Seo-gu, Busan, 602-760, South Korea

    Hyun Soo Kim & Hyung Rim Choi

Authors
  1. Jae Hyung Cho
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hyun Soo Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hyung Rim Choi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hyun Soo Kim.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cho, J.H., Kim, H.S. & Choi, H.R. An intermodal transport network planning algorithm using dynamic programming—A case study: from Busan to Rotterdam in intermodal freight routing. Appl Intell 36, 529–541 (2012). https://doi.org/10.1007/s10489-010-0223-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-010-0223-6

Keywords

Search

Navigation