, Volume 18, Issue 3, pp 461–500

TARS: traffic-aware route search


DOI: 10.1007/s10707-013-0185-z

Cite this article as:
Levin, R. & Kanza, Y. Geoinformatica (2014) 18: 461. doi:10.1007/s10707-013-0185-z


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.


Geographic information systems Route search Temporal constraints Probabilistic data  Heuristic algorithms Traffic 

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Taub Building, Technion Israel Institute of TechnologyHaifaIsrael

Personalised recommendations