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

Abstract

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, we presented the service-oriented, multimodel Intelligent Journey Planning System, which we developed to assist travelers in journey planning. We selected Izmir, Turkey, as the pilot city for this system. The multicriteria problem is one of the well-known problems in transportation networks. Our 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. We 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 our path-finding algorithm takes 0.63 seconds of processing time on average, which is acceptable for the user experience.

Sustainable Rail/Road Unimodal Transportation of Bulk Cargo in Zambia: A Review of Algorithm-Based Optimization Techniques

“…Despite the routing problem being dominant, researchers in Turkey [39] further optimized travelling time to solve the routing problem in the city of Izmir using round-based transit optimizer routers, transit mode routing and contraction hierarchies on transportation graphs as their first path-finding algorithm. In coming up with the model for optimal multimodal transportation route selection, Huynh et al [40] used an analytical hierarchy process (AHP) and zero one-goal programs (ZOGP).…”

A novel method for driving path planning with spark

“…But none of the above research considered the efficiency of heuristic algorithms. The algorithms efficiency determines the actual application effect of systems or frameworks, such as literature [12]. The efficiency of Heuristic algorithms is better than traditional methods such as DP, which still has room for improvement.…”

Surface Optimal Path Planning Using an Extended Dijkstra Algorithm

“…Feristah Dalkilic et al used the Dijkstra's algorithm to reduce search space and runtime by applying stage-specific rules and utilized the algorithm in an intelligent itinerary planning system to assist passengers in itinerary planning (2017) [13]. The paper introduced a progressive path search algorithm to settle this problem, taking into account the number of transmissions and travel time.…”