{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:33:07Z","timestamp":1742999587623,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030914332"},{"type":"electronic","value":"9783030914349"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-91434-9_19","type":"book-chapter","created":{"date-parts":[[2021,12,3]],"date-time":"2021-12-03T07:04:42Z","timestamp":1638515082000},"page":"209-217","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimize Travel Time with Traffic Flow Density Equilibrium on Road Network"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9470-8397","authenticated-orcid":false,"given":"Qinghua","family":"Tang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3012-8497","authenticated-orcid":false,"given":"Demin","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1430-6356","authenticated-orcid":false,"given":"Shuang","family":"Zhou","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7639-3061","authenticated-orcid":false,"given":"Yue","family":"Fu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,4]]},"reference":[{"issue":"12","key":"19_CR1","doi-asserted-by":"publisher","first-page":"3344","DOI":"10.1109\/TITS.2016.2543263","volume":"17","author":"M Zhu","year":"2016","unstructured":"Zhu, M., Liu, X., Tang, F.: Public vehicles for future urban transportation. IEEE Trans. Intell. Transp. Syst. 17(12), 3344\u20133353 (2016). https:\/\/doi.org\/10.1109\/TITS.2016.2543263","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"He, Z., Cao, J., Li, T.: A real-time traffic estimation based vehicular path planning solution using VANETs. In: International Conference on Connected Vehicles and Expo.: Institute of Electrical and Electronics Engineers, pp. 172\u2013178 (2012)","DOI":"10.1109\/ICCVE.2012.39"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Sethuraman, G., Reddy Ragavareddy, S.S., Ongel, A., Lienkamp, M., Raksincharoensak, P.: Impact assessment of autonomous electric vehicles in public transportation system. In: IEEE Intelligent Transportation Systems Conference, ITSC 2019, art. no. 8917256, pp. 213\u2013219 (2019)","DOI":"10.1109\/ITSC.2019.8917256"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-642-16111-7_35","volume-title":"KI 2010: Advances in Artificial Intelligence","author":"A Artmeier","year":"2010","unstructured":"Artmeier, A., Haselmayr, J., Leucker, M., Sachenbacher, M.: The shortest path problem revisited: optimal routing for electric vehicles. In: Dillmann, R., Beyerer, J., Hanebeck, U.D., Schultz, T. (eds.) KI 2010. LNCS (LNAI), vol. 6359, pp. 309\u2013316. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16111-7_35"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Wang, S., Shao, H., Tao, L.: Travel time reliability-based optimal path finding. In: Third International Joint Conference on Computational Science and Optimization, vol. 2, pp. 531\u2013534. IEEE (2010)","DOI":"10.1109\/CSO.2010.138"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.protcy.2016.03.010","volume":"23","author":"AK Guruji","year":"2016","unstructured":"Guruji, A.K., Agarwal, H., Parsediya, D.K.: Time-efficient A* algorithm for robot path planning. Proc. Technol. 23, 144\u2013149 (2016)","journal-title":"Proc. Technol."},{"key":"19_CR7","unstructured":"Souza, A.M.D., Yokoyama, R.S., Maia, G.: Real-time path planning to prevent traffic jam through an intelligent transportation system. In: Computers and Communication, pp. 726\u2013731 (2016)"},{"issue":"5","key":"19_CR8","doi-asserted-by":"publisher","first-page":"1619","DOI":"10.2298\/FIL1805619Z","volume":"32","author":"S Zhang","year":"2018","unstructured":"Zhang, S., Liu, X., Wang, M.: A novel Ant colony optimization algorithm for the shortest-path problem in traffic networks. Filomat 32(5), 1619\u20131628 (2018)","journal-title":"Filomat"},{"issue":"2","key":"19_CR9","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1109\/TETCI.2017.2665592","volume":"1","author":"H Guo","year":"2017","unstructured":"Guo, H., Cao, Z., Seshadri, M., Zhang, J., Niyato, D., Fastenrath, U.: Routing multiple vehicles cooperatively: minimizing road network breakdown probability. IEEE Trans. Emerg. Top. Comput. Intell. 1(2), 112\u2013124 (2017)","journal-title":"IEEE Trans. Emerg. Top. Comput. Intell."},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"18","DOI":"10.3141\/1572-03","volume":"1572","author":"S Alexander","year":"1997","unstructured":"Alexander, S., Dowling, R.: Improved speed-flow relationships for planning applications. Transp. Res. Rec.: J. Transp. Res. Board 1572, 18\u201323 (1997)","journal-title":"Transp. Res. Rec.: J. Transp. Res. Board"},{"key":"19_CR11","unstructured":"Jain, R., Chiu, D., Hawe, W.: A quantitative measure of fairness and discrimination for resource allocation in shared computer systems (1984). http:\/\/www.cse.wustl.edu\/jain\/papers\/fairness.htm. Accessed 30 Apr 2014"},{"issue":"2","key":"19_CR12","first-page":"416","volume":"16","author":"S Huber","year":"2016","unstructured":"Huber, S., Rust, C.: osrmtime: calculate travel time and distance with OpenStreetMap data using the open source routing machine (OSRM). Soc. Sci. Electron. Publ. 16(2), 416\u2013423 (2016)","journal-title":"Soc. Sci. Electron. Publ."}],"container-title":["Lecture Notes in Computer Science","Computational Data and Social Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91434-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:42:38Z","timestamp":1710232958000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91434-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030914332","9783030914349"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91434-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"4 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSoNet","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Data and Social Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csonet2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/csonet-conf.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}