A Gradual Approach for Multimodel Journey Planning: A Case Study in Izmir, Turkey

Planning a journey by integrating route and timetable information from diverse sources of transportation agencies such as bus, ferry, and train can be complicated. A user-friendly, informative journey planning system may simplify a plan by providing assistance in making better use of public transportation. In this study, the authors presented the service-oriented, multimodel Intelligent Journey Planning System, which the authors developed to assist travelers in journey planning. The authors selected Izmir, Turkey, as the pilot city for this system. The multicriteria problem is one of the well-known problems in transportation networks. The study proposes a gradual path-finding algorithm to solve this problem by considering transfer count and travel time. The algorithm utilizes the techniques of efficient algorithms including round based public transit optimized router, transit node routing, and contraction hierarchies on transportation graph. The authors employed Dijkstra's algorithm after the first stage of the path-finding algorithm by applying stage specific rules to reduce search space and runtime. The experimental results show that the path-finding algorithm takes 0.63 seconds of processing time on average, which is acceptable for the user experience.


  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01666159
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Mar 15 2018 12:05PM