{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T16:05:37Z","timestamp":1762445137220,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"7-9","license":[{"start":{"date-parts":[[2021,1,8]],"date-time":"2021-01-08T00:00:00Z","timestamp":1610064000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,8]],"date-time":"2021-01-08T00:00:00Z","timestamp":1610064000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"publisher","award":["19-71-10012"],"award-info":[{"award-number":["19-71-10012"]}],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10472-020-09725-z","type":"journal-article","created":{"date-parts":[[2021,1,8]],"date-time":"2021-01-08T11:02:58Z","timestamp":1610103778000},"page":"697-713","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Column generation for the equilibrium route-flow traffic assignment problem"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6634-1313","authenticated-orcid":false,"given":"Alexander","family":"Krylatov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,8]]},"reference":[{"issue":"4","key":"9725_CR1","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1061\/(ASCE)0733-947X(2007)133:4(232)","volume":"133","author":"H Bar-Gera","year":"2007","unstructured":"Bar-Gera, H., Luzon, A.: Differences among route flow solutions for the user-equilibrium traffic assignment problem. J. Transp. Eng. 133(4), 232\u2013239 (2007)","journal-title":"J. Transp. Eng."},{"issue":"9","key":"9725_CR2","first-page":"408","volume":"48","author":"H Bar-Gera","year":"2007","unstructured":"Bar-Gera, H., Luzon, A.: Non-unique route flow solutions for user-equilibrium assignments. Traffic Eng. Control 48(9), 408\u2013412 (2007)","journal-title":"Traffic Eng. Control"},{"key":"9725_CR3","volume-title":"Studies in the Economics of Transportation","author":"M Beckmann","year":"1956","unstructured":"Beckmann, M., McGuire, C., Winsten, C.: Studies in the Economics of Transportation. Yale University Press, New Haven Conn (1956)"},{"key":"9725_CR4","volume-title":"Nonlinear Programming, 2nd edn","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont (1999)"},{"key":"9725_CR5","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.sbspro.2014.07.184","volume":"138","author":"S Chao","year":"2014","unstructured":"Chao, S., Chenga, L., Xub, T.: Range of user-equilibrium route flow with applications. Procedia \u2013 Soc. Behav. Sci. 138, 86\u201396 (2014)","journal-title":"Procedia \u2013 Soc. Behav. Sci."},{"key":"9725_CR6","unstructured":"Chen, A., Jayakrishnan, R.: A path-based gradient projection algorithm: Effects of equilibration with a restricted path set under two flow update policies. In: Transportation Research Board Annual Meeting, pp. 1\u201319 (1998)"},{"issue":"2","key":"9725_CR7","doi-asserted-by":"publisher","first-page":"91","DOI":"10.6028\/jres.073B.010","volume":"73B","author":"S Dafermos","year":"1969","unstructured":"Dafermos, S., Sparrow, F.: The traffic assignment problem for a general network. J. Res. Natl. Bur. Stand. 73B(2), 91\u2013118 (1969)","journal-title":"J. Res. Natl. Bur. Stand."},{"issue":"1","key":"9725_CR8","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10589-014-9668-6","volume":"60","author":"D Di Lorenzo","year":"2015","unstructured":"Di Lorenzo, D., Galligari, A., Sciandrone, M.: A convergent and efficient decomposition method for the traffic assignment problem. Comput. Optim. Appl. 60(1), 151\u2013170 (2015)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"9725_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1068\/a160067","volume":"16A","author":"C Fisk","year":"1984","unstructured":"Fisk, C.: A nonlinear equation framework for solving network equilibrium problems. Environ. Plan. 16A(1), 67\u201380 (1984)","journal-title":"Environ. Plan."},{"key":"9725_CR10","volume-title":"A unified approach for the solution of network equilibrium problems Publication, vol. 169","author":"C Fisk","year":"1980","unstructured":"Fisk, C., Nguyen, S.: A unified approach for the solution of network equilibrium problems Publication, vol. 169. Centre de sur les transports, Universit\u00e9 de Montr\u00e9al, Montr\u00e9al (1980)"},{"key":"9725_CR11","doi-asserted-by":"publisher","first-page":"10","DOI":"10.3141\/2090-02","volume":"2090","author":"M Florian","year":"2009","unstructured":"Florian, M., Constantin, I., Florian, D.: A new look at projected gradient method for equilibrium assignment. Transp. Res. Rec. 2090, 10\u201316 (2009)","journal-title":"Transp. Res. Rec."},{"issue":"2","key":"9725_CR12","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1080\/10556788.2017.1332621","volume":"33","author":"A Galligari","year":"2018","unstructured":"Galligari, A., Sciandrone, M.: A convergent and fast path equilibration algorithm for the traffic assignment problem. Optim. Methods Softw. 33(2), 354\u2013371 (2018)","journal-title":"Optim. Methods Softw."},{"key":"9725_CR13","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.cor.2018.11.004","volume":"103","author":"A Galligari","year":"2019","unstructured":"Galligari, A., Sciandrone, M.: A computational study of path-based mathods for optimal traffic assignment with both inelastic and elastic demand. Comput. Oper. Res. 103, 158\u2013166 (2019)","journal-title":"Comput. Oper. Res."},{"key":"9725_CR14","first-page":"75","volume":"1443","author":"R Jayakrishnan","year":"1994","unstructured":"Jayakrishnan, R., Tsai, W., Prashker, J., Rajadhyaksha, S.: A faster path-based algorithm for traffic assignment. Transp. Res. Rec. 1443, 75\u201383 (1994)","journal-title":"Transp. Res. Rec."},{"issue":"2","key":"9725_CR15","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1134\/S1990478916020095","volume":"10","author":"A Krylatov","year":"2016","unstructured":"Krylatov, A.: Network flow assignment as a fixed point problem. J. Appl. Ind. Math. 10(2), 243\u2013256 (2016)","journal-title":"J. Appl. Ind. Math."},{"issue":"1","key":"9725_CR16","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1134\/S199047891801009X","volume":"12","author":"A Krylatov","year":"2018","unstructured":"Krylatov, A.: Reduction of a minimization problem for a convex separable function with linear constraints to a fixed point problem. J. Appl. Ind. Math. 12 (1), 98\u2013111 (2018)","journal-title":"J. Appl. Ind. Math."},{"key":"9725_CR17","doi-asserted-by":"crossref","unstructured":"Krylatov, A., Raevskaya, A.: Travel times equilibration procedure for route-flow traffic assignment problem. Lect. Notes Comput. Sci., 12096 (2020)","DOI":"10.1007\/978-3-030-53552-0_9"},{"key":"9725_CR18","doi-asserted-by":"crossref","unstructured":"Krylatov, A., Zakharov, V., Tuovinen, T.: Optimization Models and Methods for Equilibrium Traffic Assignment. Springer International Publishing (2020)","DOI":"10.1007\/978-3-030-34102-2"},{"key":"9725_CR19","unstructured":"Kumar, A., Peeta, S.: An improved social pressure algorithm for the static deterministic user equilibrium traffic assignment problem. In: Washington DC: Transportation Research Board of the National Academics (2011)"},{"key":"9725_CR20","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.trb.2014.11.002","volume":"71","author":"A Kumar","year":"2015","unstructured":"Kumar, A., Peeta, S.: Entropy weighted average method for the determination of a single representative path flow solution for the static user equilibrium traffic assignment problem. Transp. Res. B 71, 213\u2013229 (2015)","journal-title":"Transp. Res. B"},{"key":"9725_CR21","unstructured":"Kupsizewska, D., Van Vliet, D.: 101 uses for path-based assignment. In: European Transport Conference (1999)"},{"issue":"1","key":"9725_CR22","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1287\/trsc.26.1.4","volume":"26","author":"T Larsson","year":"1992","unstructured":"Larsson, T., Patriksson, M.: Simplicial decomposition with disaggregated representation for the traffic assignment problem. Transp. Sci. 26(1), 4\u201317 (1992)","journal-title":"Transp. Sci."},{"key":"9725_CR23","unstructured":"LeBlanc, L.: Mathematical programming algorithms for large scale network equilibrium and network design problem. Department of Industrial Engineering and Management Science Northwestern University (1973)"},{"key":"9725_CR24","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0041-1647(75)90030-1","volume":"9","author":"L LeBlanc","year":"1975","unstructured":"LeBlanc, L., Morlok, E., Pierskalla, W.: An efficient approach to solving the road network equilibrium traffic assignment problem. Transp. Res. 9, 309\u2013318 (1975)","journal-title":"Transp. Res."},{"issue":"2","key":"9725_CR25","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1287\/trsc.7.2.168","volume":"7","author":"T Leventhal","year":"1973","unstructured":"Leventhal, T., Nemhauser, G., Trotter, L.J.: A column generation algorithm for optimal traffic assignment. Transp. Sci. 7(2), 168\u2013176 (1973)","journal-title":"Transp. Sci."},{"key":"9725_CR26","volume-title":"A mathematical programming approach to equilibrium methods of traffic assignment with fixed demands. Publication 138","author":"S Nguyen","year":"1973","unstructured":"Nguyen, S.: A mathematical programming approach to equilibrium methods of traffic assignment with fixed demands. Publication 138. D\u00e9partment d\u2019Informatique et de Recherche Op\u00e9rationelle, Universit\u00e9 de Montr\u00e9al, Montr\u00e9al (1973)"},{"key":"9725_CR27","volume-title":"The Traffic Assignment Problem: Models and Methods","author":"M Patriksson","year":"1994","unstructured":"Patriksson, M.: The Traffic Assignment Problem: Models and Methods. VSP, Utrecht (1994)"},{"key":"9725_CR28","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.: A framework for and empirical study of algorithms for traffic assignment. Comput. Oper. Res. 54, 90\u2013107 (2015)","journal-title":"Comput. Oper. Res."},{"key":"9725_CR29","volume-title":"\u00c9quilibre offre-demande et tarification sur un r\u00e9seau de transport Rapport de recherche, vol. 3","author":"J Sender","year":"1970","unstructured":"Sender, J., Netter, M.: \u00c9quilibre offre-demande et tarification sur un r\u00e9seau de transport Rapport de recherche, vol. 3. D\u00e9partement Economie, Institut de Recherche des Transports, Arcueil, France (1970)"},{"key":"9725_CR30","volume-title":"Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods","author":"Y Sheffi","year":"1985","unstructured":"Sheffi, Y.: Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods. Prentice-Hall, Inc, Englewood Cliffs (1985)"},{"issue":"1","key":"9725_CR31","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1177\/0361198196153700115","volume":"1537","author":"C Sun","year":"1996","unstructured":"Sun, C., Jayakrishnan, R., Tsai, W.: Computational study of a path-based algorithm and its variants for static traffic assignment. Transp. Res. Rec. 1537(1), 106\u2013115 (1996)","journal-title":"Transp. Res. Rec."},{"key":"9725_CR32","doi-asserted-by":"crossref","unstructured":"Wardrop, J.G.: Some theoretical aspects of road traffic research. In: Proc. Institution of Civil Engineers, vol. 2, pp. 325\u2013378 (1952)","DOI":"10.1680\/ipeds.1952.11259"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-020-09725-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10472-020-09725-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-020-09725-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,10]],"date-time":"2022-08-10T02:11:24Z","timestamp":1660097484000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10472-020-09725-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,8]]},"references-count":32,"journal-issue":{"issue":"7-9","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["9725"],"URL":"https:\/\/doi.org\/10.1007\/s10472-020-09725-z","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[2021,1,8]]},"assertion":[{"value":"27 December 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 January 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}