Comparing Alternative Route Planning Techniques: A Web-based Demonstration and User Study

Due to the popularity of smartphones, cheap wireless networks and availability of road network data, navigation applications have become a part of our everyday life. Many modern navigation systems and map-based services do not only provide the fastest route from a source location s to a target location t but also provide a few alternative routes to the users as more options to choose from. Consequently, computing alternative paths from a source s to a target t has received significant research attention in the past few years. However, it is not clear which of the existing approaches generates alternative paths of better quality because the quality of these alternatives is mostly subjective. Motivated by this, in this paper, we present the first user study that compares the quality of the alternative routes generated by four of the most popular existing approaches including the routes provided by Google Maps. We also present the details of a web-based demo system that can be accessed using any internet enabled device and allows users to see the alternative routes generated by the four approaches for any pair of source and target selected by the users. Our user study shows that although the mean rating received by Google Maps is slightly lower than the mean ratings received by the other three approaches, the results are not statistically significant. We also discuss the limitations of this user study and recommend the readers to interpret these results with caution because certain factors beyond our control may have affected the participants' ratings.

[1]  Lu Qin,et al.  Efficient shortest path index maintenance on dynamic road networks with theoretical guarantees , 2020, Proc. VLDB Endow..

[2]  Ulf Leser,et al.  Finding k-dissimilar paths with minimum collective length , 2018, SIGSPATIAL/GIS.

[3]  Erhan Erkut,et al.  On finding dissimilar paths , 2000, Eur. J. Oper. Res..

[4]  Stefan Funke,et al.  Alternative Routes for Next Generation Traffic Shaping , 2019, IWCTS@SIGSPATIAL.

[5]  Ulf Leser,et al.  Alternative routing: k-shortest paths with limited overlap , 2015, SIGSPATIAL/GIS.

[6]  Klaus Bogenberger,et al.  Reliable Pretrip Multipath Planning and Dynamic Adaptation for a Centralized Road Navigation System , 2007, IEEE Transactions on Intelligent Transportation Systems.

[7]  J. Y. Yen Finding the K Shortest Loopless Paths in a Network , 1971 .

[8]  Stefan Funke,et al.  Alternative Multicriteria Routes , 2019, Workshop on Algorithm Engineering and Experimentation.

[9]  Ulf Leser,et al.  Finding k-shortest paths with limited overlap , 2020, The VLDB Journal.

[10]  Aoying Zhou,et al.  Finding Top-k Shortest Paths with Diversity , 2018, IEEE Transactions on Knowledge and Data Engineering.

[11]  Andrew V. Goldberg,et al.  Alternative routes in road networks , 2010, JEAL.

[12]  Roland Bader,et al.  Alternative Route Graphs in Road Networks , 2011, TAPAS.

[13]  Andrew V. Goldberg,et al.  A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks , 2011, SEA.