{"id":"https://openalex.org/W2137404994","doi":"https://doi.org/10.1109/itsc.2005.1520054","title":"An heuristic algorithm for simulation-based dynamic traffic assignment","display_name":"An heuristic algorithm for simulation-based dynamic traffic assignment","publication_year":2005,"publication_date":"2005-10-24","ids":{"openalex":"https://openalex.org/W2137404994","doi":"https://doi.org/10.1109/itsc.2005.1520054","mag":"2137404994"},"language":"en","primary_location":{"id":"doi:10.1109/itsc.2005.1520054","doi":"https://doi.org/10.1109/itsc.2005.1520054","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc.2005.1520054","pdf_url":null,"source":{"id":"https://openalex.org/S4363607737","display_name":"IEEE International Conference on Intelligent Transportation Systems (ITSC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 2005 IEEE Intelligent Transportation Systems, 2005.","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","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/A5072239522","display_name":"Michael Mahut","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4210096774","display_name":"Inro Consultants (Canada)","ror":"https://ror.org/00vbmfk28","country_code":"CA","type":"company","lineage":["https://openalex.org/I4210096774"]},{"id":"https://openalex.org/I70931966","display_name":"Universit\u00e9 de Montr\u00e9al","ror":"https://ror.org/0161xgx34","country_code":"CA","type":"education","lineage":["https://openalex.org/I70931966"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"M. Mahut","raw_affiliation_strings":["Research associate with INRO Consultants, Tranportation, University of Montreal, Montreal, Canada","Centre for Res. on Transp., Montreal Univ., Que., Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research associate with INRO Consultants, Tranportation, University of Montreal, Montreal, Canada","institution_ids":["https://openalex.org/I4210096774","https://openalex.org/I70931966"]},{"raw_affiliation_string":"Centre for Res. on Transp., Montreal Univ., Que., Canada","institution_ids":["https://openalex.org/I70931966"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5072239522"],"corresponding_institution_ids":["https://openalex.org/I4210096774","https://openalex.org/I70931966"],"apc_list":null,"apc_paid":null,"fwci":2.7775,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.91572123,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"239","last_page":"244"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9326000213623047,"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.9326000213623047,"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.05590000003576279,"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/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.0010999999940395355,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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.9990000128746033},{"id":"https://openalex.org/keywords/heuristic-algorithms","display_name":"heuristic algorithms","score":0.7929999828338623},{"id":"https://openalex.org/keywords/iterative-methods","display_name":"iterative methods","score":0.6190000176429749},{"id":"https://openalex.org/keywords/time-dependent-travel-times","display_name":"time-dependent travel times","score":0.6859999895095825},{"id":"https://openalex.org/keywords/traffic-simulation","display_name":"traffic simulation","score":0.7580000162124634},{"id":"https://openalex.org/keywords/method-of-successive-averages","display_name":"method of successive averages","score":0.7870000004768372},{"id":"https://openalex.org/keywords/convergence-to-equilibrium","display_name":"convergence to equilibrium","score":0.7059999704360962},{"id":"https://openalex.org/keywords/queue-length","display_name":"queue length","score":0.777999997138977},{"id":"https://openalex.org/keywords/transportation-networks","display_name":"transportation networks","score":0.40400001406669617}],"concepts":[{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.7167412638664246},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7119992971420288},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6335201263427734},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.6278979778289795},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6031988859176636},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5617797374725342},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5412812232971191},{"id":"https://openalex.org/C774472","wikidata":"https://www.wikidata.org/wiki/Q6760393","display_name":"Margin (machine learning)","level":2,"score":0.4519760310649872},{"id":"https://openalex.org/C176715033","wikidata":"https://www.wikidata.org/wiki/Q2080768","display_name":"Traffic generation model","level":2,"score":0.4267701804637909},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1828191578388214},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.1345691680908203},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itsc.2005.1520054","doi":"https://doi.org/10.1109/itsc.2005.1520054","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc.2005.1520054","pdf_url":null,"source":{"id":"https://openalex.org/S4363607737","display_name":"IEEE International Conference on Intelligent Transportation Systems (ITSC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 2005 IEEE Intelligent Transportation Systems, 2005.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.428600013256073,"id":"https://metadata.un.org/sdg/9"},{"display_name":"Sustainable cities and communities","score":0.4000000059604645,"id":"https://metadata.un.org/sdg/11"}],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W614121883","https://openalex.org/W2010043493","https://openalex.org/W2018745865","https://openalex.org/W2023981657","https://openalex.org/W2043530786","https://openalex.org/W2086181527","https://openalex.org/W2155312473","https://openalex.org/W2173494869","https://openalex.org/W2266080788","https://openalex.org/W4231514922"],"related_works":["https://openalex.org/W589223315","https://openalex.org/W2021331599","https://openalex.org/W1554983366","https://openalex.org/W1990934052","https://openalex.org/W2977949220","https://openalex.org/W1490568856","https://openalex.org/W2835100664","https://openalex.org/W2119664473","https://openalex.org/W65856499","https://openalex.org/W650057235"],"abstract_inverted_index":{"ITS":[0],"technologies":[1],"that":[2,94],"aim":[3],"to":[4,37,153,161],"improve,":[5],"and":[6,17,21,160],"ideally":[7],"optimize,":[8],"the":[9,12,30,39,47,57,68,124,141,165],"utilization":[10],"of":[11,54,123,126],"transportation":[13],"network":[14,48],"require":[15],"accurate":[16],"efficient":[18],"traffic":[19,32,85],"models":[20,27],"algorithms.":[22],"For":[23],"many":[24],"applications,":[25],"these":[26,158],"must":[28],"solve":[29],"dynamic":[31,69],"assignment":[33,73],"problem":[34],"-":[35,49],"i.e.,":[36],"find":[38],"optimal":[40],"path":[41,91],"choices":[42],"for":[43,67,109],"all":[44],"vehicles":[45],"in":[46,56,83,89,136],"within":[50],"a":[51,84,104,121],"reasonable":[52],"margin":[53],"error":[55],"shortest":[58],"possible":[59],"time.":[60],"This":[61],"paper":[62],"presents":[63],"an":[64],"iterative":[65],"algorithm":[66,76],"(time":[70],"dependent)":[71],"user-optimal":[72,97],"problem.":[74],"The":[75,99,130,148],"produces":[77],"time-dependent":[78],"assignments":[79],"which,":[80],"when":[81],"used":[82],"simulation":[86],"model,":[87],"result":[88],"experienced":[90],"travel":[92],"times":[93],"approximately":[95],"satisfy":[96],"conditions.":[98],"model":[100,131,150],"is":[101,151],"tested":[102],"on":[103],"small":[105],"but":[106],"challenging":[107],"network,":[108],"which":[110],"convergence":[111],"(to":[112],"equilibrium)":[113],"results":[114,132],"are":[115,133],"compared":[116],"with":[117,140],"those":[118],"obtained":[119],"using":[120],"variant":[122],"method":[125],"successive":[127],"averages":[128],"(MSA).":[129],"also":[134],"examined":[135],"detail":[137],"by":[138],"comparison":[139],"exact":[142],"equilibrium":[143],"queue":[144],"lengths":[145],"determined":[146],"analytically.":[147],"proposed":[149],"found":[152],"perform":[154],"very":[155],"well":[156],"under":[157],"tests,":[159],"converge":[162],"faster":[163],"than":[164],"MSA.":[166]},"counts_by_year":[{"year":2016,"cited_by_count":2}],"updated_date":"2026-10-27T15:51:10.671819","created_date":"2016-06-24T00:00:00"}