TARS: traffic-aware route search

In a traffic-aware route search (TARS), the user provides start and target locations and sets of search terms. The goal is to find the fastest route from the start location to the target via geographic entities (points of interest) that correspond to the search terms, while taking into account variations in the travel speed due to changes in traffic conditions, and the possibility that some visited entities will not satisfy the search requirements. A TARS query may include temporal constraints and order constraints that restrict the order by which entities are visited. Since TARS generalizes the Traveling-Salesperson Problem, it is an NP-hard problem. Thus, it is unlikely to find a polynomial-time algorithm for evaluating TARS queries. Hence, we present in this paper three heuristics to answer TARS queries—a local greedy approach, a global greedy approach and an algorithm that computes a linear approximation to the travel speeds, formulates the problem as a Mixed Integer Linear Programming (MILP) problem and uses a solver to find a solution. We provide an experimental evaluation based on actual traffic data and show that using a MILP solver to find a solution is effective and can be done within a limited running time in many real-life scenarios. The local-greedy approach is the least effective in finding a fast route, however, it has the best running time and it is the most scalable.

[1]  Abraham P. Punnen,et al.  The traveling salesman problem and its variations , 2007 .

[2]  G. Laporte,et al.  Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach , 1983 .

[3]  Yerach Doytsher,et al.  Storing routes in socio-spatial networks and supporting social-based route recommendation , 2011, LBSN '11.

[4]  Soondal Park,et al.  Shortest paths in a network with time-dependent flow speeds , 1998, Eur. J. Oper. Res..

[5]  Shashi Shekhar,et al.  A Dartboard Network Cut Based Approach to Evacuation Route Planning: A Summary of Results , 2012, GIScience.

[6]  Yehoshua Sagiv,et al.  Interactive route search in the presence of order constraints , 2010, Proc. VLDB Endow..

[7]  Peter Sanders,et al.  Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks , 2008, WEA.

[8]  Jeffrey Xu Yu,et al.  Finding time-dependent shortest paths over large graphs , 2008, EDBT '08.

[9]  Yehoshua Sagiv,et al.  Computing a k -Route over Uncertain Geographical Data , 2007, SSTD.

[10]  Feifei Li,et al.  On Trip Planning Queries in Spatial Databases , 2005, SSTD.

[11]  Biagio Mazzi,et al.  About the Web Site , 2013 .

[12]  Andrew U. Frank,et al.  Using a modified invasive weed optimization algorithm for a personalized urban multi-criteria path optimization problem , 2012, Int. J. Appl. Earth Obs. Geoinformation.

[13]  Shashi Shekhar,et al.  Evacuation Route Planning: a Case Study in Semantic Computing , 2007, Int. J. Semantic Comput..

[14]  Yerach Doytsher,et al.  Efficient Orienteering-Route Search over Uncertain Spatial Datasets , 2008 .

[15]  Petrica C. Pop,et al.  NEW INTEGER PROGRAMMING FORMULATIONS OF THE GENERALIZED TRAVELING SALESMAN PROBLEM , 2007 .

[16]  Gilbert Laporte,et al.  The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm , 2009, Math. Program..

[17]  Shashi Shekhar,et al.  Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Results , 2005, SSTD.

[18]  Shashi Shekhar,et al.  Evacuation route planning: scalable heuristics , 2007, GIS.

[19]  Jiajie Xu,et al.  Traffic Aware Route Planning in Dynamic Road Networks , 2012, DASFAA.

[20]  A. Prasad Sistla,et al.  A data model for trip planning in multimodal transportation systems , 2009, EDBT '09.

[21]  Yuan Tian,et al.  Monitoring minimum cost paths on road networks , 2009, GIS.

[22]  Yehoshua Sagiv,et al.  Heuristic algorithms for route-search queries over geographical data , 2008, GIS '08.

[23]  Tanzima Hashem,et al.  Group Trip Planning Queries in Spatial Databases , 2013, SSTD.

[24]  Ronald F. Kirby,et al.  The minimum route problem for networks with turn penalties and prohibitions , 1969 .

[25]  Egon Balas,et al.  The prize collecting traveling salesman problem , 1989, Networks.

[26]  Kyriakos Mouratidis,et al.  Constrained Shortest Path Computation , 2005, SSTD.

[27]  Yang Du,et al.  Finding Fastest Paths on A Road Network with Speed Patterns , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[28]  David Simchi-Levi,et al.  A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty , 1996, Oper. Res..

[29]  Roger Zimmermann,et al.  The partial sequenced route query with traveling rules in road networks , 2011, GeoInformatica.

[30]  Léon J. M. Rothkrantz,et al.  Hierarchical Routing in Traffic Using Swarm-Intelligence , 2006, 2006 IEEE Intelligent Transportation Systems Conference.

[31]  Yehoshua Sagiv,et al.  An interactive approach to route search , 2009, GIS.

[32]  Bruce L. Golden,et al.  Solving the Time Dependent Traveling Salesman Problem , 2005 .

[33]  Shashi Shekhar,et al.  Contraflow Transportation Network Reconfiguration for Evacuation Route Planning , 2008, IEEE Transactions on Knowledge and Data Engineering.

[34]  Cyrus Shahabi,et al.  The optimal sequenced route query , 2008, The VLDB Journal.

[35]  Stephan Winter,et al.  Modeling Costs of Turns in Route Planning , 2002, GeoInformatica.

[36]  Roger Zimmermann,et al.  The multi-rule partial sequenced route query , 2008, GIS '08.

[37]  Erik G. Hoel,et al.  High Performance Multimodal Networks , 2005, SSTD.

[38]  Roman Barták,et al.  Constraint Processing , 2009, Encyclopedia of Artificial Intelligence.

[39]  Nico Vandaele,et al.  A Queueing Framework for Routing Problems with Time-dependent Travel Times , 2007, J. Math. Model. Algorithms.

[40]  John N. Tsitsiklis,et al.  Special cases of traveling salesman and repairman problems with time windows , 1992, Networks.

[41]  Eric Horvitz,et al.  Trip Router with Individualized Preferences (TRIP): Incorporating Personalization into Route Planning , 2006, AAAI.

[42]  Jiawei Han,et al.  Adaptive Fastest Path Computation on a Road Network: A Traffic Mining Approach , 2007, VLDB.

[43]  Thambipillai Srikanthan,et al.  Heuristic techniques for accelerating hierarchical routing on road networks , 2002, IEEE Trans. Intell. Transp. Syst..

[44]  Arthur V. Hill,et al.  Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems , 1992 .

[45]  Yehoshua Sagiv,et al.  WISER: a web-based interactive route search system for smartphones , 2012, WWW.

[46]  Yaron Kanza,et al.  TARSIUS: a system for traffic-aware route search under conditions of uncertainty , 2011, GIS.

[47]  Cyrus Shahabi,et al.  Processing Optimal Sequenced Route Queries Using Voronoi Diagrams , 2008, GeoInformatica.

[48]  Andrew U. Frank,et al.  Combining Trip and Task Planning: How to Get from A to Passport , 2012, GIScience.

[49]  Shashi Shekhar,et al.  Evacuation Planning: A Spatial Network Database Approach , 2010, IEEE Data Eng. Bull..

[50]  Tom Caldwell,et al.  On finding minimum routes in a network with turn penalties , 1961, CACM.