{"id":"https://openalex.org/W2994987435","doi":"https://doi.org/10.1145/3362693","title":"Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies","display_name":"Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies","publication_year":2019,"publication_date":"2019-12-10","ids":{"openalex":"https://openalex.org/W2994987435","doi":"https://doi.org/10.1145/3362693","mag":"2994987435"},"language":"en","primary_location":{"id":"doi:10.1145/3362693","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3362693","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","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/A5012490728","display_name":"Valentin Buchhold","orcid":null},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Valentin Buchhold","raw_affiliation_strings":["Karlsruhe Institute of Technology, Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"Karlsruhe Institute of Technology, Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082922326","display_name":"Peter Sanders","orcid":"https://orcid.org/0000-0003-3330-9349"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Peter Sanders","raw_affiliation_strings":["Karlsruhe Institute of Technology, Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"Karlsruhe Institute of Technology, Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045460793","display_name":"Dorothea Wagner","orcid":"https://orcid.org/0000-0002-9141-7076"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Dorothea Wagner","raw_affiliation_strings":["Karlsruhe Institute of Technology, Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"Karlsruhe Institute of Technology, Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5012490728"],"corresponding_institution_ids":["https://openalex.org/I102335020"],"apc_list":null,"apc_paid":null,"fwci":5.2962,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.94439303,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"24","issue":null,"first_page":"1","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9998999834060669,"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.9998999834060669,"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/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/computer-science","display_name":"Computer science","score":0.7309685945510864},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.6511741876602173},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5349164605140686},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5312307476997375},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5234721899032593},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4371644854545593},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3630993366241455},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.28298714756965637},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.27895334362983704},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25741273164749146},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2093939185142517},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15581125020980835}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7309685945510864},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6511741876602173},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5349164605140686},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5312307476997375},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5234721899032593},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4371644854545593},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3630993366241455},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.28298714756965637},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.27895334362983704},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25741273164749146},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2093939185142517},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15581125020980835},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3362693","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3362693","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.8500000238418579,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":51,"referenced_works":["https://openalex.org/W82786942","https://openalex.org/W104648112","https://openalex.org/W125936143","https://openalex.org/W280512313","https://openalex.org/W574693243","https://openalex.org/W1493214567","https://openalex.org/W1542473770","https://openalex.org/W1546693390","https://openalex.org/W1555522781","https://openalex.org/W1571048466","https://openalex.org/W1601313669","https://openalex.org/W1603205161","https://openalex.org/W1779869868","https://openalex.org/W1904636577","https://openalex.org/W1963503748","https://openalex.org/W1969483458","https://openalex.org/W2000991574","https://openalex.org/W2001422140","https://openalex.org/W2002950946","https://openalex.org/W2008971185","https://openalex.org/W2009303970","https://openalex.org/W2025149596","https://openalex.org/W2053806224","https://openalex.org/W2071974437","https://openalex.org/W2083019227","https://openalex.org/W2083359900","https://openalex.org/W2104317982","https://openalex.org/W2136254806","https://openalex.org/W2136885855","https://openalex.org/W2137541800","https://openalex.org/W2143083884","https://openalex.org/W2144957324","https://openalex.org/W2161233707","https://openalex.org/W2162544994","https://openalex.org/W2169528473","https://openalex.org/W2170628445","https://openalex.org/W2234917253","https://openalex.org/W2235269566","https://openalex.org/W2256374442","https://openalex.org/W2288961969","https://openalex.org/W2353153784","https://openalex.org/W2396807023","https://openalex.org/W2465485717","https://openalex.org/W2763541341","https://openalex.org/W2782478469","https://openalex.org/W2963809597","https://openalex.org/W2987999854","https://openalex.org/W2999097525","https://openalex.org/W3123524401","https://openalex.org/W3198160809","https://openalex.org/W4205962651"],"related_works":["https://openalex.org/W2739169310","https://openalex.org/W2188198585","https://openalex.org/W2155982312","https://openalex.org/W1493214567","https://openalex.org/W1490507553","https://openalex.org/W2133488890","https://openalex.org/W2091635795","https://openalex.org/W1039385342","https://openalex.org/W2117758387","https://openalex.org/W2810863475"],"abstract_inverted_index":{"Given":[0],"an":[1],"urban":[2,49],"road":[3,22],"network":[4],"and":[5,48,67,72,74,146,165],"a":[6,28,57,115,129,150,155],"set":[7],"of":[8,31,42,111,157,162,170],"origin-destination":[9],"pairs,":[10],"the":[11,17,40,86,112,125,160,163,173],"traffic":[12,18,58,87],"assignment":[13,59,88],"problem":[14],"asks":[15],"for":[16,108,128],"flow":[19,43],"on":[20,143,149],"each":[21],"segment.":[23],"Common":[24],"solution":[25],"algorithms":[26],"require":[27],"large":[29],"number":[30],"shortest-path":[32],"computations.":[33],"In":[34,97],"this":[35,54],"article,":[36],"we":[37,123],"significantly":[38],"accelerate":[39],"computation":[41,127],"patterns,":[44],"enabling":[45],"interactive":[46],"transportation":[47],"planning":[50],"applications.":[51],"We":[52],"achieve":[53],"by":[55,85],"building":[56],"procedure":[60],"upon":[61],"customizable":[62],"contraction":[63],"hierarchies":[64],"(CCH),":[65],"revisiting":[66],"carefully":[68],"engineering":[69],"CCH":[70,76,94],"customization":[71],"queries,":[73],"adapting":[75],"to":[77,93,99,140],"compute":[78],"batched":[79],"point-to-point":[80],"shortest":[81],"paths.":[82],"Although":[83],"motivated":[84],"problem,":[89],"our":[90,102],"optimizations":[91],"apply":[92],"in":[95],"general.":[96],"contrast":[98],"previous":[100],"work,":[101],"evaluation":[103],"uses":[104],"real-world":[105],"production":[106],"data":[107],"all":[109],"parts":[110],"input.":[113],"On":[114],"metropolitan":[116],"area":[117],"encompassing":[118],"about":[119],"2.7":[120],"million":[121,136],"inhabitants,":[122],"decrease":[124],"flow-pattern":[126],"typical":[130],"1-hour":[131],"morning":[132],"peak":[133],"(a":[134],"quarter":[135],"trips)":[137],"from":[138],"90.9":[139],"14.1":[141],"seconds":[142,148],"one":[144],"core":[145],"2.4":[147],"16-core":[151],"machine.":[152],"This":[153],"represents":[154],"speedup":[156],"37":[158],"over":[159,172],"state":[161],"art":[164],"more":[166],"than":[167],"three":[168],"orders":[169],"magnitude":[171],"Dijkstra-based":[174],"baseline.":[175]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1}],"updated_date":"2026-03-18T14:38:29.013473","created_date":"2025-10-10T00:00:00"}