{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T11:57:33Z","timestamp":1648555053403},"reference-count":13,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Generation Computer Systems"],"published-print":{"date-parts":[[2001,3]]},"DOI":"10.1016\/s0167-739x(00)00034-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:55:17Z","timestamp":1027612517000},"page":"659-665","source":"Crossref","is-referenced-by-count":1,"title":["Computational aspects in traffic simulation problems"],"prefix":"10.1016","volume":"17","author":[{"given":"S","family":"Rosswog","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C","family":"Gawron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S","family":"Hasselberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R","family":"B\u00f6ning","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-739X(00)00034-0_BIB1","unstructured":"M. Beckmann, C.B. McGuire, C.B. Winsten, Studies in the Economics of Transportation, Yale University Press, New Haven, CT, 1956."},{"key":"10.1016\/S0167-739X(00)00034-0_BIB2","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF02592101","article-title":"Shortest path algorithms: theory and experimental evaluation","volume":"73","author":"Cherkassky","year":"1996","journal-title":"Math. Program."},{"key":"10.1016\/S0167-739X(00)00034-0_BIB3","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/nav.3800030109","article-title":"An algorithm for quadratic programming","volume":"3","author":"Frank","year":"1956","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/S0167-739X(00)00034-0_BIB4","unstructured":"C. Gawron, S. Krau\u00df, P. Wagner, Dynamic user equilibria in a traffic simulation models, in: M. Schreckenberg, D.E. Wolf, (Eds.), Traffic and Granular Flow \u201997, Springer, Singapore, 1998, pp. 469\u2013473."},{"issue":"3","key":"10.1016\/S0167-739X(00)00034-0_BIB5","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1142\/S0129183198000303","article-title":"An iterative algorithm to determine the dynamic user equilibrium in a traffic simulation model","volume":"9","author":"Gawron","year":"1998","journal-title":"Int. J. Mod. Phys. C"},{"key":"10.1016\/S0167-739X(00)00034-0_BIB6","unstructured":"C. Gawron, Ph.D. Thesis, 1998."},{"key":"10.1016\/S0167-739X(00)00034-0_BIB7","unstructured":"S. Hasselberg, Ph.D. Thesis, 2000."},{"key":"10.1016\/S0167-739X(00)00034-0_BIB8","unstructured":"S. Krau\u00df, Microscopic modeling of traffic flow, Ph.D. Thesis, 1998."},{"key":"10.1016\/S0167-739X(00)00034-0_BIB9","doi-asserted-by":"crossref","first-page":"2221","DOI":"10.1051\/jp1:1992277","article-title":"A cellular automaton model for traffic flow","volume":"2","author":"Nagel","year":"1992","journal-title":"J. Phys. I"},{"key":"10.1016\/S0167-739X(00)00034-0_BIB10","unstructured":"M. Ponzlet, P. Wagner, Validation of a CA-model for traffic simulation of the northrhine-westphalia motorway network, in: The 24th European Transport Forum, Proceedings of Seminar, Vol. P 404-1 (1996)."},{"key":"10.1016\/S0167-739X(00)00034-0_BIB11","doi-asserted-by":"crossref","unstructured":"B. Ran, D.E. Boyce, Modeling Dynamic Transportation Networks, Springer, Berlin, 1996.","DOI":"10.1007\/978-3-642-80230-0"},{"key":"10.1016\/S0167-739X(00)00034-0_BIB12","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1002\/net.3230220707","article-title":"Level graphs and approximate shortest path algorithms","volume":"22","author":"Shapiro","year":"1992","journal-title":"Network"},{"key":"10.1016\/S0167-739X(00)00034-0_BIB13","first-page":"325","article-title":"Some theoretical aspects of road traffic","volume":"1","author":"Wardrop","year":"1952","journal-title":"Proc. Inst. Civil Eng."}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X00000340?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X00000340?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T23:28:27Z","timestamp":1555889307000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X00000340"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0167739X00000340"],"URL":"https:\/\/doi.org\/10.1016\/s0167-739x(00)00034-0","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}