Abstract
The measuring space of city streets traffic on consuming time is a NonEuclidean distance space. From the condition of city traffic attributes, an optimum route algorithm based on NonEuclidean time distance space was designed. For the turn consuming time on the streets intersection being the major section of the route using time, the virtual nodes were defined according to the azimuths of leaving the Streets intersection. Considered the consuming time passing through street sections and streets intersections, the algorithm was completed by calculating the accumulated time from the start-point to the virtual node. The algorithm was a decision-making course with some phases and realized by recursive methods. Finally, the feasibility was proved through an example.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Zhang KG, Meng HL, Sun YM, Ba MT, Wang JY (2012) The design and development of Luoyang smart traffic system. Henan Sci 30(2):217–221 (in Chinese)
Wang JY, Liu R, Cheng Y, Sun LN (2011) Making the city smarter. J Geomatics Sci Technol 28(2):79–83 (in Chinese)
Wang JY (2012) Smartness make city better. Chin J Nat 34(3):139–142 (in Chinese)
Sha ZY, Yu Z, Huang M, **ao ML (2011) Non-planar network data model for urban road guide sign system. J Geomatics Sci Technol 28(6):442–445 (in Chinese)
Wang GF, Song PF, Zhang YL (2012) Review on development status and future of intelligent transportation system. Highway 5:217–222 (in Chinese)
Zhang KG, Meng HL, Ba MT, Sun YM, Ba MT, Wang JY (2012) The development and application of database in LYSTS. Henan Sci 30(4):461–464 (in Chinese)
Huang M, Zhao JH, Wu HB, Sha ZR (2012) Transportation network database construction based on traffic markings deployment. Sci Surv Mapp 37(1):189–191 (in Chinese)
Tang JJ, Liu F (2010) A driver route prediction based map-matching algorithm integrating uncertain reasoning. Acta Geodaetica Cartogr Sin 39(5):546–550 (in Chinese)
Chang DH, Lin B, Zhang M (2011) The Chinese description of GIS path based on continuous polar coordinates. J Geomatics Sci Technol 28(4):307–312 (in Chinese)
Zhu W, Xu KL, Sun Y, Gao L (2011) Logistics distribution route planning with fusion algorithm of petri net and ant colony. J Zhejiang Univ (Eng Sci) 45(12):2229–2234 (in Chinese)
Gong EC, Li LQ (2011) The optimal path algorithm design based on Bellman-Ford algorithm. Bull Surv Mapp 8:26–41 (in Chinese)
Zheng NP, Lu F, Li QQ, Duan YY (2010) The adaption of A* algorithm for least-time paths in time-dependent transportation networks with turn delays. Acta Geodaetica Cartogr Sin 39(5):534–539 (in Chinese)
Ledoux C (1997) An urban traffic flow model integrating network. Transp Res 5(5):287–300
Zhang KG, Meng HL, Ba MT, Song GX, Wang JY (2012) The research of address geocoding technology in LYSTS. Henan Sci 30(7):921–925 (in Chinese)
Zhang KG, Ba MT, Meng HL, Sun YM, Wang JY (2012) The research of vehicles guidance system in LYSTS. Henan Sci 30(8):1121–1125 (in Chinese)
Acknowledgments
This paper is support by the Natural Science Foundation of Henan (No.122102310379).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Atlantis Press and the author(s)
About this paper
Cite this paper
Zhang, Kg., Meng, Hl., Ba, Mt., Sun, Ym. (2016). The Research of Optimum Route Algorithm in Time Measure Space. In: Qi, E. (eds) Proceedings of the 6th International Asia Conference on Industrial Engineering and Management Innovation. Atlantis Press, Paris. https://doi.org/10.2991/978-94-6239-145-1_4
Download citation
DOI: https://doi.org/10.2991/978-94-6239-145-1_4
Published:
Publisher Name: Atlantis Press, Paris
Print ISBN: 978-94-6239-144-4
Online ISBN: 978-94-6239-145-1
eBook Packages: Business and ManagementBusiness and Management (R0)