{"id":"https://openalex.org/W1990934052","doi":null,"title":"Comparison of Assignment Methods for Simulation-Based Dynamic-Equilibrium Traffic Assignment","display_name":"Comparison of Assignment Methods for Simulation-Based Dynamic-Equilibrium Traffic Assignment","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W1990934052","mag":"1990934052"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.134.8206","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.8206","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://transp-or2.epfl.ch/tristan/fullpapers/168mahut.pdf","raw_type":"text"},"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/A5072239522","display_name":"Michael Mahut","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael Mahut","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109004799","display_name":"Micha\u00ebl Florian","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Micha\u00ebl Florian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Nicolas Tremblay","orcid":"https://orcid.org/0000-0001-5776-0770","observed_orcids":["https://orcid.org/0000-0001-5776-0770"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nicolas Tremblay","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-5776-0770","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.5181,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.95037117,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":97},"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.9628999829292297,"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.9628999829292297,"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.025699999183416367,"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.0008999999845400453,"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/dynamic-traffic-assignment","display_name":"dynamic traffic assignment","score":0.8920000195503235},{"id":"https://openalex.org/keywords/variational-inequalities","display_name":"variational inequalities","score":0.8679999709129333},{"id":"https://openalex.org/keywords/simplicial-decomposition","display_name":"simplicial decomposition","score":0.9890000224113464},{"id":"https://openalex.org/keywords/master-problem","display_name":"master problem","score":0.7229999899864197},{"id":"https://openalex.org/keywords/network-load","display_name":"network load","score":0.7020000219345093},{"id":"https://openalex.org/keywords/driver-behavior-model","display_name":"driver behavior model","score":0.6840000152587891},{"id":"https://openalex.org/keywords/traffic-simulation","display_name":"traffic simulation","score":0.8840000033378601}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.625576376914978},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.582289457321167},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.5077729821205139},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.496772825717926},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4577241837978363},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.41896504163742065},{"id":"https://openalex.org/C207512268","wikidata":"https://www.wikidata.org/wiki/Q3074551","display_name":"Traffic flow (computer networking)","level":2,"score":0.4181452989578247},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37101107835769653},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25832730531692505},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.134.8206","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.8206","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://transp-or2.epfl.ch/tristan/fullpapers/168mahut.pdf","raw_type":"text"},{"id":"mag:1990934052","doi":null,"is_oa":false,"landing_page_url":"https://www.researchgate.net/profile/Michael_Florian5/publication/238622121_Comparison_of_assignment_methods_for_simulation-_based_dynamic-equilibrium_traffic_assignment/links/00b49533e962db26c3000000.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306533225","display_name":"Transportation Research Board 87th Annual MeetingTransportation Research Board","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Transportation Research Board 87th Annual MeetingTransportation Research Board","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.75}],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W828623432","https://openalex.org/W1063907922","https://openalex.org/W1566460688","https://openalex.org/W1587327795","https://openalex.org/W2005610030","https://openalex.org/W2010043493","https://openalex.org/W2032137277","https://openalex.org/W2043530786","https://openalex.org/W2086181527","https://openalex.org/W2092941378","https://openalex.org/W2093862823","https://openalex.org/W2093921901","https://openalex.org/W2109413269","https://openalex.org/W2134763711","https://openalex.org/W2145014509","https://openalex.org/W2154376416","https://openalex.org/W2158503783","https://openalex.org/W2175706438","https://openalex.org/W2227602472","https://openalex.org/W2571000320"],"related_works":["https://openalex.org/W650057235","https://openalex.org/W2137404994","https://openalex.org/W65856499","https://openalex.org/W2119664473","https://openalex.org/W1547232111","https://openalex.org/W2977949220","https://openalex.org/W2004257607","https://openalex.org/W1507777837","https://openalex.org/W7099917009","https://openalex.org/W572038666"],"abstract_inverted_index":{"This":[0,130],"paper":[1],"reports":[2],"on":[3],"the":[4,115,122,134,155,169],"evaluation":[5],"of":[6,84,103,111,128,154,168],"alternative":[7],"algorithms":[8,17,185],"for":[9,20,34,107,164],"dynamic,":[10],"or":[11],"time-varying,":[12],"equilibrium":[13],"traffic":[14,29,52,135,149,156],"assignment.":[15],"The":[16,66,82,101,152],"are":[18,32,58],"used":[19],"pre-trip":[21],"assignment,":[22],"which":[23,37,118,158],"reflects":[24],"driver":[25,142],"familiarity":[26],"with":[27,140],"expected":[28],"conditions,":[30],"and":[31,49,56,76,179],"appropriate":[33],"off-line":[35],"applications":[36],"require":[38],"a":[39,71,77,92,97,108,147,162,165],"more":[40],"detailed":[41],"analysis":[42],"\u2013":[43,55],"such":[44],"as":[45,70,91],"temporal":[46],"network":[47,189],"flows":[48,88,113],"sensitivity":[50],"to":[51,133,145,181],"control":[53],"measures":[54],"thus":[57],"not":[59],"well":[60],"served":[61],"by":[62,161],"static":[63,188],"assignment":[64,174,190],"models.":[65],"model":[67],"is":[68,80,89,114,119,138,159,177],"formulated":[69],"time":[72],"discrete":[73],"variational":[74],"inequality":[75],"solution":[78,131],"algorithm":[79],"developed.":[81],"determination":[83,102],"time-dependent":[85],"path":[86,104,112],"input":[87],"modeled":[90],"master":[93],"problem":[94,137],"inspired":[95,186],"from":[96,187],"simplicial":[98],"decomposition":[99],"approach.":[100],"travel":[105],"times":[106],"given":[109],"set":[110],"network-loading":[116],"sub-problem,":[117],"solved":[120],"using":[121],"computationally":[123],"efficient":[124],"space-time":[125],"queuing":[126],"approach":[127],"Mahut.":[129],"method":[132],"flow":[136],"combined":[139],"heuristic":[141],"behavior":[143],"models":[144],"produce":[146],"fully-featured":[148],"simulation":[150],"model.":[151],"complexity":[153],"simulation,":[157],"motivated":[160],"desire":[163],"realistic":[166],"representation":[167],"system,":[170],"results":[171],"in":[172],"an":[173],"map":[175],"that":[176],"discontinuous":[178],"difficult":[180],"characterize":[182],"analytically.":[183],"Nevertheless,":[184],"have":[191]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-09-29T14:09:16.559479","created_date":"2016-06-24T00:00:00"}