{"id":"https://openalex.org/W4377224665","doi":"https://doi.org/10.1080/10556788.2023.2196725","title":"Sequential path-equilibration algorithm for highly accurate traffic flow assignment in an urban road network","display_name":"Sequential path-equilibration algorithm for highly accurate traffic flow assignment in an urban road network","publication_year":2023,"publication_date":"2023-05-22","ids":{"openalex":"https://openalex.org/W4377224665","doi":"https://doi.org/10.1080/10556788.2023.2196725"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2023.2196725","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2023.2196725","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029315125","display_name":"Alexander Krylatov","orcid":"https://orcid.org/0000-0002-6634-1313"},"institutions":[{"id":"https://openalex.org/I172901346","display_name":"St Petersburg University","ror":"https://ror.org/023znxa73","country_code":"RU","type":"education","lineage":["https://openalex.org/I172901346"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Alexander Y. Krylatov","raw_affiliation_strings":["Department of Transport Systems Organization Problems, Institute of Transport Problems RAS, St. Petersburg, Russia","Faculty of Applied Mathematics and control Processes, St. Petersburg State University, St. Petersburg, Russia"],"raw_orcid":"https://orcid.org/0000-0002-6634-1313","affiliations":[{"raw_affiliation_string":"Department of Transport Systems Organization Problems, Institute of Transport Problems RAS, St. Petersburg, Russia","institution_ids":[]},{"raw_affiliation_string":"Faculty of Applied Mathematics and control Processes, St. Petersburg State University, St. Petersburg, Russia","institution_ids":["https://openalex.org/I172901346"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5029315125"],"corresponding_institution_ids":["https://openalex.org/I172901346"],"apc_list":null,"apc_paid":null,"fwci":0.6628,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.76365152,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"38","issue":"5","first_page":"1081","last_page":"1104"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":1.0,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":1.0,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10524","display_name":"Traffic control and management","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11500","display_name":"Evacuation and Crowd Dynamics","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6862858533859253},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.6654978394508362},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5932480096817017},{"id":"https://openalex.org/keywords/traffic-flow","display_name":"Traffic flow (computer networking)","score":0.589769184589386},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5609273314476013},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5258104205131531},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5155646800994873},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.506234347820282},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48652762174606323},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4582360088825226},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.45255744457244873},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.4458231031894684},{"id":"https://openalex.org/keywords/arc-length","display_name":"Arc length","score":0.4257243871688843},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3370388150215149},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.21280360221862793}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6862858533859253},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.6654978394508362},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5932480096817017},{"id":"https://openalex.org/C207512268","wikidata":"https://www.wikidata.org/wiki/Q3074551","display_name":"Traffic flow (computer networking)","level":2,"score":0.589769184589386},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5609273314476013},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5258104205131531},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5155646800994873},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.506234347820282},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48652762174606323},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4582360088825226},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.45255744457244873},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.4458231031894684},{"id":"https://openalex.org/C22251595","wikidata":"https://www.wikidata.org/wiki/Q670036","display_name":"Arc length","level":3,"score":0.4257243871688843},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3370388150215149},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.21280360221862793},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556788.2023.2196725","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2023.2196725","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8199999928474426,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[{"id":"https://openalex.org/G3997752577","display_name":null,"funder_award_id":"19-71-10012","funder_id":"https://openalex.org/F4320324099","funder_display_name":"Russian Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320324099","display_name":"Russian Science Foundation","ror":"https://ror.org/03y2gwe85"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W210646317","https://openalex.org/W280512313","https://openalex.org/W1542473770","https://openalex.org/W1603205161","https://openalex.org/W1969583101","https://openalex.org/W1973233604","https://openalex.org/W1982398985","https://openalex.org/W1995720410","https://openalex.org/W2000991574","https://openalex.org/W2003912133","https://openalex.org/W2006122291","https://openalex.org/W2008971185","https://openalex.org/W2025149596","https://openalex.org/W2032200483","https://openalex.org/W2038691660","https://openalex.org/W2041119249","https://openalex.org/W2042114124","https://openalex.org/W2043830623","https://openalex.org/W2053806224","https://openalex.org/W2054739716","https://openalex.org/W2057634493","https://openalex.org/W2082848291","https://openalex.org/W2092941378","https://openalex.org/W2136885855","https://openalex.org/W2158503783","https://openalex.org/W2161233707","https://openalex.org/W2162544994","https://openalex.org/W2168405789","https://openalex.org/W2177295793","https://openalex.org/W2402216751","https://openalex.org/W2626097948","https://openalex.org/W2791908332","https://openalex.org/W2901572114","https://openalex.org/W3043239617","https://openalex.org/W3120995718","https://openalex.org/W3123524401","https://openalex.org/W4237662624"],"related_works":["https://openalex.org/W2014768544","https://openalex.org/W327730424","https://openalex.org/W2622678100","https://openalex.org/W2357221929","https://openalex.org/W2119981098","https://openalex.org/W569048669","https://openalex.org/W2402216751","https://openalex.org/W1973565615","https://openalex.org/W2005094119","https://openalex.org/W4303980230"],"abstract_inverted_index":{"Nowadays,":[0],"the":[1,26,32,38,56,65,79,87,101,107,140,166],"issue":[2],"of":[3,19,31,76,134],"traffic":[4,34,112,136],"flow":[5,113],"assignment":[6,35,114,137],"has":[7],"become":[8],"an":[9],"interdisciplinary":[10],"topic":[11],"that":[12,83],"concerns":[13],"multiple":[14],"research":[15],"areas":[16],"and":[17,28],"branches":[18],"science.":[20],"This":[21],"work":[22],"is":[23,61],"focussed":[24],"on":[25,68,115],"mathematical":[27,85],"computational":[29,127],"aspects":[30],"equilibrium":[33],"problem":[36],"in":[37],"case":[39],"when":[40],"route":[41],"flows":[42],"are":[43],"considered":[44],"to":[45,63,105,130,144,157,165,172],"be":[46],"decision":[47],"variables.":[48],"Firstly,":[49],"we":[50,99],"obtain":[51],"a":[52,72],"fixed-point":[53,103],"mapping":[54],"with":[55,78,121,159],"explicit":[57],"contraction":[58],"operator,":[59],"which":[60],"proven":[62],"equilibrate":[64],"journey":[66],"times":[67],"feasible":[69],"routes":[70],"between":[71],"single":[73],"origin-destination":[74],"pair":[75],"nodes":[77],"quadratic":[80],"rate.":[81],"Remarkable":[82],"from":[84],"perspectives,":[86],"developed":[88,149],"operator":[89],"generalizes":[90],"most":[91],"path-equilibration":[92,109,154],"operators":[93],"already":[94],"exploited":[95],"by":[96],"researchers.":[97],"Secondly,":[98],"use":[100],"obtained":[102],"procedure":[104],"run":[106],"sequential":[108,153],"algorithm":[110,155],"for":[111,169],"well-known":[116],"test":[117],"urban":[118],"road":[119],"networks":[120],"arc-additive":[122],"travel":[123],"time":[124],"functions.":[125],"Our":[126],"results":[128],"appear":[129],"demonstrate":[131],"higher":[132],"accuracy":[133],"user-equilibrium":[135],"solutions":[138,158,168],"than":[139],"best":[141,167],"ones":[142],"known":[143],"us.":[145],"In":[146],"other":[147],"words,":[148],"within":[150],"this":[151],"paper":[152],"leads":[156],"less":[160],"goal":[161],"function":[162],"values":[163],"compared":[164],"today,":[170],"according":[171],"our":[173],"knowledge.":[174]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}