{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:24:58Z","timestamp":1743103498718,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031791185"},{"type":"electronic","value":"9783031791192"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-79119-2_2","type":"book-chapter","created":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T21:38:20Z","timestamp":1738273100000},"page":"17-30","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Equilibrium Dynamic Traffic Assignment Model with\u00a0Linear Programming Formulation"],"prefix":"10.1007","author":[{"given":"Victoria","family":"Guseva","sequence":"first","affiliation":[]},{"given":"Ilya","family":"Sklonin","sequence":"additional","affiliation":[]},{"given":"Irina","family":"Podlipnova","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1912-1040","authenticated-orcid":false,"given":"Demyan","family":"Yarmoshik","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7386-039X","authenticated-orcid":false,"given":"Alexander","family":"Gasnikov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,31]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows. Alfred P. Sloan School of Management, Massachusetts, Cambridge, Mass (1988)","DOI":"10.21236\/ADA594171"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1016\/j.trpro.2015.06.025","volume":"7","author":"T Akamatsu","year":"2015","unstructured":"Akamatsu, T., Wada, K., Hayashi, S.: The corridor problem with discrete multiple bottlenecks. Trans. Res. Procedia 7, 474\u2013498 (2015)","journal-title":"Trans. Res. Procedia"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.trb.2021.04.003","volume":"148","author":"T Akamatsu","year":"2021","unstructured":"Akamatsu, T., Wada, K., Iryo, T., Hayashi, S.: A new look at departure time choice equilibrium models with heterogeneous users. Transp. Res. Part B: Methodol. 148, 152\u2013182 (2021)","journal-title":"Transp. Res. Part B: Methodol."},{"issue":"1","key":"2_CR4","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0166-0462(92)90026-W","volume":"22","author":"R Arnott","year":"1992","unstructured":"Arnott, R., De Palma, A., Lindsey, R.: Route choice with heterogeneous drivers and group-specific congestion costs. Reg. Sci. Urban Econ. 22(1), 71\u2013102 (1992)","journal-title":"Reg. Sci. Urban Econ."},{"issue":"3","key":"2_CR5","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)","journal-title":"Transportmetrica A: Transp. Sci."},{"key":"2_CR6","unstructured":"Beckmann, M., McGuire, C.B., Winsten, C.B.: Studies in the economics of transportation. Technical Report (1956)"},{"key":"2_CR7","unstructured":"Boyles, S.D., Lownes, N.E., Unnikrishnan, A.: Transportation network analysis, vol.\u00a01 (2023), edition 0.91"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Bubeck, S.: Convex optimization: algorithms and complexity. arXiv preprint arXiv:1405.4980 (2014)","DOI":"10.1561\/9781601988614"},{"issue":"2","key":"2_CR9","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0191-2615(92)90003-F","volume":"26","author":"M Carey","year":"1992","unstructured":"Carey, M.: Nonconvexity of the dynamic traffic assignment problem. Transp. Res. Part B: Methodol. 26(2), 127\u2013133 (1992)","journal-title":"Transp. Res. Part B: Methodol."},{"issue":"1","key":"2_CR10","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":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1287\/trsc.19.1.29","volume":"19","author":"CF Daganzo","year":"1985","unstructured":"Daganzo, C.F.: The uniqueness of a time-dependent equilibrium distribution of arrivals at a single bottleneck. Transp. Sci. 19(1), 29\u201337 (1985)","journal-title":"Transp. Sci."},{"issue":"83","key":"2_CR12","first-page":"1","volume":"17","author":"S Diamond","year":"2016","unstructured":"Diamond, S., Boyd, S.: CVXPY: a Python-embedded modeling language for convex optimization. J. Mach. Learn. Res. 17(83), 1\u20135 (2016)","journal-title":"J. Mach. Learn. Res."},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Florian, M., Wu, J.H., He, S.: A multi-class multi-mode variable demand network equilibrium model with hierarchical logit structures. In: Transportation and Network Analysis: Current Trends: Miscellanea in Honor of Michael Florian, pp. 119\u2013133. Springer (2002)","DOI":"10.1007\/978-1-4757-6871-8_8"},{"issue":"1","key":"2_CR14","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s12532-017-0130-5","volume":"10","author":"Q Huangfu","year":"2018","unstructured":"Huangfu, Q., Hall, J.J.: Parallelizing the dual revised simplex method. Math. Program. Comput. 10(1), 119\u2013142 (2018)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"2_CR15","first-page":"10","volume":"10","author":"I Ignashin","year":"2024","unstructured":"Ignashin, I., Yaramoshik, D.: Modifications of the frank-wolfe algorithm in the problem of finding the equilibrium distribution of traffic flows. Math. Model. Numer. Simul. 10(1), 10\u201325 (2024)","journal-title":"Math. Model. Numer. Simul."},{"key":"2_CR16","unstructured":"Iryo, T., Yoshii, T.: Equivalent optimization problem for finding equilibrium in the bottleneck model with departure time choices. In: 4th IMA International Conference on Mathematics in TransportInstitute of Mathematics and its Applications (2007)"},{"issue":"3","key":"2_CR17","first-page":"159","volume":"3","author":"V Klee","year":"1972","unstructured":"Klee, V., Minty, G.J.: How good is the simplex algorithm. Inequalities 3(3), 159\u2013175 (1972)","journal-title":"Inequalities"},{"issue":"11","key":"2_CR18","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.3390\/math9111217","volume":"9","author":"M Kubentayeva","year":"2021","unstructured":"Kubentayeva, M., Gasnikov, A.: Finding equilibria in the traffic assignment problem with primal-dual gradient methods for stable dynamics model and beckmann model. Mathematics 9(11), 1217 (2021)","journal-title":"Mathematics"},{"issue":"1","key":"2_CR19","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10287-023-00494-8","volume":"21","author":"M Kubentayeva","year":"2024","unstructured":"Kubentayeva, M., et al.: Primal-dual gradient methods for searching network equilibria in combined models with nested choice structure and capacity constraints. CMS 21(1), 15 (2024)","journal-title":"CMS"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/j.trb.2020.06.009","volume":"139","author":"ZC Li","year":"2020","unstructured":"Li, Z.C., Huang, H.J., Yang, H.: Fifty years of the bottleneck model: a bibliometric review and future research directions. Transp. Res. Part B: Methodol. 139, 311\u2013342 (2020)","journal-title":"Transp. Res. Part B: Methodol."},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.trb.2014.09.016","volume":"71","author":"Y Liu","year":"2015","unstructured":"Liu, Y., Nie, Y.M., Hall, J.: A semi-analytical approach for solving the bottleneck model with general user heterogeneity. Transp. Res. Part B: Methodol. 71, 56\u201370 (2015)","journal-title":"Transp. Res. Part B: Methodol."},{"issue":"3","key":"2_CR22","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1287\/trsc.12.3.183","volume":"12","author":"DK Merchant","year":"1978","unstructured":"Merchant, D.K., Nemhauser, G.L.: A model and an algorithm for the dynamic traffic assignment problems. Transp. Sci. 12(3), 183\u2013199 (1978)","journal-title":"Transp. Sci."},{"issue":"3","key":"2_CR23","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1287\/trsc.12.3.200","volume":"12","author":"DK Merchant","year":"1978","unstructured":"Merchant, D.K., Nemhauser, G.L.: Optimality conditions for a dynamic traffic assignment model. Transp. Sci. 12(3), 200\u2013207 (1978)","journal-title":"Transp. Sci."},{"issue":"2","key":"2_CR24","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1287\/trsc.1120.0409","volume":"47","author":"M Mitradjieva","year":"2013","unstructured":"Mitradjieva, M., Lindberg, P.O.: The stiff is moving\u2013conjugate direction frank-wolfe methods with applications to traffic assignment. Transp. Sci. 47(2), 280\u2013293 (2013)","journal-title":"Transp. Sci."},{"key":"2_CR25","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1023\/A:1025350419398","volume":"3","author":"Y Nesterov","year":"2003","unstructured":"Nesterov, Y., De Palma, A.: Stationary dynamic solutions in congested transportation networks: summary and perspectives. Netw. Spat. Econ. 3, 371\u2013395 (2003)","journal-title":"Netw. Spat. Econ."},{"issue":"7\u20138","key":"2_CR26","doi-asserted-by":"publisher","first-page":"1295","DOI":"10.1016\/j.mcm.2008.11.008","volume":"49","author":"YM Nie","year":"2009","unstructured":"Nie, Y.M., Zhang, M.H.: Numerical solution procedures for the morning commute problem. Math. Comput. Model. 49(7\u20138), 1295\u20131310 (2009)","journal-title":"Math. Comput. Model."},{"key":"2_CR27","unstructured":"Reeder, P., Bhat, C., Lorenzini, K., Hall, K., et\u00a0al.: Positive feedback: exploring current approaches in iterative travel demand model implementation. (2012)"},{"issue":"4","key":"2_CR28","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":"4","key":"2_CR29","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1287\/trsc.18.4.385","volume":"18","author":"MJ Smith","year":"1984","unstructured":"Smith, M.J.: The existence of a time-dependent equilibrium distribution of arrivals at a single bottleneck. Transp. Sci. 18(4), 385\u2013394 (1984)","journal-title":"Transp. Sci."},{"issue":"2","key":"2_CR30","first-page":"251","volume":"59","author":"WS Vickrey","year":"1969","unstructured":"Vickrey, W.S.: Congestion theory and transport investment. Am. Econ. Rev. 59(2), 251\u2013260 (1969)","journal-title":"Am. Econ. Rev."},{"issue":"4","key":"2_CR31","first-page":"155","volume":"15","author":"IL Wang","year":"2018","unstructured":"Wang, I.L.: Multicommodity network flows: a survey, part ii: solution methods. Int. J. Oper. Res. 15(4), 155\u2013173 (2018)","journal-title":"Int. J. Oper. Res."},{"key":"2_CR32","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s11067-005-6662-7","volume":"5","author":"HM Zhang","year":"2005","unstructured":"Zhang, H.M., Nie, X.: Some consistency conditions for dynamic traffic assignment problems. Netw. Spat. Econ. 5, 71\u201387 (2005)","journal-title":"Netw. Spat. Econ."}],"container-title":["Lecture Notes in Computer Science","Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-79119-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T21:38:25Z","timestamp":1738273105000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-79119-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031791185","9783031791192"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-79119-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"31 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OPTIMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Petrovac","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montenegro","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"optima2024a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}