{"id":"https://openalex.org/W2085979633","doi":"https://doi.org/10.1109/itsc.2014.6958064","title":"An improved TAPAS algorithm for the traffic assignment problem","display_name":"An improved TAPAS algorithm for the traffic assignment problem","publication_year":2014,"publication_date":"2014-10-01","ids":{"openalex":"https://openalex.org/W2085979633","doi":"https://doi.org/10.1109/itsc.2014.6958064","mag":"2085979633"},"language":"en","primary_location":{"id":"doi:10.1109/itsc.2014.6958064","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc.2014.6958064","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"17th International IEEE Conference on Intelligent Transportation Systems (ITSC)","raw_type":"proceedings-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/A5043746020","display_name":"Jun Xie","orcid":"https://orcid.org/0000-0003-0168-3360"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jun Xie","raw_affiliation_strings":["Shanghai Jiao Tong University, 200240, China","Shanghai Jiao tong University, 200240, China"],"affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University, 200240, China","institution_ids":["https://openalex.org/I183067930"]},{"raw_affiliation_string":"Shanghai Jiao tong University, 200240, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047273081","display_name":"Chi Xie","orcid":"https://orcid.org/0000-0002-2350-0927"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chi Xie","raw_affiliation_strings":["Shanghai Jiao Tong University, 200240, China","Shanghai Jiao tong University, 200240, China"],"affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University, 200240, China","institution_ids":["https://openalex.org/I183067930"]},{"raw_affiliation_string":"Shanghai Jiao tong University, 200240, China","institution_ids":["https://openalex.org/I183067930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5043746020"],"corresponding_institution_ids":["https://openalex.org/I183067930"],"apc_list":null,"apc_paid":null,"fwci":3.1212,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.9182705,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"2336","last_page":"2341"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9997000098228455,"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.9997000098228455,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/algorithm","display_name":"Algorithm","score":0.7418654561042786},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.579456627368927},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5630018711090088},{"id":"https://openalex.org/keywords/identification","display_name":"Identification (biology)","score":0.5464543104171753},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5320521593093872},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5229935646057129},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17005836963653564},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.061755210161209106}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7418654561042786},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.579456627368927},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5630018711090088},{"id":"https://openalex.org/C116834253","wikidata":"https://www.wikidata.org/wiki/Q2039217","display_name":"Identification (biology)","level":2,"score":0.5464543104171753},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5320521593093872},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5229935646057129},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17005836963653564},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.061755210161209106},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C59822182","wikidata":"https://www.wikidata.org/wiki/Q441","display_name":"Botany","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itsc.2014.6958064","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc.2014.6958064","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"17th International IEEE Conference on Intelligent Transportation Systems (ITSC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W2000991574","https://openalex.org/W2001422140","https://openalex.org/W2001560396","https://openalex.org/W2003912133","https://openalex.org/W2006122291","https://openalex.org/W2025149596","https://openalex.org/W2042395642","https://openalex.org/W2053806224","https://openalex.org/W2082848291","https://openalex.org/W2095387289","https://openalex.org/W2100135636","https://openalex.org/W2118258531","https://openalex.org/W2156920109","https://openalex.org/W2175706438","https://openalex.org/W2797415156","https://openalex.org/W6650857801","https://openalex.org/W6674946606","https://openalex.org/W6685151083","https://openalex.org/W7015398334"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2053286651","https://openalex.org/W2181743346","https://openalex.org/W2187401768","https://openalex.org/W2181413294","https://openalex.org/W2989452537","https://openalex.org/W2052122378","https://openalex.org/W2544423928","https://openalex.org/W2394308601"],"abstract_inverted_index":{"Recently,":[0],"Bar-Gera":[1],"proposed":[2],"a":[3,23,65],"new":[4,66],"algorithm":[5,34,52,105],"for":[6],"the":[7,37,57,85,91,94,104,109,154,163],"traffic":[8,38],"assignment":[9,39],"problem":[10],"(TAP)":[11],"that":[12,55,137],"promises":[13],"to":[14],"produce":[15],"highly":[16],"precise":[17],"solutions":[18],"by":[19,40,89,107,161],"identifying":[20],"and":[21,97,112,124,134],"keeping":[22],"list":[24],"of":[25,93,122,153,167],"paired":[26,41],"alternative":[27,42],"segments":[28,43],"(PAS)":[29],"on":[30],"origin-based":[31],"subnetworks.":[32],"The":[33,128],"was":[35],"named":[36],"(TAPAS)":[44],"algorithm.":[45],"This":[46],"paper":[47],"presents":[48],"an":[49],"improved":[50],"TAPAS":[51,59,123,145],"(termed":[53],"iTAPAS)":[54],"enhances":[56],"original":[58],"mainly":[60],"in":[61,146],"two":[62,141],"aspects:":[63],"(1)":[64],"PAS":[67,74,95,110,164],"identification":[68,96],"method":[69],"is":[70,75,139,157],"proposed;":[71],"(2)":[72],"each":[73],"only":[76,83],"associated":[77],"with":[78],"one":[79],"origin.":[80],"iTAPAS":[81,125,138],"not":[82],"accelerates":[84],"solution":[86],"convergence":[87],"performance":[88],"improving":[90],"efficiency":[92],"flow":[98],"shift":[99,114],"operations,":[100],"but":[101],"also":[102,158],"simplifies":[103],"implementation":[106,133],"removing":[108],"matching":[111],"branch":[113],"steps.":[115],"In":[116],"this":[117],"paper,":[118],"detailed":[119],"algorithmic":[120],"procedures":[121],"are":[126],"discussed.":[127],"numerical":[129],"results":[130,156],"from":[131],"our":[132],"comparison":[135,155],"reveal":[136],"nearly":[140],"times":[142],"faster":[143],"than":[144],"solving":[147],"large-scale":[148],"networks.":[149],"An":[150],"in-depth":[151],"interpretation":[152],"subsequently":[159],"followed":[160],"examining":[162],"set":[165],"information":[166],"both":[168],"algorithms.":[169]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}