Traffic Actuated Car Navigation Systems in Mobile Communication Networks

  • Seungjae Lee
  • Chungwon Lee
  • Taehee Kim
  • Jeong Hyun Kim
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4097)


This paper propose to see how the center based car navigation systems are practical in terms of using real time traffic information and guiding the way with different media of both of the Turn by Turn and the digital map service. The systems have been applied to all the road networks in Korea but the traffic actuated car navigation systems are mainly applicable to the road networks in the Seoul, which has 40 km diameter, including satellite cities. As a result of this, the actual driving tests are conducted in that area. The tests are analyzed using two aspects. The first aspect is that the quality of the information using the car navigation systems can be acceptable to the customers in around 80 percentage of a statistical level. The other is if the user- friendly interface is relatively helpful to the customers while they are driving a car. The result shows that the route displayed on the TFT LCD helps the drivers to understand which way they have to take.


Travel Time Standard Service Traversal Time Mobile Communication Network Variable Message Sign 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Caldwell, T.: On Finding Minimum Routes in a Network with Turn Penalties. Communications of the ACM 4, 107–108 (1961)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Chen, Y.L., Tang, K.: Shortest Paths in Time-Schedule Networks. International Journal of Operations and Quantitative Management 3, 157–173 (1997)Google Scholar
  3. 3.
    Chen, Y.L., Tang, K.: Minimum Time Paths in a Network with Mixed Time Constraints. Computers and Operations Research 25, 793–805 (1998)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Desrochers, M., Soumis, F.: A Reoptimization Algorithm for the Shortest Path Problem with Time Windows. European Journal of Operational Research 35, 242–254 (1988)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Dijkstra, E.W.: A Note on Two Problems in Connection with Graphs. Numerische Mathematik 1, 269–271 (1959)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Kaufman, D.E., Smith, R.L.: Faster Paths in Time-Dependent Networks for IVHS Applications. IVHS Journal 1, 1–11 (1993)Google Scholar
  7. 7.
    Lawler, E.L.: A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and its Application to the Shortest Path Problem. Management Science 18, 401–405 (1972)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Michalewicz, Z.: Genetic Algorithm+Data Structure=Evolution Programs. Springer, Heidelberg (1994)Google Scholar
  9. 9.
    Sheffi, Y.: Urban Transportation Networks. Prentice-Hall, Englewood Cliffs (1985)Google Scholar
  10. 10.
    Thomas, R.: Traffic Assignment Techniques, Avebury Technical (1991)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Seungjae Lee
    • 1
  • Chungwon Lee
    • 1
  • Taehee Kim
    • 2
  • Jeong Hyun Kim
    • 3
  1. 1.Dept. of Transportation Eng.The University of SeoulKorea
  2. 2.POSCO E&CSeoulKorea
  3. 3.Associate Research Fellow, Land & Urban InstituteKyunggiKorea

Personalised recommendations