{"id":"https://openalex.org/W293846720","doi":null,"title":"Linear User Cost Equilibrium: The New Algorithm for Traffic Assignment in VISUM","display_name":"Linear User Cost Equilibrium: The New Algorithm for Traffic Assignment in VISUM","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W293846720","mag":"293846720"},"language":"en","primary_location":{"id":"pmh:oai:iris.uniroma1.it:11573/57271","doi":null,"is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/57271","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","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":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"},"volume":null,"type":"conference-paper","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/A5058794623","display_name":"Guido Gentile","orcid":"https://orcid.org/0000-0002-1523-1640","observed_orcids":["https://orcid.org/0000-0002-1523-1640"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guido Gentile","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-1523-1640","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5109007847","display_name":"Klaus N\u00f6kel","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Klaus Noekel","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-4113-6951","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.4949,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.96141051,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"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.9922000169754028,"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.9922000169754028,"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.002400000113993883,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.000699999975040555,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/traffic-assignment","display_name":"traffic assignment","score":0.9700000286102295},{"id":"https://openalex.org/keywords/visum","display_name":"VISUM","score":0.8209999799728394},{"id":"https://openalex.org/keywords/user-equilibrium","display_name":"user equilibrium","score":0.7049999833106995},{"id":"https://openalex.org/keywords/linear-programming","display_name":"linear programming","score":0.5230000019073486},{"id":"https://openalex.org/keywords/network-load","display_name":"network load","score":0.546999990940094},{"id":"https://openalex.org/keywords/origin-destination-demand","display_name":"origin-destination demand","score":0.5979999899864197},{"id":"https://openalex.org/keywords/convergence-rate","display_name":"convergence rate","score":0.6769999861717224}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6458826065063477},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6446343660354614},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6170915365219116},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5469834804534912},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5197474956512451},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.49910426139831543},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4973314106464386},{"id":"https://openalex.org/C2778753846","wikidata":"https://www.wikidata.org/wiki/Q6554239","display_name":"Link (geometry)","level":2,"score":0.4803386926651001},{"id":"https://openalex.org/C2985733770","wikidata":"https://www.wikidata.org/wiki/Q1233007","display_name":"Travel time","level":2,"score":0.4738362729549408},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4583858847618103},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44250476360321045},{"id":"https://openalex.org/C207512268","wikidata":"https://www.wikidata.org/wiki/Q3074551","display_name":"Traffic flow (computer networking)","level":2,"score":0.42391490936279297},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.4189622402191162},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20225217938423157},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1693032681941986},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.15009477734565735},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.11465135216712952},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.09214532375335693},{"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:iris.uniroma1.it:11573/57271","doi":null,"is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/57271","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","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":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"mag:293846720","doi":null,"is_oa":false,"landing_page_url":"https://trid.trb.org/view/1107482","pdf_url":null,"source":{"id":"https://openalex.org/S4306510168","display_name":"European Transport Conference, 2010Association for European Transport (AET)","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":null,"is_accepted":false,"is_published":false,"raw_source_name":"European Transport Conference, 2009Association for European Transport (AET)","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.428600013256073,"display_name":"Industry, innovation and infrastructure"},{"id":"https://metadata.un.org/sdg/11","score":0.4000000059604645,"display_name":"Sustainable cities and communities"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7097963798","https://openalex.org/W7096522488","https://openalex.org/W2001422140","https://openalex.org/W7057860503","https://openalex.org/W2044158897","https://openalex.org/W2053806224","https://openalex.org/W585442347","https://openalex.org/W2089797364","https://openalex.org/W2356879444","https://openalex.org/W563350828"],"abstract_inverted_index":{"This":[0],"paper":[1,30],"describes":[2],"how":[3],"Linear":[4],"User":[5],"Cost":[6],"Equilibrium":[7],"(LUCE)":[8],"is":[9,31,122],"the":[10,29,41,53,71,76,80,87,114,126,136,141,144,163,169],"new":[11],"algorithm":[12],"designed":[13],"to":[14,32,63,74,93,113,149,162],"solve":[15],"traffic":[16],"assignment":[17],"with":[18,82,111,147],"deterministic":[19],"route":[20,43],"choice":[21,44],"available":[22],"in":[23,97],"VISUM.":[24],"The":[25,59,91,119],"main":[26],"idea":[27],"of":[28,45,55,66,99,143,172],"seek":[33],"at":[34,86,180],"every":[35],"node":[36],"a":[37,49,108,154],"user":[38],"equilibrium":[39],"for":[40,104],"local":[42],"drivers":[46],"directed":[47],"toward":[48],"same":[50],"destination":[51,77,100],"among":[52],"links":[54],"its":[56],"forward":[57],"star.":[58],"cost":[60],"function":[61],"associated":[62],"each":[64,105,173],"one":[65],"these":[67],"travel":[68],"alternatives":[69],"expresses":[70],"average":[72],"impedance":[73],"reach":[75],"by":[78,140],"continuing":[79],"trip":[81],"that":[83,159],"link,":[84],"linearized":[85],"current":[88],"flow":[89,171],"pattern.":[90],"solution":[92],"such":[94],"linear":[95],"program":[96],"terms":[98],"flows,":[101,151],"recursively":[102],"applied":[103],"node,":[106],"provides":[107],"descent":[109],"direction":[110],"respect":[112,148],"classical":[115],"sum-integral":[116],"objective":[117],"function.":[118],"network":[120],"loading":[121],"then":[123],"performed":[124],"through":[125],"corresponding":[127],"splitting":[128],"rates,":[129],"thus":[130],"avoiding":[131],"explicit":[132],"path":[133],"enumeration.":[134],"Exploiting":[135],"inexpensive":[137],"information":[138],"provided":[139],"derivatives":[142],"link":[145,150],"costs":[146],"LUCE":[152],"achieves":[153],"very":[155],"high":[156],"convergence":[157],"speed":[158],"compares":[160],"favorably":[161],"other":[164],"methods,":[165],"while":[166],"it":[167],"assigns":[168],"demand":[170],"origin-destination":[174],"(o-d)":[175],"couple":[176],"on":[177],"several":[178],"paths":[179],"once.":[181]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":6},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-10-31T12:09:11.096373","created_date":"2016-06-24T00:00:00"}