{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T00:13:42Z","timestamp":1704932022718},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Commun."],"published-print":{"date-parts":[[2022,2,1]]},"DOI":"10.1587\/transcom.2021cet0001","type":"journal-article","created":{"date-parts":[[2021,8,4]],"date-time":"2021-08-04T22:07:53Z","timestamp":1628114873000},"page":"140-150","source":"Crossref","is-referenced-by-count":0,"title":["Multi-Agent Distributed Route Selection under Consideration of Time Dependency among Agents' Road Usage for Vehicular Networks"],"prefix":"10.23919","volume":"E105.B","author":[{"given":"Takanori","family":"HARA","sequence":"first","affiliation":[{"name":"Division of Information Science, Nara Institute of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masahiro","family":"SASABE","sequence":"additional","affiliation":[{"name":"Division of Information Science, Nara Institute of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shoji","family":"KASAHARA","sequence":"additional","affiliation":[{"name":"Division of Information Science, Nara Institute of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"1","unstructured":"[1] T. Hara, M. Sasabe, and S. Kasahara, \u201cDistributed route selection under consideration of time dependency among agents' road usage for vehicular networks,\u201d Proc. ICETC, pp.1-4, Dec. 2020."},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] J.G. Wardrop, \u201cSome theoretical aspects of road traffic research,\u201d Proc. Institution of Civil Engineers, vol.1, no.3, pp.325-362, May 1952. 10.1680\/ipeds.1952.11259","DOI":"10.1680\/ipeds.1952.11259"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] T. Roughgarden and \u00c9. Tardos, \u201cHow bad is selfish routing?,\u201d J. ACM, vol.49, no.2, pp.236-259, March 2002. 10.1145\/506147.506153","DOI":"10.1145\/506147.506153"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] R.W. Rosenthal, \u201cA class of games possessing pure-strategy nash equilibria,\u201d Int. J. Game Theory, vol.2, no.1, pp.65-67, Dec. 1973. 10.1007\/bf01737559","DOI":"10.1007\/BF01737559"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] L.R. Ford and D.R. Fulkerson, \u201cConstructing maximal dynamic flows from static flows,\u201d Oper. Res., vol.6, no.3, pp.419-433, June 1958. 10.1287\/opre.6.3.419","DOI":"10.1287\/opre.6.3.419"},{"key":"6","unstructured":"[6] L.R. Ford, Jr. and D.R. Fulkerson, Flows in Networks, Princeton University Press, 2015."},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] R. Koch and M. Skutella, \u201cNash equilibria and the price of anarchy for flows over time,\u201d Theor. Comput. Syst., vol.49, no.1, pp.71-97, July 2011. 10.1007\/s00224-010-9299-y","DOI":"10.1007\/s00224-010-9299-y"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] E. Anshelevich and S. Ukkusuri, \u201cEquilibria in dynamic selfish routing,\u201d Proc. Algorithmic Game Theory, Berlin, Heidelberg, pp.171-182, Springer, 2009. 10.1007\/978-3-642-04645-2_16","DOI":"10.1007\/978-3-642-04645-2_16"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] M. Hoefer, V.S. Mirrokni, H. R\u00f6glin, and S.H. Teng, \u201cCompetitive routing over time,\u201d Theor. Comput. Sci., vol.412, no.39, pp.5420-5432, Sept. 2011. 10.1016\/j.tcs.2011.05.055","DOI":"10.1016\/j.tcs.2011.05.055"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] M. Macko, K. Larson, and \u013d. Steskal, \u201cBraess's paradox for flows over time,\u201d Theor. Comput. Syst., vol.53, no.1, pp.86-106, July 2013. 10.1007\/s00224-013-9462-3","DOI":"10.1007\/s00224-013-9462-3"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] U. Bhaskar, L. Fleischer, and E. Anshelevich, \u201cA Stackelberg strategy for routing flow over time,\u201d Game. Econ. Behav., vol.92, pp.232-247, July 2015. 10.1016\/j.geb.2013.09.004","DOI":"10.1016\/j.geb.2013.09.004"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] S. Lim and D. Rus, \u201cCongestion-aware multi-agent path planning: Distributed algorithm and applications,\u201d The Computer Journal, vol.57, no.6, pp.825-839, June 2014. 10.1093\/comjnl\/bxt067","DOI":"10.1093\/comjnl\/bxt067"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] H. Bar-Gera and A. Luzon, \u201cDifferences among route flow solutions for the user-equilibrium traffic assignment problem,\u201d J. Transp. Eng., vol.133, no.4, pp.232-239, April 2007. 10.1061\/(asce)0733-947x(2007)133:4(232)","DOI":"10.1061\/(ASCE)0733-947X(2007)133:4(232)"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] Y. Sheffi and W. Powell, \u201cA comparison of stochastic and deterministic traffic assignment over congested networks,\u201d Transportation Research Part B: Methodological, vol.15, no.1, pp.53-64, Feb. 1981. 10.1016\/0191-2615(81)90046-1","DOI":"10.1016\/0191-2615(81)90046-1"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] A.S. Schulz and N.E. Stier-Moses, \u201cEfficiency and fairness of system-optimal routing with user constraints,\u201d Networks, vol.48, no.4, pp.223-234, Dec. 2006. 10.1002\/net.20133","DOI":"10.1002\/net.20133"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] L. Fleischer and M. Skutella, \u201cQuickest flows over time,\u201d SIAM J. Comput., vol.36, no.6, pp.1600-1630, Jan. 2007. 10.1137\/s0097539703427215","DOI":"10.1137\/S0097539703427215"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] E. K\u00f6hler, K. Langkau, and M. Skutella, \u201cTime-expanded graphs for flow-dependent transit times,\u201d Proc. Algorithms \u2014 ESA, R. M\u00f6hring and R. Raman, eds., pp.599-611, Springer Berlin Heidelberg, 2002. 10.1007\/3-540-45749-6_53","DOI":"10.1007\/3-540-45749-6_53"},{"key":"18","doi-asserted-by":"publisher","unstructured":"[18] X. Kong, Z. Xu, G. Shen, J. Wang, Q. Yang, and B. Zhang, \u201cUrban traffic congestion estimation and prediction based on floating car trajectory data,\u201d Future Generation Computer Systems, vol.61, pp.97-107, Aug. 2016. 10.1016\/j.future.2015.11.013","DOI":"10.1016\/j.future.2015.11.013"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] M. Fouladgar, M. Parchami, R. Elmasri, and A. Ghaderi, \u201cScalable deep traffic flow neural networks for urban traffic congestion prediction,\u201d Proc. IJCNN, pp.2251-2258, May 2017. 10.1109\/ijcnn.2017.7966128","DOI":"10.1109\/IJCNN.2017.7966128"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] B. Afshar-Nadjafi and A. Afshar-Nadjafi, \u201cA constructive heuristic for time-dependent multi-depot vehicle routing problem with time-windows and heterogeneous fleet,\u201d J. King Saud University-Engineering Sciences, vol.29, no.1, pp.29-34, Jan. 2017. 10.1016\/j.jksues.2014.04.007","DOI":"10.1016\/j.jksues.2014.04.007"},{"key":"21","doi-asserted-by":"publisher","unstructured":"[21] F. Rossi, R. Zhang, Y. Hindy, and M. Pavone, \u201cRouting autonomous vehicles in congested transportation networks: Structural properties and coordination algorithms,\u201d Auton. Robot., vol.42, no.7, pp.1427-1442, Oct. 2018. 10.1007\/s10514-018-9750-5","DOI":"10.1007\/s10514-018-9750-5"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] N. Nisan, T. Roughgarden, E. Tardos, and V.V. Vazirani, Algorithmic Game Theory, Cambridge University Press, New York, NY, USA, 2007. 10.1017\/cbo9780511800481.002","DOI":"10.1017\/CBO9780511800481"},{"key":"23","doi-asserted-by":"publisher","unstructured":"[23] S. Devarajan, \u201cA note of network equilibrium and noncooperative games,\u201d Transportation Research Part B: Methodological, vol.15, no.6, pp.421-426, Dec. 1981. 10.1016\/0191-2615(81)90026-6","DOI":"10.1016\/0191-2615(81)90026-6"},{"key":"24","unstructured":"[24] A. Orda, R. Rom, and N. Shimkin, \u201cCompetitive routing in multi-user communication networks,\u201d Proc. INFOCOM, pp.964-971 vol.3, March 1993. 10.1109\/infcom.1993.253270"},{"key":"25","unstructured":"[25] Roads, Bureau of Public, \u201cTraffic assignment manual,\u201d US Department of Commerce, Washington, DC, 1964."},{"key":"26","doi-asserted-by":"publisher","unstructured":"[26] W. Yao, J. Zhao, F. Wen, Z. Dong, Y. Xue, Y. Xu, and K. Meng, \u201cA multi-objective collaborative planning strategy for integrated power distribution and electric vehicle charging systems,\u201d IEEE Trans. Power Syst., vol.29, no.4, pp.1811-1821, July 2014. 10.1109\/tpwrs.2013.2296615","DOI":"10.1109\/TPWRS.2013.2296615"},{"key":"27","doi-asserted-by":"publisher","unstructured":"[27] S. Wang, Z.Y. Dong, F. Luo, K. Meng, and Y. Zhang, \u201cStochastic collaborative planning of electric vehicle charging stations and power distribution system,\u201d IEEE Trans. Ind. Inf., vol.14, no.1, pp.321-331, Jan. 2018. 10.1109\/tii.2017.2662711","DOI":"10.1109\/TII.2017.2662711"},{"key":"28","unstructured":"[28] Japan Digital Road Map Association, \u201cDRM-JAPAN DIGITAL ROAD MAP ASSOCIATION,\u201d http:\/\/www.drm.jp\/english\/drm\/e_index.htm, Accessed 15 Feb. 2021."},{"key":"29","doi-asserted-by":"publisher","unstructured":"[29] Y. Sekimoto, R. Shibasaki, H. Kanasugi, T. Usui, and Y. Shimazaki, \u201cPFlow: Reconstructing people flow recycling large-scale social survey data,\u201d IEEE Pervasive Comput., vol.10, no.4, pp.27-35, April 2011. 10.1109\/mprv.2011.43","DOI":"10.1109\/MPRV.2011.43"},{"key":"30","doi-asserted-by":"publisher","unstructured":"[30] T. Hara, M. Sasabe, and S. Kasahara, \u201cSelfish yet optimal routing by adjusting perceived traffic information of road networks,\u201d IEEE Open J. Intell. Transp. Syst., vol.1, pp.120-133, 2020. 10.1109\/ojits.2020.3019935","DOI":"10.1109\/OJITS.2020.3019935"}],"container-title":["IEICE Transactions on Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E105.B\/2\/E105.B_2021CET0001\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T14:59:10Z","timestamp":1704898750000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E105.B\/2\/E105.B_2021CET0001\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,1]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022]]}},"URL":"https:\/\/doi.org\/10.1587\/transcom.2021cet0001","relation":{},"ISSN":["0916-8516","1745-1345"],"issn-type":[{"value":"0916-8516","type":"print"},{"value":"1745-1345","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,1]]},"article-number":"2021CET0001"}}