12 Accuracy and performance assessment of a window-based heuristic algorithm for real-time routing in map-based mobile applications

Abstract

The demand for routing algorithms that produce optimal solutions in real time is continually growing. Real-time routing algorithms are needed in many existing and emerging applications and services. An example is map-based mobile applications where real-time routing is required. Conventional optimal routing algorithms often do not provide acceptable real-time responses when applied to large real road network data. As a result, in certain real-time applications, especially those with limited computing resources (e.g., mobile devices), heuristic algorithms that can provide good solutions, though not necessarily optimal, in real time are employed. In this chapter, we present two approaches for limiting the search space using a window-based heuristic algorithm to compute shortest routes and analyze their solutions and performances using real road network data. The results of a set of experiments on the two approaches show that the window-based heuristic algorithm produces aceptable response times using real road network data and that window sizes and orientations impact accuracy and performance of the algorithm.