{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T03:48:28Z","timestamp":1775274508621,"version":"3.50.1"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030046477","type":"print"},{"value":"9783030046484","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04648-4_8","type":"book-chapter","created":{"date-parts":[[2018,11,17]],"date-time":"2018-11-17T00:53:52Z","timestamp":1542416032000},"page":"92-102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Path Planning Approach with Maximum Traffic Flow and Minimum Breakdown Probability in Complex Road Network"],"prefix":"10.1007","author":[{"given":"Mengran","family":"Xu","sequence":"first","affiliation":[]},{"given":"Demin","family":"Li","sequence":"additional","affiliation":[]},{"given":"Guanglin","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Mengqi","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Shuya","family":"Liao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,18]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Bosch, A.V.D., Arem, B.V., Mahmod, M., Misener, J.: Reducing time delays on congested road networks using social navigation. In: Integrated and Sustainable Transportation System, pp. 26\u201331 (2011)","DOI":"10.1109\/FISTS.2011.5973596"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Guo, C., Li, D., Zhang, G., Zhai, M.: Real-time path planning in urban area via vanet-assisted traffic information sharing. IEEE Trans. Veh. Technol. PP(99), 1\u20131 (2018)","DOI":"10.1109\/TVT.2018.2806979"},{"issue":"2","key":"8_CR3","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."},{"issue":"Number 2","key":"8_CR4","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1177\/1536867X1601600209","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). Stata J. 16(Number 2), 416\u2013423 (2016)","journal-title":"Stata J."},{"issue":"17","key":"8_CR5","doi-asserted-by":"publisher","first-page":"3797","DOI":"10.1103\/PhysRevLett.81.3797","volume":"81","author":"BS Kerner","year":"1998","unstructured":"Kerner, B.S.: Experimental features of self-organization in traffic flow. Phys. Rev. Lett. 81(17), 3797\u20133800 (1998)","journal-title":"Phys. Rev. Lett."},{"issue":"9","key":"8_CR6","doi-asserted-by":"publisher","first-page":"092001","DOI":"10.1088\/1751-8113\/44\/9\/092001","volume":"44","author":"BS Kerner","year":"2011","unstructured":"Kerner, B.S.: Optimum principle for a vehicular traffic network: minimum probability of congestion. J. Phys. A 44(9), 092001 (2011)","journal-title":"J. Phys. A"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1016\/j.physa.2016.09.034","volume":"466","author":"BS Kerner","year":"2017","unstructured":"Kerner, B.S.: Breakdown minimization principle versus wardrops equilibria for dynamic traffic assignment and control in traffic and transportation networks: A critical mini-review. Phys. Stat. Mech. Appl. 466, 626\u2013662 (2017)","journal-title":"Phys. Stat. Mech. Appl."},{"key":"8_CR8","doi-asserted-by":"publisher","DOI":"10.4135\/9781412963947","volume-title":"Encyclopedia of Survey Research Methods","author":"PJ Lavrakas","year":"2008","unstructured":"Lavrakas, P.J., Williams, R.L.: Taylor series linearization. In: Lavrakas, P.J. (ed.) Encyclopedia of Survey Research Methods. Sage Publications, Newbury Park (2008)"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Souza, A.M.D., Yokoyama, R.S., Maia, G., Loureiro, A., Villas, L.: Real-time path planning to prevent traffic jam through an intelligent transportation system. In: Computers and Communication, pp. 726\u2013731 (2016)","DOI":"10.1109\/ISCC.2016.7543822"},{"issue":"3","key":"8_CR10","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1680\/ipeds.1952.11259","volume":"1","author":"J G WARDROP","year":"1952","unstructured":"Wardrop, J.G.: Road paper. Some theoretical aspects of road traffic research, vol. 1, no. 3, pp. 325\u2013362 (1952)","journal-title":"Proceedings of the Institution of Civil Engineers"},{"issue":"12","key":"8_CR11","doi-asserted-by":"publisher","first-page":"3344","DOI":"10.1109\/TITS.2016.2543263","volume":"17","author":"M Zhu","year":"2016","unstructured":"Zhu, M., et al.: Public vehicles for future urban transportation. IEEE Trans. Intell. Transp. Syst. 17(12), 3344\u20133353 (2016)","journal-title":"IEEE Trans. Intell. Transp. Syst."}],"container-title":["Lecture Notes in Computer Science","Computational Data and Social Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04648-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T02:55:09Z","timestamp":1775271309000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-04648-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046477","9783030046484"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04648-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"CSoNet","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Social Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csonet2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/optnetsci.cise.ufl.edu\/CSoNet\/index.html","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"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"106","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"44","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"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"}},{"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"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}