{"id":"https://openalex.org/W2739501627","doi":"https://doi.org/10.1080/15472450.2017.1358624","title":"Robust traffic assignment model: Formulation, solution algorithms and empirical application","display_name":"Robust traffic assignment model: Formulation, solution algorithms and empirical application","publication_year":2017,"publication_date":"2017-07-27","ids":{"openalex":"https://openalex.org/W2739501627","doi":"https://doi.org/10.1080/15472450.2017.1358624","mag":"2739501627"},"language":"en","primary_location":{"id":"doi:10.1080/15472450.2017.1358624","is_oa":false,"landing_page_url":"https://doi.org/10.1080/15472450.2017.1358624","pdf_url":null,"source":{"id":"https://openalex.org/S172631016","display_name":"Journal of Intelligent Transportation Systems","issn_l":"1547-2442","issn":["1547-2442","1547-2450"],"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":"Journal of Intelligent Transportation Systems","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/A5039264010","display_name":"Ravi Seshadri","orcid":"https://orcid.org/0000-0002-9327-9455"},"institutions":[{"id":"https://openalex.org/I4210167254","display_name":"Singapore-MIT Alliance for Research and Technology","ror":"https://ror.org/05yb3w112","country_code":"SG","type":"education","lineage":["https://openalex.org/I4210167254"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"Ravi Seshadri","raw_affiliation_strings":["Singapore-MIT Alliance for Research and Technology Center, Singapore"],"affiliations":[{"raw_affiliation_string":"Singapore-MIT Alliance for Research and Technology Center, Singapore","institution_ids":["https://openalex.org/I4210167254"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101400433","display_name":"Karthik K. Srinivasan","orcid":"https://orcid.org/0000-0002-9862-0958"},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"facility","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Karthik K. Srinivasan","raw_affiliation_strings":["Department of Civil Engineering, Transportation Engineering Division, IIT Madras, Chennai, Tamil Nadu, India"],"affiliations":[{"raw_affiliation_string":"Department of Civil Engineering, Transportation Engineering Division, IIT Madras, Chennai, Tamil Nadu, India","institution_ids":["https://openalex.org/I24676775"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5039264010"],"corresponding_institution_ids":["https://openalex.org/I4210167254"],"apc_list":null,"apc_paid":null,"fwci":1.4723,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.86165907,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"21","issue":"6","first_page":"507","last_page":"524"},"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/T10298","display_name":"Urban Transport and Accessibility","score":0.9972000122070312,"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.9955999851226807,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.6919410824775696},{"id":"https://openalex.org/keywords/variational-inequality","display_name":"Variational inequality","score":0.6113429665565491},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6027982234954834},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5771521329879761},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.539702832698822},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5173013210296631},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5077298879623413},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4505772888660431},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4210166037082672},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34494298696517944},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3340359330177307}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6919410824775696},{"id":"https://openalex.org/C161999928","wikidata":"https://www.wikidata.org/wiki/Q4556320","display_name":"Variational inequality","level":2,"score":0.6113429665565491},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6027982234954834},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5771521329879761},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.539702832698822},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5173013210296631},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5077298879623413},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4505772888660431},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4210166037082672},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34494298696517944},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3340359330177307},{"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/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","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/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"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/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"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/15472450.2017.1358624","is_oa":false,"landing_page_url":"https://doi.org/10.1080/15472450.2017.1358624","pdf_url":null,"source":{"id":"https://openalex.org/S172631016","display_name":"Journal of Intelligent Transportation Systems","issn_l":"1547-2442","issn":["1547-2442","1547-2450"],"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":"Journal of Intelligent Transportation Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7699999809265137,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W11807714","https://openalex.org/W280512313","https://openalex.org/W362686097","https://openalex.org/W657216361","https://openalex.org/W1542473770","https://openalex.org/W1964160459","https://openalex.org/W1964335281","https://openalex.org/W1971136991","https://openalex.org/W1979258712","https://openalex.org/W1979469436","https://openalex.org/W1994694094","https://openalex.org/W1999094574","https://openalex.org/W2010421823","https://openalex.org/W2010760359","https://openalex.org/W2027320641","https://openalex.org/W2028594966","https://openalex.org/W2028953698","https://openalex.org/W2030331265","https://openalex.org/W2039423859","https://openalex.org/W2046916960","https://openalex.org/W2053276889","https://openalex.org/W2053806224","https://openalex.org/W2054124301","https://openalex.org/W2058794637","https://openalex.org/W2061738751","https://openalex.org/W2066370682","https://openalex.org/W2067175469","https://openalex.org/W2070317330","https://openalex.org/W2096545137","https://openalex.org/W2118258531","https://openalex.org/W2118717209","https://openalex.org/W2131058166","https://openalex.org/W2146853956","https://openalex.org/W2156348746","https://openalex.org/W2158503783","https://openalex.org/W2168677120","https://openalex.org/W2175406533","https://openalex.org/W2177295793","https://openalex.org/W2520097342","https://openalex.org/W2530193718","https://openalex.org/W2553458584","https://openalex.org/W3121734127","https://openalex.org/W3124500318"],"related_works":["https://openalex.org/W2106556139","https://openalex.org/W2207002589","https://openalex.org/W2056754788","https://openalex.org/W1985012061","https://openalex.org/W836555340","https://openalex.org/W1970871823","https://openalex.org/W2391412785","https://openalex.org/W1989778457","https://openalex.org/W2104162970","https://openalex.org/W3050209628"],"abstract_inverted_index":{"The":[0,120],"deterministic":[1,25,161],"traffic":[2,11,52,60,122],"assignment":[3,53,123],"problem":[4,124],"based":[5],"on":[6,176,202],"Wardrop's":[7,57],"first":[8],"criterion":[9],"of":[10,24,37,59,76,100,106,149,188,198],"network":[12,61,217],"utilization":[13],"has":[14],"been":[15],"widely":[16],"studied":[17],"in":[18,28,40],"the":[19,22,34,74,90,101,111,136,182,189,194,199,207,214,233],"literature.":[20],"However,":[21],"assumption":[23],"travel":[26,70,84,108],"times":[27,71],"these":[29],"models":[30],"is":[31,87,126,142,170,211],"restrictive,":[32],"given":[33],"large":[35,177],"degree":[36],"uncertainty":[38,86],"prevalent":[39],"urban":[41],"transportation":[42],"networks.":[43,178,205],"In":[44,165],"this":[45,47],"context,":[46],"paper":[48],"proposes":[49],"a":[50,97,130,138,147,225],"robust":[51,91,113,121],"model":[54,210],"that":[55,154],"generalizes":[56],"principle":[58],"equilibrium":[62,115],"to":[63,78,83,172,213],"networks":[64],"with":[65],"stochastic":[66],"and":[67,72,103,110,157,185,192,196,221,236],"correlated":[68],"link":[69],"incorporates":[73],"aversion":[75],"commuters":[77],"unreliable":[79],"routes.The":[80],"user":[81,114],"response":[82],"time":[85],"modeled":[88],"using":[89,218],"cost":[92],"(RC)":[93],"measure":[94],"(defined":[95],"as":[96,129,224],"weighted":[98],"combination":[99],"mean":[102],"standard":[104,234],"deviation":[105],"path":[107,152,163],"time)":[109],"corresponding":[112],"(UE)":[116],"conditions":[117],"are":[118,155,228],"defined.":[119],"(RTAP)":[125],"subsequently":[127],"formulated":[128],"Variational":[131],"Inequality":[132],"problem.":[133],"To":[134],"solve":[135],"RTAP,":[137],"Gradient":[139],"Projection":[140],"algorithm":[141,191],"proposed,":[143],"which":[144],"involves":[145],"solving":[146],"series":[148],"minimum":[150],"RC":[151],"sub-problems":[153],"theoretically":[156],"practically":[158],"harder":[159],"than":[160],"shortest":[162],"problems.":[164],"addition,":[166],"an":[167],"origin-based":[168,200],"heuristic":[169,201],"proposed":[171,208],"enhance":[173],"computational":[174,183],"performance":[175,184],"Numerical":[179],"experiments":[180],"examine":[181],"convergence":[186],"characteristics":[187],"exact":[190],"establish":[193],"accuracy":[195],"efficiency":[197],"various":[203],"real-world":[204],"Finally,":[206],"RTA":[209],"applied":[212],"Chennai":[215],"road":[216],"empirical":[219],"data,":[220],"its":[222],"benefits":[223],"normative":[226],"benchmark":[227],"quantified":[229],"through":[230],"comparisons":[231],"against":[232],"UE":[235],"System":[237],"Optimum":[238],"(SO)":[239],"models.":[240]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}