{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:52:10Z","timestamp":1743076330766,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030869724"},{"type":"electronic","value":"9783030869731"}],"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-86973-1_20","type":"book-chapter","created":{"date-parts":[[2021,9,10]],"date-time":"2021-09-10T12:03:14Z","timestamp":1631275394000},"page":"285-294","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Origin-Destination Matrix Estimation Using Bush-Based User Equilibrium Algorithms"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2070-5871","authenticated-orcid":false,"given":"Franti\u0161ek","family":"Kolovsk\u00fd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4556-2771","authenticated-orcid":false,"given":"Ivana","family":"Kolingerov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,11]]},"reference":[{"issue":"3","key":"20_CR1","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1080\/23249935.2020.1722279","volume":"16","author":"A Babazadeh","year":"2020","unstructured":"Babazadeh, A., Javani, B., Gentile, G., Florian, M.: Reduced gradient algorithm for user equilibrium traffic assignment problem. Transportmetrica A Transp. Sci. 16(3), 1111\u20131135 (2020). https:\/\/doi.org\/10.1080\/23249935.2020.1722279","journal-title":"Transportmetrica A Transp. Sci."},{"issue":"4","key":"20_CR2","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1287\/trsc.36.4.398.549","volume":"36","author":"H Bar-Gera","year":"2002","unstructured":"Bar-Gera, H.: Origin-based algorithm for the traffic assignment problem. Transp. Sci. 36(4), 398\u2013417 (2002). https:\/\/doi.org\/10.1287\/trsc.36.4.398.549","journal-title":"Transp. Sci."},{"key":"20_CR3","doi-asserted-by":"publisher","unstructured":"Bar-Gera, H.: Traffic assignment by paired alternative segments. Transp. Res. Part B Methodol. 44(8-9), 1022\u20131046 (2010). https:\/\/doi.org\/10.1016\/j.trb.2009.11.004. http:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0191261509001350","DOI":"10.1016\/j.trb.2009.11.004"},{"issue":"4\u20135","key":"20_CR4","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0191-2615(84)90012-2","volume":"18","author":"E Cascetta","year":"1984","unstructured":"Cascetta, E.: Estimation of trip matrices from traffic counts and survey data: a generalized least squares estimator. Transp. Res. Part B Methodol. 18(4\u20135), 289\u2013299 (1984)","journal-title":"Transp. Res. Part B Methodol."},{"issue":"1","key":"20_CR5","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1287\/trsc.14.1.42","volume":"14","author":"S Dafermos","year":"1980","unstructured":"Dafermos, S.: Traffic equilibrium and variational inequalities. Transp. Sci. 14(1), 42\u201354 (1980)","journal-title":"Transp. Sci."},{"issue":"4","key":"20_CR6","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/BF01110482","volume":"21","author":"SS Dey","year":"1994","unstructured":"Dey, S.S., Fricker, J.D.: Bayesian updating of trip generation data: combining national trip generation rates with local data. Transportation 21(4), 393\u2013403 (1994)","journal-title":"Transportation"},{"issue":"10","key":"20_CR7","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1016\/j.trb.2006.02.008","volume":"40","author":"RB Dial","year":"2006","unstructured":"Dial, R.B.: A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration. Transp. Res. Part B Methodol. 40(10), 917\u2013936 (2006)","journal-title":"Transp. Res. Part B Methodol."},{"issue":"1","key":"20_CR8","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1080\/18128602.2012.691911","volume":"10","author":"G Gentile","year":"2014","unstructured":"Gentile, G.: Local user cost equilibrium: a bush-based algorithm for traffic assignment. Transportmetrica A Transp. Sci. 10(1), 15\u201354 (2014). https:\/\/doi.org\/10.1080\/18128602.2012.691911","journal-title":"Transportmetrica A Transp. Sci."},{"issue":"4","key":"20_CR9","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1287\/trsc.19.4.445","volume":"19","author":"LJ LeBlanc","year":"1985","unstructured":"LeBlanc, L.J., Helgason, R.V., Boyce, D.E.: Improved efficiency of the Frank-Wolfe algorithm for convex network programs. Transp. Sci. 19(4), 445\u2013462 (1985). https:\/\/doi.org\/10.1287\/trsc.19.4.445","journal-title":"Transp. Sci."},{"key":"20_CR10","doi-asserted-by":"publisher","unstructured":"Lundgren, J.T., Peterson, A.: A heuristic for the bilevel origin\u2013destination-matrix estimation problem. Transp. Res. Part B Methodol. 42(4), 339\u2013354 (2008). https:\/\/doi.org\/10.1016\/j.trb.2007.09.005. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S019126150700080X","DOI":"10.1016\/j.trb.2007.09.005"},{"issue":"6","key":"20_CR11","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/0191-2615(83)90030-9","volume":"17","author":"M Maher","year":"1983","unstructured":"Maher, M.: Inferences on trip matrices from observations on link volumes: a Bayesian statistical approach. Transp. Res. Part B Methodol. 17(6), 435\u2013447 (1983)","journal-title":"Transp. Res. Part B Methodol."},{"issue":"1","key":"20_CR12","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.trb.2009.06.005","volume":"44","author":"YM Nie","year":"2010","unstructured":"Nie, Y.M.: A class of bush-based algorithms for the traffic assignment problem. Transp. Res. Part B Methodol. 44(1), 73\u201389 (2010). https:\/\/doi.org\/10.1016\/j.trb.2009.06.005. http:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0191261509000769","journal-title":"Transp. Res. Part B Methodol."},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.cor.2014.08.024","volume":"54","author":"O Perederieieva","year":"2015","unstructured":"Perederieieva, O., Ehrgott, M., Raith, A., Wang, J.Y.: A framework for and empirical study of algorithms for traffic assignment. Comput. Oper. Res. 54, 90\u2013107 (2015). https:\/\/doi.org\/10.1016\/j.cor.2014.08.024. http:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054814002354","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"20_CR14","doi-asserted-by":"publisher","first-page":"2923","DOI":"10.1007\/s11116-019-09999-1","volume":"47","author":"M Rostami Nasab","year":"2020","unstructured":"Rostami Nasab, M., Shafahi, Y.: Estimation of origin-destination matrices using link counts and partial path data. Transportation 47(6), 2923\u20132950 (2020). https:\/\/doi.org\/10.1007\/s11116-019-09999-1","journal-title":"Transportation"},{"issue":"4","key":"20_CR15","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0191-2615(79)90022-5","volume":"13","author":"MJ Smith","year":"1979","unstructured":"Smith, M.J.: The existence, uniqueness and stability of traffic equilibria. Transp. Res. Part B Methodol. 13(4), 295\u2013304 (1979)","journal-title":"Transp. Res. Part B Methodol."},{"issue":"5","key":"20_CR16","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/0191-2615(87)90037-3","volume":"21","author":"H Spiess","year":"1987","unstructured":"Spiess, H.: A maximum likelihood model for estimating origin-destination matrices. Transp. Res. Part B Methodol. 21(5), 395\u2013412 (1987)","journal-title":"Transp. Res. Part B Methodol."},{"key":"20_CR17","unstructured":"Spiess, H.: A gradient approach for the O-D matrix adjustment problem. EMME\/2 Support Center, CH-2558 Aegerten, Switzerland (1990)"},{"issue":"3","key":"20_CR18","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0191-2615(80)90008-9","volume":"14","author":"HJ Van Zuylen","year":"1980","unstructured":"Van Zuylen, H.J., Willumsen, L.G.: The most likely trip matrix estimated from traffic counts. Transp. Res. Part B Methodol. 14(3), 281\u2013293 (1980)","journal-title":"Transp. Res. Part B Methodol."},{"issue":"2","key":"20_CR19","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1287\/trsc.2018.0845","volume":"53","author":"J Xie","year":"2019","unstructured":"Xie, J., Nie, Y.M.: A new algorithm for achieving proportionality in user equilibrium traffic assignment. Transp. Sci. 53(2), 566\u2013584 (2019). https:\/\/doi.org\/10.1287\/trsc.2018.0845","journal-title":"Transp. Sci."},{"issue":"48","key":"20_CR20","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1177\/0361198118774236","volume":"2672","author":"J Xie","year":"2018","unstructured":"Xie, J., Nie, Y.M., Liu, X.: A greedy path-based algorithm for traffic assignment. Transp. Res. Rec. 2672(48), 36\u201344 (2018). https:\/\/doi.org\/10.1177\/0361198118774236","journal-title":"Transp. Res. Rec."},{"key":"20_CR21","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/j.trb.2016.08.009","volume":"93","author":"J Xie","year":"2016","unstructured":"Xie, J., Xie, C.: New insights and improvements of using paired alternative segments for traffic assignment. Transp. Res. Part B Methodol. 93, 406\u2013424 (2016). https:\/\/doi.org\/10.1016\/j.trb.2016.08.009. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0191261516305902","journal-title":"Transp. Res. Part B Methodol."},{"issue":"6","key":"20_CR22","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/0191-2615(82)90006-6","volume":"16","author":"HJ van Zuylen","year":"1982","unstructured":"van Zuylen, H.J., Branston, D.M.: Consistent link flow estimation from counts. Transp. Res. Part B Methodol. 16(6), 473\u2013476 (1982)","journal-title":"Transp. Res. Part B Methodol."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86973-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,22]],"date-time":"2022-01-22T08:04:40Z","timestamp":1642838680000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86973-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030869724","9783030869731"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86973-1_20","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":"11 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cagliari","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccsa.org\/","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":"Customed version of CyberChair 4","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1588","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":"466","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":"18","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":"29% - 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":"2,5","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":"8","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)"}}]}}