Accuracy and Performance Assessment of a Window-Based Heuristic Algorithm for Real-Time Routing in Map-Based Mobile Applications
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.
KeywordsWindow Size Road Network Destination Node Road Segment Optimal Route
Unable to display preview. Download preview PDF.
- Bertskas, D. P., and Gallager, R. (1992): Data Networks, Englwood Cliffs, NJ: Prentice Hall.Google Scholar
- Bovy, P. H. L., and Stern, E. (1990): Route Choice: Wayfinding in Transport Networks, Kluwer Academic Publishers, Boston, MA.Google Scholar
- Fu, L., Sun, D., and Rilett, L. R. (2006): “Heuristic shortest path algorithms for transportation applications: State of the art”. Computers & Operations Research Part Special Issue: Operations Research and Data Mining, 33(11), 3324-3343.Google Scholar
- Huang, B., Wu, Q., and Zhan, F. B. (2006): “A Shortest Path Algorithm with Novel Heuristics for Dynamic Transportation Networks”. International Journal of Geographical Information Science.Google Scholar
- Jacob, R., Marathe, M. V., and Nagel, K. (1999): “A computational study of routing algorithms for realistic transportation networks”. ACM Journal of Experimental Algorithmics.vol.4; 1999.Google Scholar
- Jagadeesh, G. R., Srikanthan, T., and Quek, K. H. (2002): “Combining hierarchical and heuristic techniques for high-speed route computing on road networks”. Computing and Control Engineering Journal, June 2002, 120-126.Google Scholar
- Karimi, H. A. (1996): “Real-time optimal-route computation: A heuristic approach”. ITS Journal, 3(2), 111-127.Google Scholar
- Terrovitis, M., Bakiras, S., Papadias, D., and Mouratidis, K. (2005): “Constrained Shortest Path Computation”. Advances in Spatial and Temporal Databases, 9th International Symposium, SSTD, Angra dos Reis, Brazil, 181-199.Google Scholar
- TIGER/Line Files. (2002a): “UA Census 2000 TIGER/Line Files Technical Documentation. <http://www.census.gov/geo/www/tiger/tigerua/ua_tgr2k.html>.” The U.S. Census Bureau, Washington DC.Google Scholar
- TIGER/Line Files. (2002b):. “UA Census 2000 TIGER/Line Files: machine-readable data files. < http://www.census.gov/geo/www/tiger/tigerua/ua_tgr2k.html>.” The U.S. Census Bureau, Washington DC.Google Scholar
- Zhao, Y., and Weymouth, T. E. (1991): “An adaptive route guidance algorithm for intelligent vehicle highway system”. American Control Conference, 3, 2568-2573.Google Scholar