{"id":"https://openalex.org/W830396839","doi":null,"title":"A PATH-BASED GRADIENT PROJECTION ALGORITHM: EFFECTS OF EQUILIBRATION WITH A RESTRICTED PATH SET UNDER TWO FLOW UPDATE POLICIES","display_name":"A PATH-BASED GRADIENT PROJECTION ALGORITHM: EFFECTS OF EQUILIBRATION WITH A RESTRICTED PATH SET UNDER TWO FLOW UPDATE POLICIES","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W830396839","mag":"830396839"},"language":"en","primary_location":{"id":"mag:830396839","doi":null,"is_oa":false,"landing_page_url":"https://trid.trb.org/view/476527","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","indexed_in":[],"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/A5088303163","display_name":"Anlin Chen","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A Chen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5085499435","display_name":"R. Jayakrishnan","orcid":"https://orcid.org/0000-0002-0155-3622","observed_orcids":["https://orcid.org/0000-0002-0155-3622"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. Jayakrishnan","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-0155-3622","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.3475,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.92074904,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9291999936103821,"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":0.9291999936103821,"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.009499999694526196,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.00800000037997961,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/column-generation","display_name":"column generation","score":0.7480000257492065},{"id":"https://openalex.org/keywords/shortest-path-computation","display_name":"shortest path computation","score":0.5830000042915344},{"id":"https://openalex.org/keywords/equilibrium-solutions","display_name":"equilibrium solutions","score":0.46000000834465027},{"id":"https://openalex.org/keywords/traffic-assignment-algorithms","display_name":"traffic assignment algorithms","score":0.5989999771118164}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7852367162704468},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.7401813268661499},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6530979871749878},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5666057467460632},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5498688817024231},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.529478907585144},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5208930969238281},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.49907493591308594},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.477235347032547},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.47283774614334106},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4682905077934265},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.4575161337852478},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.4312765598297119},{"id":"https://openalex.org/C207512268","wikidata":"https://www.wikidata.org/wiki/Q3074551","display_name":"Traffic flow (computer networking)","level":2,"score":0.4120141565799713},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37817448377609253},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.15896058082580566},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.12338283658027649},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06805720925331116},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.060361266136169434},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:830396839","doi":null,"is_oa":false,"landing_page_url":"https://trid.trb.org/view/476527","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.5378999710083008,"display_name":"Industry, innovation and infrastructure"}],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W650291818","https://openalex.org/W2626097948","https://openalex.org/W3001727567","https://openalex.org/W571213204","https://openalex.org/W2051622992","https://openalex.org/W1969583101","https://openalex.org/W2804502399","https://openalex.org/W2373905999","https://openalex.org/W4206926907","https://openalex.org/W6987232462"],"abstract_inverted_index":{"In":[0],"the":[1,11,26,40,49,68,72,76,80,84,90,108,128,139,143],"network":[2],"traffic":[3,114],"assignment":[4,115],"problem,":[5],"it":[6],"is":[7,106],"generally":[8],"believed":[9],"that":[10],"minimum":[12],"number":[13,50],"of":[14,51,110],"paths":[15,28,59,78],"defining":[16],"an":[17],"equilibrium":[18,93],"solution":[19],"can":[20],"be":[21],"obtained":[22],"by":[23,55],"repeatedly":[24],"equilibrating":[25],"set":[27],"generated":[29],"thus":[30],"far":[31],"in":[32,39,58,67,79,97],"each":[33],"iteration":[34],"before":[35],"creating":[36],"new":[37],"ones":[38],"column":[41],"generation":[42],"phase.":[43],"This":[44],"scheme":[45,94],"aims":[46],"to":[47,63,141],"minimize":[48],"shortest":[52],"path":[53,81,92,145],"calculations":[54],"only":[56],"bringing":[57],"with":[60,117,127],"greater":[61],"potential":[62],"cause":[64],"a":[65],"reduction":[66],"objective":[69],"and":[70,103,135],"at":[71],"same":[73],"time":[74],"retaining":[75],"existing":[77],"set.":[82],"Using":[83],"path-based":[85],"gradient":[86],"projection":[87],"(GP)":[88],"algorithm,":[89],"restricted":[91,144],"was":[95],"tested":[96],"two":[98,119],"flow":[99,120,130],"update":[100,121,131],"policies:":[101],"all-at-once":[102],"one-at-a-time.":[104],"Discussed":[105],"also":[107],"applicability":[109],"implementing":[111],"other":[112],"known":[113],"algorithms":[116],"these":[118],"policies.":[122],"The":[123],"GP":[124],"works":[125],"well":[126],"one-at-a-time":[129],"for":[132],"both":[133],"large":[134],"small":[136],"networks":[137],"without":[138],"need":[140],"employ":[142],"equilibration":[146],"scheme.":[147]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2016-06-24T00:00:00"}