{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T22:22:29Z","timestamp":1781907749169,"version":"3.54.5"},"reference-count":46,"publisher":"Informa UK Limited","issue":"5","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":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2023,9,3]]},"DOI":"10.1080\/10556788.2023.2196725","type":"journal-article","created":{"date-parts":[[2023,5,22]],"date-time":"2023-05-22T18:42:19Z","timestamp":1684780939000},"page":"1081-1104","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":2,"title":["Sequential path-equilibration algorithm for highly accurate traffic flow assignment in an urban road network"],"prefix":"10.1080","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6634-1313","authenticated-orcid":false,"given":"Alexander Y.","family":"Krylatov","sequence":"first","affiliation":[{"name":"Faculty of Applied Mathematics and control Processes, St. Petersburg State University, St. Petersburg, Russia"},{"name":"Department of Transport Systems Organization Problems, Institute of Transport Problems RAS, St. Petersburg, Russia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"301","published-online":{"date-parts":[[2023,5,22]]},"reference":[{"key":"e_1_3_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2009.11.004"},{"key":"e_1_3_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2013.08.018"},{"key":"e_1_3_2_4_1","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)0733-947X(2007)133:4(232)"},{"issue":"9","key":"e_1_3_2_5_1","first-page":"408","article-title":"Non-unique route flow solutions for user-equilibrium assignments","volume":"48","author":"Bar-Gera H.","year":"2007","unstructured":"H. Bar-Gera and A. Luzon, Non-unique route flow solutions for user-equilibrium assignments, Traffic Eng. Control. 48(9) (2007), pp. 408\u2013412.","journal-title":"Traffic Eng. Control."},{"key":"e_1_3_2_6_1","volume-title":"Studies in the Economics of Transportation","author":"Beckmann M.","year":"1956","unstructured":"M. Beckmann, C. McGuire, and C. Winsten, Studies in the Economics of Transportation, Yale University Press, New Haven, Conn, 1956."},{"key":"e_1_3_2_7_1","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)0733-947X(2004)130:1(49)"},{"key":"e_1_3_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sbspro.2014.07.184"},{"key":"e_1_3_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-4754(01)00437-2"},{"key":"e_1_3_2_10_1","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)0733-947X(2002)128:1(31)"},{"key":"e_1_3_2_11_1","unstructured":"A. Chen and R. Jayakrishnan 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 1998 pp. 1\u201319."},{"key":"e_1_3_2_12_1","doi-asserted-by":"publisher","DOI":"10.6028\/jres.073B.010"},{"key":"e_1_3_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0191-2615(81)90026-6"},{"key":"e_1_3_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-014-9668-6"},{"key":"e_1_3_2_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2006.02.008"},{"key":"e_1_3_2_16_1","doi-asserted-by":"publisher","DOI":"10.1068\/a160067"},{"key":"e_1_3_2_17_1","unstructured":"C. Fisk and S. Nguyen A unified approach for the solution of network equilibrium problems. Publication 169 Centre de sur les transports Universit\u00e9 de Montr\u00e9al Montr\u00e9al. 1980."},{"key":"e_1_3_2_18_1","doi-asserted-by":"publisher","DOI":"10.3141\/2090-02"},{"key":"e_1_3_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0927-0507(05)80110-0"},{"key":"e_1_3_2_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030109"},{"key":"e_1_3_2_21_1","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2017.1332621"},{"key":"e_1_3_2_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2018.11.004"},{"key":"e_1_3_2_23_1","first-page":"1","article-title":"Upright stiff: Subproblem updating in the fw method for traffic assignment","volume":"3","author":"Holmgren J.","year":"2013","unstructured":"J. Holmgren and P. Lindberg, Upright stiff: Subproblem updating in the fw method for traffic assignment, EURO J. Transp. Logist. 3(2013), pp. 1\u201321.","journal-title":"EURO J. Transp. Logist."},{"key":"e_1_3_2_24_1","first-page":"75","article-title":"A faster path-based algorithm for traffic assignment","volume":"1443","author":"Jayakrishnan R.","year":"1994","unstructured":"R. Jayakrishnan, W. Tsai, and J. Prashker, et\u00a0al. A faster path-based algorithm for traffic assignment, Transp. Res. Rec. 1443(1994), pp. 75\u201383.","journal-title":"Transp. Res. Rec."},{"key":"e_1_3_2_25_1","first-page":"121","article-title":"Optimal strategies for traffic flow management on the transportation network of parallel links","volume":"2","author":"Krylatov A.","year":"2014","unstructured":"A. Krylatov, Optimal strategies for traffic flow management on the transportation network of parallel links, Vestnik S-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr. 2(2014), pp. 121\u2013130.","journal-title":"Vestnik S-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr."},{"key":"e_1_3_2_26_1","doi-asserted-by":"publisher","DOI":"10.1134\/S1990478916020095"},{"key":"e_1_3_2_27_1","doi-asserted-by":"publisher","DOI":"10.1134\/S199047891801009X"},{"key":"e_1_3_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-020-09725-z"},{"key":"e_1_3_2_29_1","unstructured":"A. Krylatov and Y. Gorozhankin Program for highly accurate estimation of route-flow and arc-flow traffic assignment (hatap). Certificate on Software Registration RU 2021616168 April 19 2021. Submission No. 2021615426 April 12 2021 2021."},{"key":"e_1_3_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-53552-0_9"},{"key":"e_1_3_2_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2014.11.002"},{"key":"e_1_3_2_32_1","unstructured":"A. Kumar and S. Peeta An improved social pressure algorithm for the static deterministic user equilibrium traffic assignment problem Transportation Research Board of the National Academics Washington DC 2011."},{"key":"e_1_3_2_33_1","unstructured":"D. Kupsizewska and D. Van Vliet 101 uses for path-based assignment in European Transport Conference 1999."},{"key":"e_1_3_2_34_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.26.1.4"},{"key":"e_1_3_2_35_1","volume-title":"Mathematical Programming Algorithms for Large Scale Network Equilibrium and Network Design Problem","author":"LeBlanc L.","year":"1973","unstructured":"L. LeBlanc, Mathematical Programming Algorithms for Large Scale Network Equilibrium and Network Design Problem, Department of Industrial Engineering and Management Science, Northwestern University, 1973."},{"key":"e_1_3_2_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/0041-1647(75)90030-1"},{"key":"e_1_3_2_37_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.7.2.168"},{"key":"e_1_3_2_38_1","first-page":"7","article-title":"Convergence of the frank-wolfe algorithm in transportation networks","volume":"19","author":"Lupi M.","year":"1985","unstructured":"M. Lupi, Convergence of the frank-wolfe algorithm in transportation networks, Civ. Eng. Sys. 19(1985), pp. 7\u201315.","journal-title":"Civ. Eng. Sys."},{"key":"e_1_3_2_39_1","unstructured":"S. Nguyen A mathematical programming approach to equilibrium methods of traffic assignment with fixed demands. Publication 138 D\u00e9partment d'Informatique et de Recherche Op\u00e9rationelle Universit\u00e9 de Montr\u00e9al Montr\u00e9al 1973."},{"key":"e_1_3_2_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2009.06.005"},{"key":"e_1_3_2_41_1","volume-title":"The Traffic Assignment Problem: Models and Methods","author":"Patriksson M.","year":"1994","unstructured":"M. Patriksson, The Traffic Assignment Problem: Models and Methods, VSP, Utrecht, The Netherlands, 1994."},{"key":"e_1_3_2_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2014.08.024"},{"key":"e_1_3_2_43_1","unstructured":"J. Sender and M. Netter \u00c9quilibre offre-demande et tarification sur un r\u00e9seau de transport. Rapport de recherche 3 D\u00e9partement Economie Institut de Recherche des Transports Arcueil France 1970."},{"key":"e_1_3_2_44_1","volume-title":"Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods","author":"Sheffi Y.","year":"1985","unstructured":"Y. Sheffi, Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods, Prentice-Hall, Inc, Englewood Cliffs, NJ, 1985."},{"key":"e_1_3_2_45_1","unstructured":"H. Slavin J. Brandon and A. Rabinowicz An empirical comparison of alternative user equilibrium traffic assignment methods in Proceedings of the European Transport Conference Association for European Transport Strasbourg France 2006."},{"key":"e_1_3_2_46_1","doi-asserted-by":"publisher","DOI":"10.1177\/0361198196153700115"},{"key":"e_1_3_2_47_1","doi-asserted-by":"crossref","unstructured":"J.G. Wardrop Some theoretical aspects of road traffic research in Proceedings Institution of Civil Engineers Vol. 2 1952 pp. 325\u2013378.","DOI":"10.1680\/ipeds.1952.11259"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2023.2196725","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,28]],"date-time":"2024-08-28T06:18:13Z","timestamp":1724825893000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2023.2196725"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,22]]},"references-count":46,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,9,3]]}},"alternative-id":["10.1080\/10556788.2023.2196725"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2023.2196725","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,22]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2021-09-21","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-03-26","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-05-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}