Skip to main content

Advertisement

Springer Nature Link
Log in

Multimedia application to an extended public transportation network in South Korea: optimal path search in a multimodal transit network

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

Various traffic network usage formats have arisen along with the popularization of automobiles and the continued service extension of busses, subways, and other forms of public transportation. Due to various characteristics of public transportation networks, unlike general street networks, many issues can affect public transportation, and an optimal course search should be considered. Present research considers plans to improve the overall efficiency of public transportation systems with regard to destination, means, route, and other factors to be selected efficiently in this environment as public transportation usage increases. From this perspective, it suggests the characteristics that a multimodal transit network route search algorithm should have and a corrective algorithm that implements this in an applicable program. Implementation was done in Google android application which provides a simple user interface to find optimal routes in Google Map. The proposed application would enable overall quality-of-service improvement and balanced usage of public transportation, efficient traffic management, and other advantages.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

Explore related subjects

Discover the latest articles and news from researchers in related subjects, suggested using machine learning.

References

  1. Ahuja RK, Mehlhorn K, Orlin JB, Tarjan RE (1990) Faster algorithms for the shortest path problem. J Assoc Comput Mach 37(2):213–223

    Article  MathSciNet  MATH  Google Scholar 

  2. Ahuja RK, Magnanti TL, Orlin JB (1991) Some recent advances in network flows. SIAM Rev 33(2):175–219

    Article  MathSciNet  MATH  Google Scholar 

  3. Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice-Hall, Inc. Upper Saddle River

    MATH  Google Scholar 

  4. Benjamin Zhan F (1997) Three fastest shortest path algorithms on real road networks: data structures and procedures. J Geogr Inf Decis Anal 1(1):70–82

    Google Scholar 

  5. Brumbaugh-Smith J, Shoer D (1989) An empirical investigation of some bicriterion–shortest path algorithms. Eur J Oper Res 43:216–224

    Article  MathSciNet  MATH  Google Scholar 

  6. Cherkassky BV, Goldberg AV, Silverstein C (1999) Buckets, heaps, lists, and monotone priority queues. SIAM J Comput 28(4):1326–1346

    Article  MathSciNet  MATH  Google Scholar 

  7. Choi KJ, Jang WJ (1998) A model for shortest path calculation on intermodal transportation network. Journal of Korea transportation research. Society 16(4):167–186

    Google Scholar 

  8. Chun SH, Shin SI, Lee IY, Lee CJ (2008) A methodology of multimodal public transportation network building and path searching using transportation card data. Journal of Korea transportation research. Society 26(3):233–243

    Google Scholar 

  9. Corley HW, Moon ID (1985) Shortest path in networks with vector weights. J Optim Theory Appl 46(1):79–86

    Article  MathSciNet  MATH  Google Scholar 

  10. Dijkstra EW (1959) A note on two problems in connection with graphs. Mumerische Mathematik 1:269–271

    Article  MATH  Google Scholar 

  11. Johnson D (1973) A note on Dijkstra's shortest path algorithm. J Assoc Comput Mach 20(3):385–388

    Article  MathSciNet  MATH  Google Scholar 

  12. Kim HM, Lim YT, Lee SJ (1999) Development of an integrated network model for mode choice and trip assignment. Journal of Korea transportation research. Society 17(5):87–98

    Google Scholar 

  13. Lazano A, Storchi G (2001) Shortest viable path algorithm in multimodal networks. Transp Res A Policy Pract 35(3):225–241

    Article  Google Scholar 

  14. Lee, M. (2004). Transportation network models and algorithms considering directional delay and prohibition for intersection movement. Ph.D. Dissertation, University of Wisconsin Madison

  15. Lee MY, Kim HC, Park DJ, Shin SI (2008) A link-based label correcting multi-objective shortest paths algorithm in multi-modal transit networks. Journal of Korea transportation research. Society 26(1):127–135

    Google Scholar 

  16. Lee MY, Baek NC (2005) Finding alternative routes in inter modal transit networks considering constraints. Journal of Korean Society of IT Service 4(1):1–13

    MathSciNet  Google Scholar 

  17. Lozano A, Storchi G (2001) Shortest viable path algorithm in multimodal networks. Transp Res A 35:225–241

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  19. Moore EF (1959) The shortest path through a maze, proceedings of the international symposium on theory of switching, vol 2. MAL Harvard University Press, Cambridge, pp. 285–292

    Google Scholar 

  20. Shin SI, Park JJ, Lee JC, Ha TJ (2008) Development of user customized path finding algorithm for public transportation information. Journal of Korean Society of Civil Engineering 28(3):317–323

    Google Scholar 

  21. Skriver A, Anderson K (2000) A label correcting approach for solving bicriterion shortest-path problems. Comput Oper Res 27:507–524

    Article  MathSciNet  MATH  Google Scholar 

  22. Yang, R., S. Zhou, and C. Fan. (2008). A new algorithm for tetwork diameter. The 9th international conference for young computer scientists

Download references

Author information

Authors and Affiliations

  1. Department of Systems Management Engineering, Sungkyunkwan Universtiy, Gyeonggi-do, South Korea

    Yongshin Kang

  2. Department of Industrial and Systems Engineering, Dongguk University, 82-1, Pil-dong, Chung-gu, Seoul, South Korea

    Sekyoung Youm

Authors
  1. Yongshin Kang
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Sekyoung Youm
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Sekyoung Youm.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kang, Y., Youm, S. Multimedia application to an extended public transportation network in South Korea: optimal path search in a multimodal transit network. Multimed Tools Appl 76, 19945–19957 (2017). https://doi.org/10.1007/s11042-016-4015-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-016-4015-9

Keywords