{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T02:27:33Z","timestamp":1760236053065,"version":"build-2065373602"},"reference-count":30,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2021,10,27]],"date-time":"2021-10-27T00:00:00Z","timestamp":1635292800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>Navigation in a traffic congested city can prove to be a difficult task. Often a path that may appear to be the fastest option is much slower due to congestion. If we can predict the effects of congestion, it may be possible to develop a better route that allows us to reach our destination more quickly. This paper studies the possibility of using a centralized real-time traffic information system containing travel time data collected from each road user. These data are made available to all users, such that they may be able to learn and predict the effects of congestion for building a route adaptively. This method is further enhanced by combining the traffic information system data with previous routing experiences to determine the fastest route with less exploration. We test our method using a multi-agent simulation, demonstrating that this method produces a lower total route time for all vehicles than when using either a centralized traffic information system or direct experience alone.<\/jats:p>","DOI":"10.3390\/info12110447","type":"journal-article","created":{"date-parts":[[2021,10,27]],"date-time":"2021-10-27T22:00:23Z","timestamp":1635372023000},"page":"447","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Data-Driven Multi-Agent Vehicle Routing in a Congested City"],"prefix":"10.3390","volume":"12","author":[{"given":"Alex","family":"Solter","sequence":"first","affiliation":[{"name":"School of Computing and Information Systems, Athabasca University, Athabasca, AB T9S 3A3, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8494-5762","authenticated-orcid":false,"given":"Fuhua","family":"Lin","sequence":"additional","affiliation":[{"name":"School of Computing and Information Systems, Athabasca University, Athabasca, AB T9S 3A3, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9132-8153","authenticated-orcid":false,"given":"Dunwei","family":"Wen","sequence":"additional","affiliation":[{"name":"School of Computing and Information Systems, Athabasca University, Athabasca, AB T9S 3A3, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaokang","family":"Zhou","sequence":"additional","affiliation":[{"name":"Faculty of Data Science, Shiga University, Kyoto 520-0002, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,10,27]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1145\/2637364.2592014","article-title":"Traffic congestion: Models, costs and optimal transport","volume":"42","author":"Mandayam","year":"2014","journal-title":"ACM Sigmetrics Perform. Eval. Rev."},{"key":"ref_2","unstructured":"Bazzan, A.L., and Chira, C. (2015, January 4\u20138). A Hybrid Evolutionary and Multiagent Reinforcement Learning Approach to Accelerate the Computation of Traffic Assignment. Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, Singapore."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1243","DOI":"10.1126\/science.162.3859.1243","article-title":"The tragedy of the commons","volume":"162","author":"Hardin","year":"1968","journal-title":"Science"},{"key":"ref_4","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_5","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_6","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1109\/TSMC.1985.6313407","article-title":"A new approach to the design of reinforcement schemes for learning automata","volume":"1","author":"Thathachar","year":"1985","journal-title":"IEEE Trans. Syst. Man, Cybern."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1023\/A:1013689704352","article-title":"Finite-time analysis of the multiarmed bandit problem","volume":"47","author":"Auer","year":"2002","journal-title":"Mach. Learn."},{"key":"ref_8","unstructured":"Sutton, R.S., and Barto, A.G. (2018). Multi-armed Bandits. Reinforcement Learning: An Introduction, The MIT Press. [2nd ed.]. Chapter 2."},{"key":"ref_9","unstructured":"Google (2021, August 10). Google Traffic. Available online: https:\/\/www.google.ca\/maps\/."},{"key":"ref_10","unstructured":"Waze Mobile (2021, August 10). Waze. Available online: https:\/\/www.waze.com\/."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1137\/S0097539701397059","article-title":"Stackelberg scheduling strategies","volume":"33","author":"Roughgarden","year":"2004","journal-title":"SIAM J. Comput."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Desjardins, C., Laum\u00f4nier, J., and Chaib-draa, B. (2009). Learning agents for collaborative driving. Multi-Agent Systems for Traffic and Transportation Engineering, IGI Global.","DOI":"10.4018\/978-1-60566-226-8.ch011"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1007\/s10458-008-9062-9","article-title":"Opportunities for multiagent systems and multiagent reinforcement learning in traffic control","volume":"18","author":"Bazzan","year":"2009","journal-title":"Auton. Agents Multi-Agent Syst."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"2888","DOI":"10.1109\/TITS.2016.2531425","article-title":"Next road rerouting: A multiagent system for mitigating unexpected urban traffic congestion","volume":"17","author":"Wang","year":"2016","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1007\/s11277-016-3501-8","article-title":"Using intelligent vehicle infrastructure integration for reducing congestion in smart city","volume":"91","author":"Horng","year":"2016","journal-title":"Wirel. Pers. Commun."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"de Oliveira, D., and Bazzan, A.L. (2009). Multiagent learning on traffic lights control: Effects of using shared information. Multi-Agent Systems for Traffic and Transportation Engineering, IGI Global.","DOI":"10.4018\/978-1-60566-226-8.ch015"},{"key":"ref_17","first-page":"325","article-title":"Some theoretical aspects of road traffic research","volume":"1","author":"Wardrop","year":"1982","journal-title":"Proc. Inst. Civ. Eng."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.retrec.2017.09.010","article-title":"Emergence of cooperation and a fair system optimum in road networks: A game-theoretic and agent-based modelling approach","volume":"68","author":"Levy","year":"2018","journal-title":"Res. Transp. Econ."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/s10458-012-9211-z","article-title":"Coordinating actions in congestion games: Impact of top\u2013down and bottom\u2013up utilities","volume":"27","author":"Tumer","year":"2013","journal-title":"Auton. Agents Multi-Agent Syst."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Shoham, Y., and Leyton-Brown, K. (2009). Congestion Games. Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations, Cambridge University Press. Section 6.4.","DOI":"10.1017\/CBO9780511811654"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Shoham, Y., and Leyton-Brown, K. (2009). Teams of Selfish Agents: An Introduction to Coalitional Game Theory. Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations, Cambridge University Press. Chapter 12.","DOI":"10.1017\/CBO9780511811654"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Yamashita, T., Izumi, K., Kurumatani, K., and Nakashima, H. (2005, January 25\u201329). Smooth traffic flow with a cooperative car navigation system. Proceedings of the Fourth International Joint Conference on Autonomous Agents and Multiagent Systems, Utrecht, The Netherlands.","DOI":"10.1145\/1082473.1082546"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1016\/j.procs.2016.04.187","article-title":"Emergence of system optimum: A fair and altruistic agent-based route-choice model","volume":"83","author":"Levy","year":"2016","journal-title":"Procedia Comput. Sci."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"117","DOI":"10.3390\/g1020117","article-title":"A choice prediction competition for market entry games: An introduction","volume":"1","author":"Erev","year":"2010","journal-title":"Games"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Lattimore, T., and Szepesv\u00e1ri, C. (2020). Bandit Algorithms, Cambridge University Press.","DOI":"10.1017\/9781108571401"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1177\/0361198119850457","article-title":"Multi-armed bandit on-time arrival algorithms for sequential reliable route selection under uncertainty","volume":"2673","author":"Zhou","year":"2019","journal-title":"Transp. Res. Rec."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1177\/0361198120917388","article-title":"Contextual bandit-based sequential transit route design under demand uncertainty","volume":"2674","author":"Yoon","year":"2020","journal-title":"Transp. Res. Rec."},{"key":"ref_28","unstructured":"Sutton, R.S., and Barto, A.G. (2018). Upper-Confidence-Bound Action Selection. Reinforcement Learning: An Introduction, The MIT Press. [2nd ed.]. Section 2.7."},{"key":"ref_29","unstructured":"DLR \u2013 Institute of Transportation Systems (2021, August 10). SUMO. Available online: http:\/\/www.dlr.de\/ts\/en\/desktopdefault.aspx\/tabid-9883\/16931read-41000\/."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Shoham, Y., and Leyton-Brown, K. (2009). Selfish routing and the price of anarchy. Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations, Cambridge University Press. Section 6.4.5.","DOI":"10.1017\/CBO9780511811654"}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/12\/11\/447\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T07:21:13Z","timestamp":1760167273000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/12\/11\/447"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,27]]},"references-count":30,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2021,11]]}},"alternative-id":["info12110447"],"URL":"https:\/\/doi.org\/10.3390\/info12110447","relation":{},"ISSN":["2078-2489"],"issn-type":[{"type":"electronic","value":"2078-2489"}],"subject":[],"published":{"date-parts":[[2021,10,27]]}}}