Abstract
In this paper, a simplified hierarchical route network model (SHRNM) is proposed for the optimal shortest road route discovery of transportation systems in metropolitan area. The Dijkstra algorithms are applied for the optimal path calculation. In our model, the metric of shortest path is the driving time. The four types of roads of urban road, bypass route, expressway and freeway are designed for different driving speeds in the hierarchical model. Thus, the shortest path can easily be found with proposed simple road traffic model. Simulation results show that the driving time of the discovered shortest route is faster than that of the four types of roads.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Zhang, C., Zhang, F., Ren, J., Ren, J.: Multidimensional Traffic GPS Data Quality Analysis Using Data Cube Model. In: International Conference on Transportation, Mechanical, and Electrical Engineering (TMEE), pp. 307–310 (December 2011)
Fan, D., Shi, P.: Improvement of Dijkstra’s Algorithm and Its Application in Route Planning. In: Proceedings of Seventh International Conference on Fuzzy Systems and Knowledge Discovery (FSKD), pp. 1901–1904 (2010)
Chabini, I., Lan, S.: Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks. Proceedings of IEEE Transactions on Intelligent Transportation Systems, 60–74 (March 2002)
Nordin, N.A.M., Kadir, N., Zaharudin, Z.A., Nordin, N.A.: An Application of the A* Algorithm on the Ambulance Routing. In: Proceedings of IEEE Colloquium on Humanities, Science and Engineering Research (CHUSER), pp. 855–859 (December 2011)
Shen, G.J.: An Intelligent Hybrid Forecasting Model for Short-term Traffic Flow. In: Proceedings of the World Congress on Intelligent Control and Automation, pp. 486–491 (July 2010)
Mainali, M.K., Mabu, S., Hirasawa, K.: Evolutionary Approach for the Traffic Volume Estimation of Road Sections. In: Proceedings of IEEE International Conference on Systems Man and Cybernetics (SMC), pp. 100–105 (2010)
Comer, D.E.: Computer Networks And Internets (M-PIE), 5th edn. Peterson (January 2009)
Uppoor, S., Pai, M.M.M., Boussedjra, M., Mouzna, J.: Scalable routing technique using road hierarchy for vehicular networks. In: Proceedings of 2009 9th International Conference on Intelligent Transport Systems Telecommunications (ITST), pp. 403–407 (2009)
Zhimin, A.W., Xianfeng, B.L.: The model and algorithm for finding the optimal route in a dynamic road network. In: Proceedings of 2003 IEEE Intelligent Transportation Systems, vol. 2, pp. 1495–1498 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Huang, YF., Lin, JY., Hsu, CH., Boonyos, S., Wen, JH. (2014). A Hierarchical Road Model for Shortest Route Discovery in Vehicular Networks. In: Nguyen, N.T., Attachoo, B., Trawiński, B., Somboonviwat, K. (eds) Intelligent Information and Database Systems. ACIIDS 2014. Lecture Notes in Computer Science(), vol 8398. Springer, Cham. https://doi.org/10.1007/978-3-319-05458-2_34
Download citation
DOI: https://doi.org/10.1007/978-3-319-05458-2_34
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-05457-5
Online ISBN: 978-3-319-05458-2
eBook Packages: Computer ScienceComputer Science (R0)