{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,12]],"date-time":"2026-08-12T03:30:49Z","timestamp":1786505449293,"version":"3.56.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032061638","type":"print"},{"value":"9783032061645","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T00:00:00Z","timestamp":1759017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T00:00:00Z","timestamp":1759017600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-06164-5_1","type":"book-chapter","created":{"date-parts":[[2025,9,27]],"date-time":"2025-09-27T05:15:35Z","timestamp":1758950135000},"page":"3-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Estimating Accurate Traffic Time by Smart Simulative Route Predictions"],"prefix":"10.1007","author":[{"given":"Nadav","family":"Voloch","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Neev","family":"Penkar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guy","family":"Tordjman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,9,28]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","unstructured":"Voloch, N., Voloch-Bloch, N.: Finding the fastest navigation rout by real-time future traffic estimations. In: 2021 IEEE International Conference on Microwaves, Antennas, Communications and Electronic Systems (COMCAS), pp. 13\u201316. IEEE (2021). https:\/\/doi.org\/10.1109\/COMCAS52219.2021.9629051","DOI":"10.1109\/COMCAS52219.2021.9629051"},{"key":"1_CR2","doi-asserted-by":"publisher","unstructured":"Abraham, I.; Fiat, A., Goldberg, A.V., Werneck, R.F.: Highway dimension, shortest paths, and provably efficient algorithms. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 782\u2013793 (2010). https:\/\/doi.org\/10.1145\/2985473","DOI":"10.1145\/2985473"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959). https:\/\/doi.org\/10.1007\/BF01386390","journal-title":"Numer. Math."},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Mehlhorn, K., Sanders, P.: Algorithms and Data Structures: The Basic Toolbox, pp. 199\u2013200. Springer (2008). https:\/\/doi.org\/10.1007\/978-3-540-77978-0","DOI":"10.1007\/978-3-540-77978-0"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"LR Ford","year":"1956","unstructured":"Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Can. J. Math. 8, 399\u2013404 (1956). https:\/\/doi.org\/10.4153\/CJM-1956-045-5","journal-title":"Can. J. Math."},{"issue":"2","key":"1_CR6","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM. Assoc. Comput. Mach. 19(2), 248\u2013264 (1972). https:\/\/doi.org\/10.1145\/321694.321699","journal-title":"J. ACM. Assoc. Comput. Mach."},{"key":"1_CR7","unstructured":"Dinic, Y.: Algorithm for solution of a problem of maximum flow in a network with power estimation. Doklady Akademii nauk SSSR 11, 1277\u20131280 (1970). https:\/\/zbmath.org\/?q=an:0219.90046"},{"key":"1_CR8","unstructured":"Voloch, N:. Optimal paths of knapsack-set vertices on a weight-independent graph. WSEAS Trans. Comput. 16, 163\u2013171 (2017). https:\/\/www.wseas.org\/multimedia\/journals\/computers\/2017\/a365905-071.pdf"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Claussen, H.: Vehicle navigation systems. In: Modern Cartography Series, vol. 1, pp. 225\u2013235. Academic Press (1991). https:\/\/doi.org\/10.1007\/978-3-642-12733-5","DOI":"10.1007\/978-3-642-12733-5"},{"key":"1_CR10","doi-asserted-by":"publisher","unstructured":"Dance, F.J., Thoone, M.L.: Vehicle Navigation Systems: Is America Ready? (No. 970169). SAE Technical Paper (1997). https:\/\/doi.org\/10.4271\/861360","DOI":"10.4271\/861360"},{"key":"1_CR11","unstructured":"Burnett, G.E.: Usable vehicle navigation systems: Are we there yet. Vehicle electronic systems, 3\u20131 (2000). https:\/\/trid.trb.org\/View\/709813"},{"issue":"4","key":"1_CR12","doi-asserted-by":"publisher","first-page":"3545","DOI":"10.1109\/TSG.2020.2965568","volume":"11","author":"X Shi","year":"2020","unstructured":"Shi, X., Xu, Y., Guo, Q., Sun, H., Gu, W.: A distributed EV navigation strategy considering the interaction between power system and traffic network. IEEE Trans. Smart Grid 11(4), 3545\u20133557 (2020). https:\/\/doi.org\/10.1109\/TSG.2020.2965568","journal-title":"IEEE Trans. Smart Grid"},{"key":"1_CR13","doi-asserted-by":"publisher","unstructured":"Liu, Q., et al.: Traffic navigation using positioning information and channel quality map for system-wide load balancing. In: 2015 Asia-Pacific Microwave Conference (APMC), vol. 1, pp. 1\u20133. IEEE (2015). https:\/\/doi.org\/10.1109\/APMC.2015.7411600","DOI":"10.1109\/APMC.2015.7411600"},{"issue":"1","key":"1_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-019-0224-2","volume":"4","author":"N Voloch","year":"2019","unstructured":"Voloch, N., Voloch-Bloch, N., Zadok, Y.: Managing large distributed dynamic graphs for smart city network applications. Appl. Netw. Sci. 4(1), 1\u201313 (2019). https:\/\/doi.org\/10.1007\/s41109-019-0224-2","journal-title":"Appl. Netw. Sci."},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Barzilai, O., Voloch, N., Hasgall, A., Steiner, O. L., Ahituv, N.: Traffic control in a smart intersection by an algorithm with social priorities. Contemporary Eng. Sci. 11(31), 1499\u20131511 (2018). https:\/\/doi.org\/10.12988\/ces.2018.83126","DOI":"10.12988\/ces.2018.83126"},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Barzilai, O., Voloch, N., Hasgall, A., Steiner, O. L.: Real life applicative timing algorithm for a smart junction with social priorities and multiple parameters. In: 2018 IEEE International Conference on the Science of Electrical Engineering in Israel (ICSEE), pp. 1\u20135. IEEE (2018). https:\/\/doi.org\/10.1109\/ICSEE.2018.8646018","DOI":"10.1109\/ICSEE.2018.8646018"},{"key":"1_CR17","doi-asserted-by":"publisher","unstructured":"Fine, Z., Brayer, E., Proshtisky, I., Barzilai, O., Voloch, N., Steiner, O.L.: Handling traffic loads in a smart junction by social priorities. In: 2019 IEEE International Conference on Microwaves, Antennas, Communications and Electronic Systems (COMCAS), pp. 1\u20135. IEEE (2019). https:\/\/doi.org\/10.1109\/COMCAS44984.2019.8958182","DOI":"10.1109\/COMCAS44984.2019.8958182"},{"issue":"2","key":"1_CR18","doi-asserted-by":"publisher","first-page":"110","DOI":"10.2478\/ttj-2020-0008","volume":"21","author":"O Barzilai","year":"2020","unstructured":"Barzilai, O., Giloni, A., Voloch, N., Steiner, O.L.: Auction based algorithm for a smart junction with social priorities. Transport Telecommun. 21(2), 110\u2013118 (2020). https:\/\/doi.org\/10.2478\/ttj-2020-0008","journal-title":"Transport Telecommun."},{"key":"1_CR19","unstructured":"Seo, T.: UXsim: An open source macroscopic and mesoscopic traffic simulator in Python -- a technical overview, eprint 2309.17114 (2023). https:\/\/arxiv.org\/abs\/2309.17114"},{"key":"1_CR20","unstructured":"Seo, T.: UXsim Github Repository (2023). https:\/\/github.com\/toruseo\/UXsim"},{"key":"1_CR21","volume-title":"Macroscopic Traffic Flow Simulation: Fundamental Mathematical Theory and Python Implementation","author":"T Seo","year":"2023","unstructured":"Seo, T.: Macroscopic Traffic Flow Simulation: Fundamental Mathematical Theory and Python Implementation. Corona Publishing Co., Ltd (2023). (in Japanese)"},{"key":"1_CR22","doi-asserted-by":"publisher","unstructured":"Lighthill, M.J., Whitham, G.B.: On kinematic waves. II. A theory of traffic flow on long crowded roads. Proc. Royal Soc. London. Ser. A. Math. Phys. Sci. 229 (1178), 317\u2013345 (1955). https:\/\/doi.org\/10.1098\/rspa.1955.0089","DOI":"10.1098\/rspa.1955.0089"},{"issue":"1","key":"1_CR23","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1287\/opre.4.1.42","volume":"4","author":"PI Richards","year":"1956","unstructured":"Richards, P.I.: Shock waves on the highway. Oper. Res. 4(1), 42\u201351 (1956). https:\/\/doi.org\/10.1287\/opre.4.1.42","journal-title":"Oper. Res."},{"issue":"3","key":"1_CR24","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0191-2615(00)00044-8","volume":"36","author":"GF Newell","year":"2002","unstructured":"Newell, G.F.: A simplified car-following theory: a lower order model. Transport. Res. Part B: Methodol. 36(3), 195\u2013205 (2002). https:\/\/doi.org\/10.1016\/S0191-2615(00)00044-8","journal-title":"Transport. Res. Part B: Methodol."},{"key":"1_CR25","unstructured":"Aman, H. Traffic Prediction Dataset. https:\/\/www.kaggle.com\/datasets\/hasibullahaman\/traffic-prediction-dataset\/data"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Aric, A.H., Daniel, A.S., Pieter, J.S.: Exploring network structure, dynamics, and function using NetworkX. In: Varoquaux, G., Vaught, T., Millman, J. (eds.) Proceedings of the 7th Python in Science Conference (SciPy2008), (Pasadena, CA USA), pp. 11\u201315 (2008). http:\/\/conference.scipy.org\/proceedings\/SciPy2008\/paper_2","DOI":"10.25080\/TCWV9851"},{"issue":"5","key":"1_CR27","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0041-1647(75)90030-0","volume":"9","author":"LJ LeBlanc","year":"1975","unstructured":"LeBlanc, L.J., et al.: An efficient approach to solving the road network equilibrium traffic assignment problem. Transport. Res. 9(5), 309\u2013318 (1975). https:\/\/doi.org\/10.1016\/0041-1647(75)90030-0","journal-title":"Transport. Res."},{"issue":"3","key":"1_CR28","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1287\/trsc.1050.0142","volume":"40","author":"H Bar-Gera","year":"2006","unstructured":"Bar-Gera, H.: Primal method for determining the most likely route flows in large road networks. Transp. Sci. 40(3), 269\u2013286 (2006). https:\/\/doi.org\/10.1287\/trsc.1050.0142","journal-title":"Transp. Sci."},{"key":"1_CR29","unstructured":"https:\/\/github.com\/LdDl\/ch\/blob\/master\/vanilla_dijkstra.go"},{"key":"1_CR30","unstructured":"https:\/\/github.com\/nadavvoloch\/SmartTransportationSimulation"}],"container-title":["Lecture Notes in Computer Science","Pervasive Digital Services for People\u2019s Well-Being, Inclusion and Sustainable Development"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-06164-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,12]],"date-time":"2026-08-12T03:14:38Z","timestamp":1786504478000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-06164-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,28]]},"ISBN":["9783032061638","9783032061645"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-06164-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,28]]},"assertion":[{"value":"28 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The datasets and software generated and analyzed by this research during the current study are available in [\n                      \n                      ].","order":1,"name":"Ethics","label":"Data Availability Statement","group":{"name":"EthicsHeading","label":"Ethics"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","label":"Disclosure of Interests.","group":{"name":"EthicsHeading","label":"Ethics"}},{"value":"I3E","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on e-Business, e-Services and e-Society","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Limassol","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"i3e2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cyprusconferences.org\/i3e2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}