{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T23:41:30Z","timestamp":1770680490253,"version":"3.49.0"},"reference-count":11,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2016,10,1]],"date-time":"2016-10-01T00:00:00Z","timestamp":1475280000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems: Applications in Engineering and Technology"],"published-print":{"date-parts":[[2016,10]]},"abstract":"<jats:p>In urban area, the delay due to the traffic-light should be taken into considerable when searching for the optimal path. So this paper presents an algorithm for find the real-time shortest path in urban area with traffic-light. The core of the algorithm is a translation module which can translate the delay due to the traffic-light(a quantity about time) into length (a quantity about space). In this way to simplify the calculation difficulty and combine the influence due to time delay as well as length simultaneously. Then, this module was added into the heuristic function of A* algorithm to get the improved algorithm. Finally, the simple simulation of the algorithm shown that it can save 5.8% time even when driving more 10% distances. In conclusion, the algorithm is very suitable for the urban traffic and the longer the distance, the more obvious effects it would be.<\/jats:p>","DOI":"10.3233\/jifs-169081","type":"journal-article","created":{"date-parts":[[2016,9,9]],"date-time":"2016-09-09T13:12:15Z","timestamp":1473426735000},"page":"2403-2410","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":8,"title":["The real-time shortest path algorithm with\u00a0a\u00a0consideration of traffic-light"],"prefix":"10.1177","volume":"31","author":[{"given":"Lin","family":"Hu","sequence":"first","affiliation":[{"name":"Changsha University of Science and Technology","place":["China"]},{"name":"Changsha University of Science and Technology","place":["China"]}]},{"given":"Jia","family":"Yang","sequence":"additional","affiliation":[{"name":"Changsha University of Science and Technology","place":["China"]},{"name":"Changsha University of Science and Technology","place":["China"]}]},{"given":"Jing","family":"Huang","sequence":"additional","affiliation":[{"name":"Hunan University","place":["China"]}]}],"member":"179","published-online":{"date-parts":[[2016,10]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1243\/09544070JAUTO534"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2015.02.002"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2015.09.003"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2014.01.001"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.envres.2013.03.004"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2011.09.007"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00148-0"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0191-2615(03)00048-1"},{"key":"e_1_3_2_10_2","first-page":"882","article-title":"Shortest paths in synchronized traffic-light networks","author":"Khanjary M.","year":"2011","unstructured":"KhanjaryM., FaezK., MeybodiM.R. and SabaeiM., Shortest paths in synchronized traffic-light networks, CCECE (2011), 882\u2013886.","journal-title":"CCECE"},{"key":"e_1_3_2_11_2","first-page":"4720","article-title":"Implementation of path planning method of intelligent vehicle based on mapX","author":"Duan J.","year":"2014","unstructured":"DuanJ., GeH. and YaoJ., Implementation of path planning method of intelligent vehicle based on mapX, CCDC (2014), 4720\u20134724.","journal-title":"CCDC"},{"issue":"5","key":"e_1_3_2_12_2","first-page":"680","article-title":"Shortest path algorithm with a consideration of waiting time at signalized intersections","volume":"41","author":"Yang F.","year":"2013","unstructured":"YangF., YangX.G. and YunM.P., Shortest path algorithm with a consideration of waiting time at signalized intersections, J Tongji Univers41(5) (2013), 680\u2013686.","journal-title":"J Tongji Univers"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems: Applications in Engineering and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-169081","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-169081","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-169081","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T07:27:13Z","timestamp":1770622033000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-169081"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["10.3233\/JIFS-169081"],"URL":"https:\/\/doi.org\/10.3233\/jifs-169081","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10]]}}}