{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T15:30:48Z","timestamp":1778599848235,"version":"3.51.4"},"reference-count":38,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T00:00:00Z","timestamp":1641427200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["42101471"],"award-info":[{"award-number":["42101471"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Program of National Natural Science Foundation of China","award":["41730105"],"award-info":[{"award-number":["41730105"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJGI"],"abstract":"<jats:p>In recent years, the route-planning problem has gained increased interest due to the development of intelligent transportation systems (ITSs) and increasing traffic congestion especially in urban areas. An independent route-planning strategy for each in-vehicle terminal improves its individual travel efficiency. However, individual optimal routes pursue the maximization of individual benefit and may contradict the global benefit, thereby reducing the overall transport efficiency of the road network. To improve traffic efficiency while considering the travel time of individual vehicles, we propose a new dynamic route-planning method by innovatively introducing a bidding mechanism in the connected vehicle scenario for the first time. First, a novel bidding-based dynamic route planning is proposed to formulate vehicle routing schemes for vehicles affected by congestion via the bidding process. Correspondingly, a bidding price incorporating individual and global travel times was designed to balance the travel benefits of both objectives. Then, in the bidding process, a new local search algorithm was designed to select the winning routing scheme set with the minimum bidding price. Finally, the proposed method was tested and validated through case studies of simulated and actual driving scenarios to demonstrate that the bidding mechanism would be conducive to improving the transport efficiency of road networks in large-scale traffic flow scenarios. This study positively contributes to the research and development of traffic management in ITSs.<\/jats:p>","DOI":"10.3390\/ijgi11010039","type":"journal-article","created":{"date-parts":[[2022,1,7]],"date-time":"2022-01-07T01:15:26Z","timestamp":1641518126000},"page":"39","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["An Adaptive Route Planning Method of Connected Vehicles for Improving the Transport Efficiency"],"prefix":"10.3390","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1151-4309","authenticated-orcid":false,"given":"Baoju","family":"Liu","sequence":"first","affiliation":[{"name":"Big Data Institute, Central South University, Changsha 410000, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0163-0007","authenticated-orcid":false,"given":"Jun","family":"Long","sequence":"additional","affiliation":[{"name":"Big Data Institute, Central South University, Changsha 410000, China"}]},{"given":"Min","family":"Deng","sequence":"additional","affiliation":[{"name":"School of Geosciences and Info-Physics, Central South University, Changsha 410000, China"}]},{"given":"Xuexi","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Geosciences and Info-Physics, Central South University, Changsha 410000, China"}]},{"given":"Yan","family":"Shi","sequence":"additional","affiliation":[{"name":"School of Geosciences and Info-Physics, Central South University, Changsha 410000, China"}]}],"member":"1968","published-online":{"date-parts":[[2022,1,6]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/j.tranpol.2008.12.012","article-title":"Regional road development, rural and urban poverty: Evidence from China","volume":"15","author":"Fan","year":"2008","journal-title":"Transp. Policy"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"101616","DOI":"10.1016\/j.compenvurbsys.2021.101616","article-title":"Detecting anomalous spatial interaction patterns by maximizing urban population carrying capacity","volume":"87","author":"Liu","year":"2021","journal-title":"Comput. Environ. Urban Syst."},{"key":"ref_3","first-page":"e00079","article-title":"Exploring the use of advanced traffic information system to manage traffic congestion in developing countries","volume":"4","author":"Ackaah","year":"2019","journal-title":"Sci. Afr."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.sbspro.2014.07.221","article-title":"Variable Speed Limit Design to Relieve Traffic Congestion based on Cooperative Vehicle Infrastructure System","volume":"138","author":"Sun","year":"2014","journal-title":"Procedia Soc. Behav. Sci."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Liu, B., Long, J., Deng, M., Tang, J., and Huang, J. (2021). Revealing spatiotemporal correlation of urban roads via traffic perturbation simulation. Sustain. Cities Soc., 103545.","DOI":"10.1016\/j.scs.2021.103545"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A Formal Basis for the Heuristic Determination of Minimum Cost Paths","volume":"4","author":"Hart","year":"1968","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","article-title":"On a routing problem","volume":"16","author":"Bellman","year":"1958","journal-title":"Q. Appl. Math."},{"key":"ref_9","unstructured":"George, B.D. (1962). Linear Programming and Extensions, Princeton University Press."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/trsc.1110.0401","article-title":"Exact Routing in Large Road Networks Using Contraction Hierarchies","volume":"46","author":"Geisberger","year":"2012","journal-title":"Transp. Sci."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Delling, D., Goldberg, A.V., Razenshteyn, I., and Werneck, R.F. (2011, January 16\u201320). Graph partitioning with natural cuts. Proceedings of the 25th International Parallel and Distributed Processing Symposium (IPDPS 2011), Anchorage, AK, USA.","DOI":"10.1109\/IPDPS.2011.108"},{"key":"ref_12","unstructured":"Delling, D., Goldberg, A.V., and Werneck, R.F. (2011, January 8). Faster batched shortest paths in road networks. Proceedings of the 11th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS 2011), OpenAccess Series in Informatics (OASIcs), Saarbr\u00fccken, Germany."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1815","DOI":"10.1080\/13658816.2018.1487561","article-title":"Improving the throughput of transportation networks with a time-optimization routing strategy","volume":"32","author":"Liu","year":"2018","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"106651","DOI":"10.1016\/j.cie.2020.106651","article-title":"Dynamic relative robust shortest path problem","volume":"148","author":"Xu","year":"2020","journal-title":"Comput. Ind. Eng."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/j.trc.2018.06.004","article-title":"Distributed conflict-free cooperation for multiple connected vehicles at unsignalized intersections","volume":"93","author":"Xu","year":"2018","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"102842","DOI":"10.1016\/j.trc.2020.102842","article-title":"Synchronous and asynchronous parallel computation for large-scale optimal control of connected vehicles","volume":"121","author":"Li","year":"2020","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1016\/j.trf.2018.04.008","article-title":"A simulation-based approach to investigate the driver route choice behavior under the connected vehi-cle environment","volume":"65","author":"Dai","year":"2019","journal-title":"Transp. Res. Part F Traffic Psychol. Behav."},{"key":"ref_18","first-page":"642389","article-title":"Distributed dynamic traffic modeling and implementation oriented different levels of induced travelers, Dis-crete Dyn","volume":"2015","author":"Liu","year":"2015","journal-title":"Nat. Soc."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/j.trc.2015.04.018","article-title":"Application of Lagrangian relaxation approach to \u03b1 -reliable path finding in stochastic networks with correlated link travel times","volume":"56","author":"Zeng","year":"2015","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1016\/j.trc.2014.09.019","article-title":"A travel time reliability model of urban expressways with varying levels of service","volume":"48","author":"Lei","year":"2014","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1016\/j.trpro.2017.05.040","article-title":"Stability analysis on a dynamical model of route choice in a connected vehicle environment","volume":"23","author":"Lee","year":"2017","journal-title":"Transp. Res. Procedia"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/j.trc.2015.06.020","article-title":"Supporting Eco-Driving","volume":"58","author":"Jamson","year":"2015","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"04015020","DOI":"10.1061\/(ASCE)CP.1943-5487.0000490","article-title":"Impact of Connected Vehicle on Work Zone Network Safety through Dynamic Route Guidance","volume":"30","author":"Genders","year":"2016","journal-title":"J. Comput. Civ. Eng."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/506147.506153","article-title":"How bad is selfish routing?","volume":"49","author":"Roughgarden","year":"2002","journal-title":"JACM"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"103258","DOI":"10.1016\/j.trc.2021.103258","article-title":"Learning how to dynamically route autonomous vehicles on shared roads","volume":"130","author":"Lazar","year":"2021","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"128701","DOI":"10.1103\/PhysRevLett.101.128701","article-title":"Price of anarchy in transportation networks: Efficiency and opti-mality control","volume":"101","author":"Youn","year":"2008","journal-title":"Phys. Rev. Lett."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.trpro.2015.07.011","article-title":"Equilibrium Analysis and Route Guidance in Large-scale Networks with MFD Dynamics","volume":"9","author":"Yildirimoglu","year":"2015","journal-title":"Transp. Res. Procedia"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"1449","DOI":"10.1080\/13658816.2021.1905820","article-title":"Detecting spatiotemporal extents of traffic congestion: A density-based moving object clustering approach","volume":"35","author":"Shi","year":"2021","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"ref_29","first-page":"1","article-title":"Understanding congested travel in urban areas","volume":"7","author":"Lima","year":"2016","journal-title":"Nat. Commun."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Liang, L., Yang, Y., Wang, H., Huang, L., and Zhang, X. (2019, January 26\u201328). Traffic Impedance Estimation Driven by Trajectories for Urban Roads. Proceedings of the 3rd International Conference on Vision, Image and Signal Processing, Vancouver, BC, Canada.","DOI":"10.1145\/3387168.3387209"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1287\/trsc.18.2.185","article-title":"An Efficient Method for Computing Traffic Equilibria in Networks with Asymmetric Transportation Costs","volume":"18","author":"Nguyen","year":"1984","journal-title":"Transp. Sci."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1080\/13658816.2011.598133","article-title":"Reliable shortest path finding in stochastic networks with spatial correlated link travel times","volume":"26","author":"Chen","year":"2012","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"591","DOI":"10.2495\/UT150481","article-title":"Ranking of alternatives for emergency routing on urban road networks","volume":"146","author":"Woelki","year":"2015","journal-title":"WIT Trans. Built Environ."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"KuKuijpers, B., Moelans, B., Othman, W., and Vaisman, A. (2016). Uncertainty-based map matching: The space time prism and k-shortest path algo-rithm. ISPRS Int. J. Geo Inf., 5.","DOI":"10.3390\/ijgi5110204"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1002\/atr.1255","article-title":"Toll pricing framework under logit-based stochastic user equilibrium constraints","volume":"48","author":"Liu","year":"2013","journal-title":"J. Adv. Transp."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.trd.2018.05.005","article-title":"A distributed dynamic route guidance approach based on short-term forecasts in cooperative infrastruc-ture-vehicle systems","volume":"66","author":"Wang","year":"2019","journal-title":"Transp. Res. Part D Transp. Environ."},{"key":"ref_37","first-page":"364","article-title":"Dynamizing Dijkstra: A solution to dynamic shortest path problem through retroactive priority queue","volume":"33","author":"Sunita","year":"2021","journal-title":"J. King Saud Univ. Comput. Inf. Sci."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"517","DOI":"10.5198\/jtlu.2020.1598","article-title":"Realtime urban regional route planning model for connected vehicles based on V2X communication","volume":"13","author":"Wang","year":"2020","journal-title":"J. Transp. Land Use"}],"container-title":["ISPRS International Journal of Geo-Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2220-9964\/11\/1\/39\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T14:12:57Z","timestamp":1760364777000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2220-9964\/11\/1\/39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,6]]},"references-count":38,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,1]]}},"alternative-id":["ijgi11010039"],"URL":"https:\/\/doi.org\/10.3390\/ijgi11010039","relation":{},"ISSN":["2220-9964"],"issn-type":[{"value":"2220-9964","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,6]]}}}