{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T16:23:22Z","timestamp":1771259002190,"version":"3.50.1"},"reference-count":26,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2015,11,6]],"date-time":"2015-11-06T00:00:00Z","timestamp":1446768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJGI"],"abstract":"<jats:p>For oversized cargo transportation, traditional transportation schemes only consider road length, road width, the transportation cost as weight values in analysis and calculation of route selection. However, for oversized trucks, turning direction at road intersections is also a factor worth considering. By introducing the classical algorithm of Dijkstra into the model of road network, this research considers the size of turning angle at intersections as the weight value of the edge in the auxiliary network based on the weight values of road corners, upon which the shortest path analysis is performed. Then, an optimal path with minimum time cost was eventually obtained. The proposed algorithm was analyzed and compared with the traditional shortest path algorithm and it reported that our method could reduce the time for oversized trucks to pass through intersections. In addition, the proposed algorithm could be adapted to the complex and diverse road networks and provide a reliable scheme for route selection of oversized trucks.<\/jats:p>","DOI":"10.3390\/ijgi4042428","type":"journal-article","created":{"date-parts":[[2015,11,6]],"date-time":"2015-11-06T11:12:15Z","timestamp":1446808335000},"page":"2428-2445","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Optimized Route Selection Method based on the Turns of Road Intersections: A Case Study on Oversized Cargo Transportation"],"prefix":"10.3390","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7224-677X","authenticated-orcid":false,"given":"Lingkui","family":"Meng","sequence":"first","affiliation":[{"name":"School of Remote Sensing and Information Engineering, Wuhan University, 129 LuoyuRoad, Wuhan 430079, China"}]},{"given":"Zhenghua","family":"Hu","sequence":"additional","affiliation":[{"name":"School of Remote Sensing and Information Engineering, Wuhan University, 129 LuoyuRoad, Wuhan 430079, China"}]},{"given":"Changqing","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Remote Sensing and Information Engineering, Wuhan University, 129 LuoyuRoad, Wuhan 430079, China"}]},{"given":"Wen","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Remote Sensing and Information Engineering, Wuhan University, 129 LuoyuRoad, Wuhan 430079, China"}]},{"given":"Tao","family":"Jia","sequence":"additional","affiliation":[{"name":"School of Remote Sensing and Information Engineering, Wuhan University, 129 LuoyuRoad, Wuhan 430079, China"}]}],"member":"1968","published-online":{"date-parts":[[2015,11,6]]},"reference":[{"key":"ref_1","unstructured":"Rong, X.F. (2013). The Desigh of Out-size Cargo Transportation Path Selection Support System about J Company. [Master\u2019s Thesis, Chang\u2019an University]. (In Chinese)."},{"key":"ref_2","unstructured":"Zhang, Y.K. (2013). A Research on Optimization of Large-Cargo Transportation Programs Based on the Cross-Entropy. [Master\u2019s Thesis, Chang\u2019an University]. (In Chinese)."},{"key":"ref_3","unstructured":"Li, H. (2011). Study on Selection and Optimization of Bulky Cargo Logistics Based on Genetic Algorithms. [Master\u2019s Thesis, Ocean University of China]. (In Chinese)."},{"key":"ref_4","unstructured":"Yang, P. (2013). Study On Large-scale Equipments Transportation Route Selection of Highway. [Master\u2019s Thesis, Xihua University]. (In Chinese)."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Geisberger, R., and Vetter, C. (2011, January 5\u20137). Efficient routing in road networks with turn costs. Proceedings of the 10th International Symposium of Experimental Algorithms, Crete, Greece.","DOI":"10.1007\/978-3-642-20662-7_9"},{"key":"ref_6","first-page":"98","article-title":"On analysis method for the shortest path of urban roads based on ArcGIS engine","volume":"12","author":"Xiao","year":"2008","journal-title":"Metal Mine"},{"key":"ref_7","unstructured":"Shi, Y. (2013). Optimization Research on Transport Solutions of Project Logistics. [Master\u2019s Thesis, Dalian Maritime University]. (In Chinese)."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/366105.366184","article-title":"On finding minimum routes in a network with turn penalties","volume":"4","author":"Caldwell","year":"1961","journal-title":"Commun. ACM"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1111\/j.1475-3995.1998.tb00138.x","article-title":"Using expert system rules to establish data for intersections and turns in road networks","volume":"5","author":"Nielsen","year":"1998","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_10","first-page":"169","article-title":"Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks","volume":"157","author":"Medaglia","year":"2008","journal-title":"Ann. Oper. Res."},{"key":"ref_11","first-page":"1","article-title":"Representation of transportation network and continuous nearest neighbor search","volume":"2","author":"Feng","year":"2003","journal-title":"DBSJ Lett."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0191-2615(95)00024-0","article-title":"Dual graph representation of transport networks","volume":"30","author":"Anez","year":"1996","journal-title":"Transp. Res. Part B"},{"key":"ref_13","first-page":"366","article-title":"An arc based dijkstra algorithm for road turning penalty in vehicle navigation system","volume":"31","author":"Gang","year":"2002","journal-title":"Acta Geod. Cartogr. Sin."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2013.11.001","article-title":"A loop-free shortest-path routing algorithm for dynamic networks","volume":"516","author":"Frigioni","year":"2014","journal-title":"Theor. Comput. Sci."},{"key":"ref_15","first-page":"197","article-title":"Design and implementation of shortest path analysis system of the logistics distribution based on ArcGIS Server","volume":"35","author":"Liu","year":"2010","journal-title":"Sci. Surv. Mapp."},{"key":"ref_16","first-page":"35","article-title":"Study on data model for public transport networks based on time chain","volume":"3","author":"Wen","year":"2005","journal-title":"Geogr. Geoinform. Sci."},{"key":"ref_17","first-page":"515","article-title":"Shortest path analysis and its application in network systems","volume":"3","author":"Wang","year":"2006","journal-title":"Acta ArmamenT."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1016\/j.orl.2012.06.001","article-title":"Route planning with turn restrictions: A computational experiment","volume":"40","author":"Vanhove","year":"2012","journal-title":"Oper. Res. Lett."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1023\/A:1020853410145","article-title":"Modeling costs of turns in route planning","volume":"6","author":"Winter","year":"2002","journal-title":"GeoInformatica"},{"key":"ref_20","first-page":"127","article-title":"T-GIS data model for urban complex road network","volume":"1","author":"Sun","year":"2012","journal-title":"J. Tongji Univ."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1111\/j.1477-9730.2005.00343_3.x","article-title":"Geographic information systems for transportation\u2014Principles and applications","volume":"20","author":"Prasad","year":"2005","journal-title":"Photogramm. Rec."},{"key":"ref_22","first-page":"68","article-title":"The key algorithm research in GIS shortest path analysis","volume":"4","author":"Huang","year":"2007","journal-title":"Urban Geotech. Investi. Surv."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1080\/13658816.2010.510799","article-title":"Computing the fewest-turn map directions based on the connectivity of natural roads","volume":"25","author":"Jiang","year":"2011","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"ref_24","unstructured":"Lei, M. (2007). The Analysis and Research on Shortest Path of Regional Road Network Based on Expenses. [Master\u2019s Thesis, Changsha University of Science & Technology]. (In Chinese)."},{"key":"ref_25","unstructured":"Luo, R.F. (2010). Research on the Organization and Management of Left-turn Traffic at the urban Road Signalized Intersections. [Master\u2019s Thesis, Chang\u2019an University]. (In Chinese)."},{"key":"ref_26","first-page":"31","article-title":"Design and Implementation of the Shortest Path Analysis Algorithm Based on Skyline","volume":"4","author":"Xu","year":"2008","journal-title":"Urban Geotech. Investig. Surv."}],"container-title":["ISPRS International Journal of Geo-Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2220-9964\/4\/4\/2428\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T20:51:38Z","timestamp":1760215898000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2220-9964\/4\/4\/2428"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,6]]},"references-count":26,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2015,12]]}},"alternative-id":["ijgi4042428"],"URL":"https:\/\/doi.org\/10.3390\/ijgi4042428","relation":{},"ISSN":["2220-9964"],"issn-type":[{"value":"2220-9964","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,6]]}}}