Heuristic Techniques for Accelerating Hierarchical Routing on Road Networks

IEEE Transactions on Intelligent Transportation Systems

Volumn 3, Issue 4, 2002, Pages 301-308

  Jagadeesh, G R ^a   Srikanthan, T ^a,b   Quek, K H ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b IEEE   (United States)

Author keywords

Experimental analysis; Heuristic techniques; Hierarchical routing; Network pruning; Road network

Indexed keywords

EID: 0347371767     PISSN: 15249050     EISSN: None     Source Type: Journal    
DOI: 10.1109/TITS.2002.806806     Document Type: Article

References (18)

1. N. J. Nilsson, Problem Solving Methods in Artificial Intelligence. New York: Mc-Graw Hill, 1971.
2. R. Jacob, M. V. Marathe, and K. Nigel, "A computational study of routing algorithms for realistic transportation networks," presented at the Second Workshop on Algorithmic Engineering, NJ, 1998.
3. F. B. Zhan and C. E. Noon, "Shortest path Algorithms: an evaluation using real road networks," Transport. Sci., vol. 32, no. 1, pp. 65-73, 1998.
4. H. A. Karimi, "Real-time optimal route computation: a heuristic approach," ITS J., vol. 3, no. 2, pp. 111-127, 1996.
5. T. Uchida, Y. Iida, and M. Nakahara, "Panel survey on drivers' route choice behavior under travel time information," in Proc. Vehicle Navigation and Information Systems Conf., 1994, pp. 383-388.
6. S. Peeta and S. C. Chen, "A distributed computing environment for dynamic traffic operations," Computer-Aided Civil and Infrastructure Engineering, vol. 14, pp. 257-271, 1999.
7. J. Guzolek and E. Koch, "Route planning in road networks," in Proc. Vehicle Navigation and Information Systems Conf., 1989, pp. 165-169.
8. S. Shekhar and D. R. Liu, "Genesis and Advanced Traveler Information System (ATIS), killer applications for mobile computing," presented at the MOBIDATA Workshop, NJ, 1994.
9. K. Nagel and M. Rickert, "Parallel implementation of the TRANSIMS micro-simulation," Parallel Computing, vol. 27, no. 2, pp. 1611-1639, 2001.
10. Y. Zhao and T. E. Weymouth, "An adaptive route guidance algorithm for intelligent vehicle highway system," in Proc. American Control Conf., vol. 3, 1991, pp. 2568-2573.
11. A. Car and A. U. Frank, "Hierarchical street networks as a conceptual model for efficient way finding," in Proc. Fourth Eur. Conf. and Exhibition on Geographical Information Systems, vol. 1, 1993, pp. 134-139.
12. A. Car and A. U. Frank, "General principles of hierarchical spatial reasoning - the case of wayfinding," in Proc. Sixth Int. Symp. on Spatial Data Handling, vol. 2, 1994, pp. 646-664.
13. Y. Huang and N. Jing, "Evaluation of hierarchical path finding techniques for ITS route guidance," in Proc. Annu. Meeting of ITS America, vol. 1, 1996, pp. 340-350.
14. S. Shekhar, A. Fetterer, and B. Goyal, "Materialization trade-offs in hierarchical shortest path algorithms," in Proc. Int. Symp. on Large Spatial Databases, 1997.
15. B. Liu, "Intelligent route finding: combining knowledge, cases and an efficient search algorithm," in Proc. 12th Int. Conf. Artificial Intelligence, Cases and an Efficient Search Algorithm, 1996, pp. 380-384.
16. Y. Chou, E. Romeijn, and R. L. Smith, "Approximating shortest paths in large-scale networks with an application to ITS," INFORMS J. Computing, vol. 10, no. 2, pp. 163-179, 1998.
17. K. H. Quek, High Performance VLSI Architecture for Dynamic Routing in Knowledge Intensive Networks, Singapore: Nanyang Technological Univ., 2000.
18. A. Chance, R. G. Newell, and D. G. Theriault, "An overview of Smallworld Magik,", Smallworld Tech. Paper No. 5, 2000.